oj.uz

답안 #949192

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949192 2024-03-19T03:32:57 Z quanlt206 Gap (APIO16_gap) C++17
30 / 100
 44 ms 9556 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) return sub1(n);
    a[0] = -1;
    ll res = 0;
    int i = 1;
    while (i <= n) {
//        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);
            if (*mx > last) {
                a[i] = *mx;
                i++;
                continue;
            }
        }
        ll v = 0;
        while (true) {
            bool kt = false;
            ll save_v = -1;
            FOR(i, 0, 60) {
                ll *mn = new ll();
                ll *mx = new ll();
                MinMax(last + 1, last + v + MASK(i), mn, mx);
                if (*mn == -1) {
                    save_v = i;
                    continue;
                }
                break;
            }
            if (save_v == -1) break;
            v+=MASK(save_v);
        }
        a[i] = last + v + 1;
        if (i > 0) maximize(res, a[i] - a[i - 1]);
        i++;
    }
    return res;
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:100:18: warning: unused variable 'kt' [-Wunused-variable]
  100 |             bool kt = false;
      |                  ^~

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 2644 KB Output is correct
4 Correct 0 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 1 ms 2392 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 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 3308 KB Output is correct
17 Correct 11 ms 3560 KB Output is correct
18 Correct 8 ms 3416 KB Output is correct
19 Correct 8 ms 3304 KB Output is correct
20 Correct 6 ms 3300 KB Output is correct
21 Correct 29 ms 6688 KB Output is correct
22 Correct 31 ms 6524 KB Output is correct
23 Correct 43 ms 6480 KB Output is correct
24 Correct 29 ms 6524 KB Output is correct
25 Correct 26 ms 6516 KB Output is correct
26 Correct 33 ms 6504 KB Output is correct
27 Correct 30 ms 6512 KB Output is correct
28 Correct 28 ms 6448 KB Output is correct
29 Correct 33 ms 6504 KB Output is correct
30 Correct 28 ms 6540 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 2392 KB Partially correct
2 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
3 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
4 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
5 Runtime error 1 ms 2392 KB Execution failed because the return code was nonzero
6 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
7 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
8 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
9 Runtime error 1 ms 2648 KB Execution failed because the return code was nonzero
10 Partially correct 0 ms 2392 KB Partially correct
11 Runtime error 2 ms 2904 KB Execution failed because the return code was nonzero
12 Runtime error 2 ms 2904 KB Execution failed because the return code was nonzero
13 Runtime error 2 ms 3160 KB Execution failed because the return code was nonzero
14 Runtime error 2 ms 2904 KB Execution failed because the return code was nonzero
15 Runtime error 1 ms 2392 KB Execution failed because the return code was nonzero
16 Runtime error 8 ms 3300 KB Execution failed because the return code was nonzero
17 Runtime error 8 ms 3304 KB Execution failed because the return code was nonzero
18 Runtime error 7 ms 3044 KB Execution failed because the return code was nonzero
19 Runtime error 8 ms 3560 KB Execution failed because the return code was nonzero
20 Partially correct 11 ms 4328 KB Partially correct
21 Runtime error 23 ms 4220 KB Execution failed because the return code was nonzero
22 Runtime error 28 ms 4440 KB Execution failed because the return code was nonzero
23 Runtime error 22 ms 4220 KB Execution failed because the return code was nonzero
24 Runtime error 23 ms 4692 KB Execution failed because the return code was nonzero
25 Runtime error 44 ms 9156 KB Execution failed because the return code was nonzero
26 Runtime error 24 ms 4720 KB Execution failed because the return code was nonzero
27 Runtime error 25 ms 4728 KB Execution failed because the return code was nonzero
28 Runtime error 25 ms 4840 KB Execution failed because the return code was nonzero
29 Runtime error 25 ms 4416 KB Execution failed because the return code was nonzero
30 Partially correct 39 ms 9556 KB Partially correct
31 Partially correct 3 ms 3672 KB Partially correct
32 Runtime error 1 ms 2392 KB Execution failed because the return code was nonzero