oj.uz

Submission #968988

# Submission time Handle Problem Language Result Execution time Memory
968988 2024-04-24T10:49:36 Z Nhoksocqt1 Gap (APIO16_gap) C++17
30 / 100
 38 ms 3116 KB 
#ifndef Nhoksocqt1
    #include "gap.h"
#endif // Nhoksocqt1
#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
	inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
	inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Random(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

const int MAXN = 100005;

ll a[MAXN];
int nArr;

#ifdef Nhoksocqt1

ll _A[MAXN], M;

void MinMax(ll s, ll t, ll *a, ll *b) {
    int l(1), r(nArr), optL(nArr + 1), optR(-1);
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(_A[mid] >= s) {
            optL = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }

    l = 1, r = nArr;
    while(l <= r) {
        int mid = (l + r) >> 1;
        if(_A[mid] <= t) {
            optR = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }

    //cout << optL << ' ' << optR << '\n';
    M += optR - optL + 2;
    if(optL > optR) {
        *a = *b = -1;
    } else {
        *a = _A[optL], *b = _A[optR];
    }
}

#endif // Nhoksocqt1

ll findGap(int T, int N) {
    nArr = N;
    MinMax(0, ll(1e18), &a[1], &a[nArr]);
    if(T == 1) {
        for (int i = 2; i <= (nArr + 1) / 2; ++i)
            MinMax(a[i - 1] + 1, a[nArr - i + 2] - 1, &a[i], &a[nArr - i + 1]);

        ll res(0);
        for (int i = 1; i < nArr; ++i)
            res = max(res, a[i + 1] - a[i]);

        return res;
    }

    ll max_gap = (a[nArr] - a[1]) / (nArr - 1), lst = a[1];
    for (ll i = a[1]; i <= a[nArr]; i += max_gap + 1) {
        ll s, t;
        MinMax(i, i + max_gap, &s, &t);
        if(s != -1) {
            max_gap = max(max_gap, s - lst);
            lst = t;
        }
    }

    return max_gap;
}

#ifdef Nhoksocqt1

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define TASK "GAP"
    if(fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }

    int T, N;
    cin >> T >> N;

    _A[0] = 1;
    ll max_dis(0), dis(1);
    for (int i = 1; i <= N; ++i) {
        cin >> _A[i];
        _A[i] = _A[i - 1] + 2 * i; cout << _A[i] << " \n"[i == N];
        max_dis = max(max_dis, (i == 1) ? 0LL : _A[i] - _A[i - 1]);
    }

    M = 0;
    cout << "JURY: " << max_dis << '\n';
    cout << "ANSWER: " << findGap(T, N) << '\n';
    cout << "COST ASK: " << M << '\n';
    return 0;
}

#endif // Nhoksocqt1

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2484 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 2592 KB Output is correct
17 Correct 8 ms 2596 KB Output is correct
18 Correct 10 ms 2592 KB Output is correct
19 Correct 8 ms 2592 KB Output is correct
20 Correct 6 ms 2568 KB Output is correct
21 Correct 30 ms 2880 KB Output is correct
22 Correct 28 ms 2876 KB Output is correct
23 Correct 29 ms 2880 KB Output is correct
24 Correct 28 ms 3036 KB Output is correct
25 Correct 24 ms 2900 KB Output is correct
26 Correct 28 ms 2872 KB Output is correct
27 Correct 28 ms 2936 KB Output is correct
28 Correct 28 ms 3040 KB Output is correct
29 Correct 29 ms 2868 KB Output is correct
30 Correct 26 ms 3064 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 5 ms 2596 KB Output is correct
17 Correct 5 ms 2592 KB Output is correct
18 Correct 4 ms 2596 KB Output is correct
19 Correct 5 ms 2756 KB Output is correct
20 Incorrect 4 ms 2580 KB Output isn't correct
21 Correct 16 ms 2880 KB Output is correct
22 Correct 19 ms 3108 KB Output is correct
23 Correct 19 ms 3036 KB Output is correct
24 Correct 16 ms 2864 KB Output is correct
25 Correct 38 ms 3004 KB Output is correct
26 Correct 22 ms 3116 KB Output is correct
27 Correct 17 ms 2728 KB Output is correct
28 Correct 17 ms 2852 KB Output is correct
29 Correct 17 ms 2884 KB Output is correct
30 Incorrect 14 ms 2864 KB Output isn't correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct