Submission #3809088


Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int dx[] = {0, 0, 1, -1};
constexpr int dy[] = {1, -1, 0, 0};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int k;
    ll a[112345];

    cin >> k;

    REP(i, k)
    cin >> a[i];

    if (a[k - 1] != 2)
    {
        cout << -1 << endl;
        return 0;
    }

    ll l = 0;
    ll r = 2 + 1e9 * k;

    ll mi, ma;

    while (r - l)
    {
        ll mid = (l + r) / 2;

        ll num = mid;

        REP(i, k)
        {
            num = num - num % a[i];
        }

        if (num == 2)
        {
            r = mid;
        }
        else if (num > 2)
        {
            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }

    mi = l;

    l = 0;
    r = 2 + 1e9 * k;

    while (r - l)
    {
        ll mid = (l + r) / 2 + 1;

        ll num = mid;

        REP(i, k)
        {
            num = num - num % a[i];
        }

        if (num == 2)
        {
            l = mid;
        }
        else if (num > 2)
        {
            r = mid - 1;
        }
        else
        {
            l = mid + 1;
        }
    }

    ma = l;

    if (ma < mi)
        cout << -1 << endl;
    else
        cout << mi << " " << ma << endl;
    return 0;
}

Submission Info

Submission Time
Task B - Ice Rink Game
User Kats
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1980 Byte
Status WA
Exec Time 2103 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 25
WA × 5
TLE × 3
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt WA 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 143 ms 1024 KB
subtask_1_07.txt AC 12 ms 1024 KB
subtask_1_08.txt AC 1 ms 256 KB
subtask_1_09.txt AC 2 ms 256 KB
subtask_1_10.txt AC 9 ms 256 KB
subtask_1_11.txt AC 142 ms 1024 KB
subtask_1_12.txt AC 141 ms 1024 KB
subtask_1_13.txt AC 141 ms 1024 KB
subtask_1_14.txt WA 140 ms 1024 KB
subtask_1_15.txt TLE 2103 ms 1024 KB
subtask_1_16.txt AC 15 ms 384 KB
subtask_1_17.txt AC 147 ms 1024 KB
subtask_1_18.txt AC 146 ms 1024 KB
subtask_1_19.txt TLE 2103 ms 896 KB
subtask_1_20.txt TLE 2103 ms 1024 KB
subtask_1_21.txt WA 146 ms 1024 KB
subtask_1_22.txt AC 10 ms 1024 KB
subtask_1_23.txt AC 1 ms 256 KB
subtask_1_24.txt AC 3 ms 256 KB
subtask_1_25.txt AC 142 ms 1024 KB
subtask_1_26.txt AC 3 ms 256 KB
subtask_1_27.txt AC 139 ms 1024 KB