# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1101316 | 2024-10-16T04:59:57 Z | huyngo | Gap (APIO16_gap) | C++17 | 43 ms | 4100 KB |
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define ll long long long long findGap(int T, int N) { if (T == 1) { vector<ll> a; auto calc = [&](auto self, ll l, ll r) -> void { if (l > r || a.size() == N) return; ll x, y; MinMax(l, r, &x, &y); if (x != -1) a.push_back(x); if (y != x) a.push_back(y); self(self, x + 1, y - 1); }; calc(calc, 0, 1e18); sort(a.begin(), a.end()); ll res = a[1] - a[0]; for (int i = 2; i < N; ++i) res = max(res, a[i] - a[i - 1]); return res; } ll x, y, res = 1; MinMax(0, 1e18, &x, &y); while (true) { // find furest from x where [x+1, m] = -1 if (x >= y || x + res >= y) break; ll u, v; MinMax(x + 1, x + res, &u, &v); if (u != -1) { x = v; continue; } ll l = x + res, r = y, sf = l; while (l <= r) { ll m = (l + r) / 2; MinMax(x + 1, m, &u, &v); if (u == -1) { l = m + 1; sf = max(sf, m); res = max(res, m - x + 1); } else r = m - 1; } x = sf + 1; } return res; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 336 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 1 ms | 336 KB | Output is correct |
6 | Correct | 1 ms | 336 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 336 KB | Output is correct |
9 | Correct | 1 ms | 336 KB | Output is correct |
10 | Correct | 1 ms | 336 KB | Output is correct |
11 | Correct | 1 ms | 336 KB | Output is correct |
12 | Correct | 1 ms | 336 KB | Output is correct |
13 | Correct | 1 ms | 336 KB | Output is correct |
14 | Correct | 1 ms | 336 KB | Output is correct |
15 | Correct | 1 ms | 336 KB | Output is correct |
16 | Correct | 10 ms | 1484 KB | Output is correct |
17 | Correct | 9 ms | 1484 KB | Output is correct |
18 | Correct | 10 ms | 1484 KB | Output is correct |
19 | Correct | 9 ms | 1484 KB | Output is correct |
20 | Correct | 8 ms | 1484 KB | Output is correct |
21 | Correct | 35 ms | 4000 KB | Output is correct |
22 | Correct | 36 ms | 4036 KB | Output is correct |
23 | Correct | 34 ms | 4100 KB | Output is correct |
24 | Correct | 43 ms | 4072 KB | Output is correct |
25 | Correct | 33 ms | 4036 KB | Output is correct |
26 | Correct | 35 ms | 4028 KB | Output is correct |
27 | Correct | 36 ms | 4036 KB | Output is correct |
28 | Correct | 37 ms | 4028 KB | Output is correct |
29 | Correct | 34 ms | 4028 KB | Output is correct |
30 | Correct | 31 ms | 4032 KB | Output is correct |
31 | Correct | 1 ms | 336 KB | Output is correct |
32 | Correct | 1 ms | 336 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 336 KB | Partially correct |
2 | Partially correct | 1 ms | 336 KB | Partially correct |
3 | Partially correct | 1 ms | 336 KB | Partially correct |
4 | Partially correct | 1 ms | 336 KB | Partially correct |
5 | Partially correct | 1 ms | 336 KB | Partially correct |
6 | Partially correct | 1 ms | 336 KB | Partially correct |
7 | Partially correct | 1 ms | 336 KB | Partially correct |
8 | Partially correct | 1 ms | 336 KB | Partially correct |
9 | Partially correct | 1 ms | 336 KB | Partially correct |
10 | Correct | 1 ms | 336 KB | Output is correct |
11 | Partially correct | 1 ms | 504 KB | Partially correct |
12 | Partially correct | 1 ms | 336 KB | Partially correct |
13 | Partially correct | 1 ms | 336 KB | Partially correct |
14 | Partially correct | 1 ms | 336 KB | Partially correct |
15 | Partially correct | 1 ms | 508 KB | Partially correct |
16 | Partially correct | 5 ms | 600 KB | Partially correct |
17 | Partially correct | 5 ms | 592 KB | Partially correct |
18 | Partially correct | 6 ms | 592 KB | Partially correct |
19 | Partially correct | 6 ms | 592 KB | Partially correct |
20 | Correct | 4 ms | 592 KB | Output is correct |
21 | Partially correct | 20 ms | 1104 KB | Partially correct |
22 | Partially correct | 21 ms | 1104 KB | Partially correct |
23 | Partially correct | 21 ms | 1108 KB | Partially correct |
24 | Partially correct | 17 ms | 1248 KB | Partially correct |
25 | Partially correct | 34 ms | 1176 KB | Partially correct |
26 | Partially correct | 18 ms | 1104 KB | Partially correct |
27 | Partially correct | 17 ms | 1040 KB | Partially correct |
28 | Partially correct | 27 ms | 1116 KB | Partially correct |
29 | Partially correct | 17 ms | 1116 KB | Partially correct |
30 | Correct | 15 ms | 1116 KB | Output is correct |
31 | Partially correct | 1 ms | 336 KB | Partially correct |
32 | Correct | 1 ms | 336 KB | Output is correct |