oj.uz

Submission #564238

# Submission time Handle Problem Language Result Execution time Memory
564238 2022-05-18T19:27:31 Z Ooops_sorry Gap (APIO16_gap) C++14
15.7719 / 100
 338 ms 5824 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) {
    if (l > r) {
        return;
    }
    ll len = r - l + 1;
    ll mid = l + rnd() % len, mn, mx;
    if (rnd() % 2) {
        MinMax(mid, r, &mn, &mx);
        if (mn != -1) {
            st.insert(mn);
            st.insert(mx);
            solve(mn + 1, mx - 1);
        }
        solve(l, mid - 1);
    } else {
        MinMax(l, mid, &mn, &mx);
        if (mn != -1) {
            st.insert(mn);
            st.insert(mx);
            solve(mn + 1, mx - 1);
        }
        solve(mid + 1, r);
    }
}

long long findGap(int t, int n) {
    solve(0, INF);
    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 208 KB Output isn't correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Incorrect 1 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 1 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 4 ms 384 KB Output isn't correct
12 Incorrect 4 ms 336 KB Output isn't correct
13 Incorrect 4 ms 336 KB Output isn't correct
14 Incorrect 5 ms 336 KB Output isn't correct
15 Incorrect 2 ms 336 KB Output isn't correct
16 Incorrect 67 ms 1768 KB Output isn't correct
17 Incorrect 68 ms 1664 KB Output isn't correct
18 Incorrect 85 ms 1624 KB Output isn't correct
19 Incorrect 72 ms 1628 KB Output isn't correct
20 Incorrect 17 ms 1680 KB Output isn't correct
21 Incorrect 271 ms 5824 KB Output isn't correct
22 Incorrect 304 ms 5680 KB Output isn't correct
23 Incorrect 308 ms 5716 KB Output isn't correct
24 Incorrect 286 ms 5740 KB Output isn't correct
25 Incorrect 180 ms 5664 KB Output isn't correct
26 Incorrect 285 ms 5752 KB Output isn't correct
27 Incorrect 338 ms 5712 KB Output isn't correct
28 Incorrect 290 ms 5764 KB Output isn't correct
29 Incorrect 308 ms 5720 KB Output isn't correct
30 Incorrect 69 ms 5692 KB Output isn't correct
31 Incorrect 1 ms 336 KB Output isn't correct
32 Incorrect 1 ms 336 KB Output isn't correct

Subtask #2
15.7718850743 / 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 1 ms 208 KB Partially correct
5 Partially correct 1 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 4 ms 400 KB Partially correct
12 Partially correct 4 ms 404 KB Partially correct
13 Partially correct 10 ms 336 KB Partially correct
14 Partially correct 4 ms 336 KB Partially correct
15 Partially correct 4 ms 336 KB Partially correct
16 Partially correct 72 ms 1624 KB Partially correct
17 Partially correct 64 ms 1584 KB Partially correct
18 Partially correct 64 ms 1560 KB Partially correct
19 Partially correct 62 ms 1632 KB Partially correct
20 Partially correct 14 ms 1676 KB Partially correct
21 Partially correct 257 ms 5768 KB Partially correct
22 Partially correct 292 ms 5672 KB Partially correct
23 Partially correct 257 ms 5708 KB Partially correct
24 Partially correct 274 ms 5668 KB Partially correct
25 Partially correct 189 ms 5792 KB Partially correct
26 Partially correct 255 ms 5696 KB Partially correct
27 Partially correct 258 ms 5780 KB Partially correct
28 Partially correct 271 ms 5784 KB Partially correct
29 Partially correct 258 ms 5780 KB Partially correct
30 Partially correct 67 ms 5796 KB Partially correct
31 Partially correct 1 ms 208 KB Partially correct
32 Partially correct 1 ms 336 KB Partially correct