oj.uz

Submission #564269

# Submission time Handle Problem Language Result Execution time Memory
564269 2022-05-18T19:48:15 Z Ooops_sorry Gap (APIO16_gap) C++14
100 / 100
 71 ms 5808 KB 
#include<bits/stdc++.h>
#ifndef LOCAL
    #include "gap.h"
#endif

#define ll long long

using namespace std;

#ifdef LOCAL
    static void my_assert(int k){ if (!k) exit(1); }

    static int subtask_num, N;
    static long long A[100001];
    static long long call_count;
    void MinMax(long long s, long long t, long long *mn, long long *mx)
    {
        int lo = 1, hi = N, left = N+1, right = 0;
        my_assert(s <= t && mn != NULL && mx != NULL);
        while (lo <= hi){
            int mid = (lo+hi)>>1;
            if (A[mid] >= s) hi = mid - 1, left = mid;
            else lo = mid + 1;
        }
        lo = 1, hi = N;
        while (lo <= hi){
            int mid = (lo+hi)>>1;
            if (A[mid] <= t) lo = mid + 1, right = mid;
            else hi = mid - 1;
        }
        if (left > right) *mn = *mx = -1;
        else{
            *mn = A[left];
            *mx = A[right];
        }
        if (subtask_num == 1) call_count++;
        else if (subtask_num == 2) call_count += right-left+2;
    }
#endif // LOCAL

set<ll> st;
const ll INF = 1e18;

mt19937_64 rnd(51);

long long findGap(int t, int n) {
    if (t == 1) {
        ll l = 0, r = INF, res = 0, last = -1;
        for (int i = 0; i < (n + 1) / 2; i++) {
            ll mn, mx;
            MinMax(l, r, &mn, &mx);
            if (mn == -1) {
                break;
            }
            st.insert(mn);
            st.insert(mx);
            l = mn + 1, r = mx - 1;
        }
        for (auto to : st) {
            if (last != -1) {
                res = max(res, to - last);
            }
            last = to;
        }
        return res;
    } else {
        ll a, b;
        MinMax(0, INF, &a, &b);
        ll len = max(1ll, (b - a - 1) / (n - 1) + 1), now = a + 1, last = a, ans = 0;
        for (int i = 0; i < n; i++) {
            ll mn, mx;
            MinMax(now, now + len - 1, &mn, &mx);
            if (mn != -1) {
                if (last != -1) {
                    ans = max(ans, mn - last);
                }
                last = mx;
            }
            now += len;
        }
        return ans;
    }
}

#ifdef LOCAL
    int main()
    {
        FILE *in = stdin, *out = stdout;
        my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
        my_assert(1 <= subtask_num && subtask_num <= 2);
        my_assert(2 <= N && N <= 100000);
        for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
        for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
        fprintf(out, "%lld\n", findGap(subtask_num, N));
        fprintf(out, "%lld\n", call_count);
    }

#endif

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 14 ms 1576 KB Output is correct
17 Correct 14 ms 1600 KB Output is correct
18 Correct 16 ms 1676 KB Output is correct
19 Correct 13 ms 1616 KB Output is correct
20 Correct 12 ms 1596 KB Output is correct
21 Correct 63 ms 5664 KB Output is correct
22 Correct 56 ms 5708 KB Output is correct
23 Correct 62 ms 5724 KB Output is correct
24 Correct 60 ms 5792 KB Output is correct
25 Correct 53 ms 5692 KB Output is correct
26 Correct 59 ms 5704 KB Output is correct
27 Correct 60 ms 5676 KB Output is correct
28 Correct 71 ms 5808 KB Output is correct
29 Correct 57 ms 5668 KB Output is correct
30 Correct 52 ms 5692 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 208 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 12 ms 516 KB Output is correct
17 Correct 13 ms 508 KB Output is correct
18 Correct 14 ms 520 KB Output is correct
19 Correct 19 ms 428 KB Output is correct
20 Correct 7 ms 464 KB Output is correct
21 Correct 59 ms 1084 KB Output is correct
22 Correct 49 ms 1060 KB Output is correct
23 Correct 56 ms 1088 KB Output is correct
24 Correct 57 ms 1052 KB Output is correct
25 Correct 52 ms 1084 KB Output is correct
26 Correct 50 ms 1040 KB Output is correct
27 Correct 56 ms 1068 KB Output is correct
28 Correct 51 ms 1040 KB Output is correct
29 Correct 51 ms 1180 KB Output is correct
30 Correct 30 ms 976 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct