oj.uz

답안 #950050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950050 2024-03-20T04:13:54 Z quanlt206 Gap (APIO16_gap) C++17
39.5321 / 100
 65 ms 15724 KB 
#include "gap.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 1e5 + 7;

ll a[N], b[N];
int n;
int cntQuery = 0;

ll sub1(int n) {
    int l = 1, r = n;
    ll s = 0, t = 1e18;
    while (l <= r) {
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(s, t, mn, mx);
        a[l] = *mn;
        a[r] = *mx;
        l++;
        r--;
        s = *mn + 1;
        t = *mx - 1;
    }
    ll res = 0;
    REP(i, 1, n) maximize(res, a[i + 1] - a[i]);
    return res;
}

ll findGap(int T, int n) {
    if (T == 1 || n <= 7) return sub1(n);
    a[0] = -1;
    ll res = 0;
    int i = 1;
    ll* mn = new ll();
    ll* mx = new ll();
    MinMax(0, 1e18, mn, mx);
    ll Max = *mx, Min = *mn;
    res = (Max - Min) / (n - 1);
//    res = 0;
    while (i <= n) {
        if (a[i - 1] == Max) break;
//        cout<<i<<" "<<cntQuery<<"\n";
//        cerr<<i<<" "<<a[i]<<endl;
        // check a[i - 1] + 1 == a[i]
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(a[i - 1] + 1, a[i - 1] + 1, mn, mx);
        if (*mn != -1) {
            a[i] = a[i - 1] + 1;
            maximize(res, 1);
            i++;
            continue;
        }
        ll last = a[i - 1];
        if (res > 0) {
            // check a[i - 1] + res >= a[i]
            ll *mn = new ll();
            ll *mx = new ll();
            MinMax(last, last + res, mn, mx);
//            cout<<i<<" "<<last<<" "<<last + res<<" "<<*mx<<"\n";
            if (*mx > last) {
                a[i] = *mx;
                if (i > 1) maximize(res, a[i] - a[i - 1]);
                i++;
                continue;
            }
        }
        ll v = 0;
        FORD(i, 60, 0) {
            ll *mn = new ll();
            ll *mx = new ll();
            MinMax(last + 1, last + v + MASK(i), mn, mx);
            if (*mn == -1) v+=MASK(i);
        }
        a[i] = last + v + 1;
        if (i > 1) maximize(res, a[i] - a[i - 1]);
        i++;
    }
//    cout<<res<<"\n";
//    FOR(i, 1, n) cout<<a[i]<<" "; cout<<"\n";
    return res;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 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 1 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 2492 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 9 ms 3472 KB Output is correct
17 Correct 8 ms 3304 KB Output is correct
18 Correct 8 ms 3292 KB Output is correct
19 Correct 8 ms 3300 KB Output is correct
20 Correct 7 ms 3280 KB Output is correct
21 Correct 35 ms 6500 KB Output is correct
22 Correct 30 ms 6528 KB Output is correct
23 Correct 29 ms 6520 KB Output is correct
24 Correct 30 ms 6452 KB Output is correct
25 Correct 27 ms 6404 KB Output is correct
26 Correct 30 ms 6524 KB Output is correct
27 Correct 32 ms 6520 KB Output is correct
28 Correct 30 ms 6528 KB Output is correct
29 Correct 29 ms 6528 KB Output is correct
30 Correct 25 ms 6520 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
9.5321032254 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Partially correct 1 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2648 KB Partially correct
16 Partially correct 7 ms 3036 KB Partially correct
17 Partially correct 6 ms 2792 KB Partially correct
18 Partially correct 6 ms 2792 KB Partially correct
19 Partially correct 6 ms 2796 KB Partially correct
20 Partially correct 10 ms 4072 KB Partially correct
21 Partially correct 22 ms 3972 KB Partially correct
22 Partially correct 23 ms 3992 KB Partially correct
23 Partially correct 23 ms 4040 KB Partially correct
24 Partially correct 22 ms 3968 KB Partially correct
25 Partially correct 65 ms 15724 KB Partially correct
26 Partially correct 29 ms 4056 KB Partially correct
27 Partially correct 24 ms 4216 KB Partially correct
28 Partially correct 24 ms 4220 KB Partially correct
29 Partially correct 27 ms 4208 KB Partially correct
30 Partially correct 38 ms 9584 KB Partially correct
31 Partially correct 0 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct