# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1101328 | 2024-10-16T05:42:18 Z | huyngo | Gap (APIO16_gap) | C++17 | 51 ms | 4172 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; MinMax(0, 1e18, &x, &y); ll step = (y - x) / (N - 1); ll res = step, prv = x; for (ll u, v; x + step <= y; ) { MinMax(prv + 1, x + step, &u, &v); if (u != -1) { res = max(res, u - prv); prv = v; x = v + 1; } else x += step; } 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 | 0 ms | 336 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 0 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 | 8 ms | 1484 KB | Output is correct |
17 | Correct | 10 ms | 1484 KB | Output is correct |
18 | Correct | 8 ms | 1484 KB | Output is correct |
19 | Correct | 8 ms | 1484 KB | Output is correct |
20 | Correct | 7 ms | 1484 KB | Output is correct |
21 | Correct | 32 ms | 4128 KB | Output is correct |
22 | Correct | 33 ms | 4172 KB | Output is correct |
23 | Correct | 32 ms | 4104 KB | Output is correct |
24 | Correct | 33 ms | 4036 KB | Output is correct |
25 | Correct | 31 ms | 4036 KB | Output is correct |
26 | Correct | 32 ms | 4036 KB | Output is correct |
27 | Correct | 33 ms | 4028 KB | Output is correct |
28 | Correct | 32 ms | 4080 KB | Output is correct |
29 | Correct | 32 ms | 4160 KB | Output is correct |
30 | Correct | 28 ms | 4036 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 | 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 | Partially correct | 1 ms | 336 KB | Partially correct |
5 | Correct | 1 ms | 336 KB | Output is 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 | Incorrect | 1 ms | 336 KB | Output isn't correct |
11 | Partially correct | 1 ms | 336 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 | Correct | 1 ms | 336 KB | Output is correct |
16 | Partially correct | 11 ms | 592 KB | Partially correct |
17 | Partially correct | 10 ms | 764 KB | Partially correct |
18 | Partially correct | 10 ms | 656 KB | Partially correct |
19 | Partially correct | 12 ms | 592 KB | Partially correct |
20 | Partially correct | 6 ms | 592 KB | Partially correct |
21 | Partially correct | 51 ms | 1116 KB | Partially correct |
22 | Partially correct | 39 ms | 1028 KB | Partially correct |
23 | Partially correct | 39 ms | 1244 KB | Partially correct |
24 | Partially correct | 39 ms | 1272 KB | Partially correct |
25 | Correct | 34 ms | 1104 KB | Output is correct |
26 | Partially correct | 40 ms | 1104 KB | Partially correct |
27 | Partially correct | 38 ms | 1104 KB | Partially correct |
28 | Partially correct | 47 ms | 1196 KB | Partially correct |
29 | Partially correct | 39 ms | 1104 KB | Partially correct |
30 | Partially correct | 22 ms | 1240 KB | Partially correct |
31 | Incorrect | 1 ms | 336 KB | Output isn't correct |
32 | Correct | 1 ms | 336 KB | Output is correct |