oj.uz

Submission #1015172

# Submission time Handle Problem Language Result Execution time Memory
1015172 2024-07-06T06:59:45 Z scars Gap (APIO16_gap) C++17
30 / 100
 32 ms 1972 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());
int Random(int l, int r) {
    return uniform_int_distribution<int>(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;
        }
    }
 
    M += optR - optL + 1+1;
    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 answer = 1, lst = a[1];
    int j(0);
    bool check = 1;
    while(check) {
        check = 0;
        ll pos(lst);
        //cout << pos << ":\n";
        for (; j < 60; ++j) {
            ll s, t;
            MinMax(pos + 1, pos + (1LL << (j + 1)) - 1, &s, &t);
            //cout << s << ' ' << t << '\n';
            if(s != -1) {
                answer = max(answer, s - lst);
                lst = t;
                check = 1;
                break;
            }
        }
    }
 
    return answer;
}
 
#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;
    for (int i = 1; i <= N; ++i) {
        cin >> _A[i];
        //_A[i] = _A[i - 1] + Random(1, 1e9); cout << _A[i] << " \n"[i == N];
    }
 
    M = 0;
    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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 372 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 6 ms 856 KB Output is correct
18 Correct 7 ms 856 KB Output is correct
19 Correct 8 ms 660 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 30 ms 1972 KB Output is correct
22 Correct 32 ms 1776 KB Output is correct
23 Correct 23 ms 1880 KB Output is correct
24 Correct 23 ms 1872 KB Output is correct
25 Correct 24 ms 1880 KB Output is correct
26 Correct 25 ms 1880 KB Output is correct
27 Correct 25 ms 1896 KB Output is correct
28 Correct 30 ms 1880 KB Output is correct
29 Correct 25 ms 1880 KB Output is correct
30 Correct 19 ms 1880 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Partially correct 1 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 1 ms 344 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Incorrect 0 ms 420 KB Output isn't correct
15 Partially correct 1 ms 344 KB Partially correct
16 Incorrect 4 ms 600 KB Output isn't correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 4 ms 448 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 15 ms 1112 KB Output is correct
22 Correct 18 ms 1112 KB Output is correct
23 Correct 15 ms 1112 KB Output is correct
24 Correct 15 ms 1112 KB Output is correct
25 Partially correct 30 ms 1112 KB Partially correct
26 Correct 15 ms 1112 KB Output is correct
27 Correct 15 ms 1112 KB Output is correct
28 Correct 23 ms 1220 KB Output is correct
29 Correct 16 ms 1112 KB Output is correct
30 Correct 15 ms 1112 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct