oj.uz

Submission #564239

# Submission time Handle Problem Language Result Execution time Memory
564239 2022-05-18T19:29:20 Z Ooops_sorry Gap (APIO16_gap) C++14
13.8295 / 100
 290 ms 5904 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);

void solve(ll l, ll r, bool d) {
    if (l > r) {
        return;
    }
    ll len = r - l + 1;
    ll mid = l + rnd() % len, mn, mx;
    if (d) {
        MinMax(mid, r, &mn, &mx);
        if (mn != -1) {
            st.insert(mn);
            st.insert(mx);
            solve(mn + 1, mx - 1, d ^ 1);
        }
        solve(l, mid - 1, d);
    } else {
        MinMax(l, mid, &mn, &mx);
        if (mn != -1) {
            st.insert(mn);
            st.insert(mx);
            solve(mn + 1, mx - 1, d ^ 1);
        }
        solve(mid + 1, r, d);
    }
}

long long findGap(int t, int n) {
    solve(0, INF, 0);
    ll last = -1, res = 0;
    for (auto to : st) {
        if (last != -1) {
            res = max(res, abs(last - to));
        }
        last = to;
    }
    return res;
}

#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
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 220 KB Output isn't correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 0 ms 208 KB Output isn't correct
6 Incorrect 1 ms 208 KB Output isn't correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Incorrect 1 ms 208 KB Output isn't correct
9 Incorrect 1 ms 208 KB Output isn't correct
10 Incorrect 0 ms 208 KB Output isn't correct
11 Incorrect 3 ms 336 KB Output isn't correct
12 Incorrect 5 ms 336 KB Output isn't correct
13 Incorrect 3 ms 336 KB Output isn't correct
14 Incorrect 3 ms 336 KB Output isn't correct
15 Incorrect 2 ms 336 KB Output isn't correct
16 Incorrect 58 ms 1612 KB Output isn't correct
17 Incorrect 57 ms 1604 KB Output isn't correct
18 Incorrect 61 ms 1668 KB Output isn't correct
19 Incorrect 71 ms 1592 KB Output isn't correct
20 Incorrect 14 ms 1616 KB Output isn't correct
21 Incorrect 250 ms 5884 KB Output isn't correct
22 Incorrect 257 ms 5680 KB Output isn't correct
23 Incorrect 290 ms 5664 KB Output isn't correct
24 Incorrect 242 ms 5816 KB Output isn't correct
25 Incorrect 173 ms 5664 KB Output isn't correct
26 Incorrect 246 ms 5672 KB Output isn't correct
27 Incorrect 254 ms 5780 KB Output isn't correct
28 Incorrect 241 ms 5668 KB Output isn't correct
29 Incorrect 237 ms 5716 KB Output isn't correct
30 Incorrect 66 ms 5688 KB Output isn't correct
31 Incorrect 1 ms 208 KB Output isn't correct
32 Incorrect 1 ms 336 KB Output isn't correct

Subtask #2
13.8295399113 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 208 KB Partially correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 0 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Partially correct 0 ms 208 KB Partially correct
6 Partially correct 1 ms 208 KB Partially correct
7 Partially correct 1 ms 208 KB Partially correct
8 Partially correct 1 ms 208 KB Partially correct
9 Partially correct 1 ms 208 KB Partially correct
10 Partially correct 1 ms 208 KB Partially correct
11 Partially correct 3 ms 336 KB Partially correct
12 Partially correct 3 ms 336 KB Partially correct
13 Partially correct 5 ms 336 KB Partially correct
14 Partially correct 5 ms 388 KB Partially correct
15 Partially correct 2 ms 336 KB Partially correct
16 Partially correct 59 ms 1576 KB Partially correct
17 Partially correct 59 ms 1656 KB Partially correct
18 Partially correct 57 ms 1608 KB Partially correct
19 Partially correct 62 ms 1648 KB Partially correct
20 Partially correct 18 ms 1680 KB Partially correct
21 Partially correct 267 ms 5868 KB Partially correct
22 Partially correct 256 ms 5704 KB Partially correct
23 Partially correct 246 ms 5768 KB Partially correct
24 Partially correct 254 ms 5732 KB Partially correct
25 Partially correct 162 ms 5732 KB Partially correct
26 Partially correct 260 ms 5768 KB Partially correct
27 Partially correct 265 ms 5772 KB Partially correct
28 Partially correct 237 ms 5784 KB Partially correct
29 Partially correct 273 ms 5904 KB Partially correct
30 Partially correct 55 ms 5704 KB Partially correct
31 Partially correct 0 ms 336 KB Partially correct
32 Partially correct 1 ms 208 KB Partially correct