#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
ll a[100201];
ll l[100201], r[100201];
pll b[100201];
const ll inf = 1'000'000'000'000'000'000;
ll findGap(int T, int n) {
if (T == 1) {
ll L = 1, R = n, mn, mx;
ll low = 0, high = 1e18;
while (L < R) {
MinMax(low, high, &mn, &mx);
a[L++] = mn, a[R--] = mx;
low = mn + 1, high = mx - 1;
}
if (L == R) {
MinMax(low, high, &mn, &mx);
a[L] = mn;
}
ll ret = 0;
for (int i = 2; i <= n; i++) ret = max(ret, a[i] - a[i - 1]);
return ret;
}
ll mn, mx, ret = 0;
MinMax(0, inf, &mn, &mx);
a[1] = mn, a[n] = mx;
if (n == 2) {
return mx - mn;
}
ll gap = 1ll + (mx - 1 - mn - 1 + 1) / n, cnt = 1;
for (ll i = a[1] + 1;; i += gap, cnt++) {
l[cnt] = i, r[cnt] = i + gap - 1;
if (r[cnt] > a[n]) {
r[cnt] = a[n];
break;
}
}
for (int i = 1; i <= cnt; i++) {
MinMax(l[i], r[i], &mn, &mx);
b[i] = {mn, mx};
}
ll bef = a[1];
for (int i = 1; i <= cnt; i++) {
if (b[i].first == -1) continue;
if (bef != -1) {
MinMax(bef, b[i].first, &mn, &mx);
ret = max(ret, mn - bef);
}
bef = b[i].second;
}
return ret;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is 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 |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
6 ms |
856 KB |
Output is correct |
| 17 |
Correct |
9 ms |
856 KB |
Output is correct |
| 18 |
Correct |
7 ms |
856 KB |
Output is correct |
| 19 |
Correct |
6 ms |
764 KB |
Output is correct |
| 20 |
Correct |
5 ms |
856 KB |
Output is correct |
| 21 |
Correct |
25 ms |
1964 KB |
Output is correct |
| 22 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 23 |
Correct |
28 ms |
1852 KB |
Output is correct |
| 24 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 25 |
Correct |
24 ms |
1880 KB |
Output is correct |
| 26 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 27 |
Correct |
35 ms |
1872 KB |
Output is correct |
| 28 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 29 |
Correct |
25 ms |
1880 KB |
Output is correct |
| 30 |
Correct |
21 ms |
1880 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
14 ms |
1468 KB |
Output isn't correct |
| 17 |
Incorrect |
12 ms |
1368 KB |
Output isn't correct |
| 18 |
Incorrect |
12 ms |
1356 KB |
Output isn't correct |
| 19 |
Incorrect |
12 ms |
1392 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
1368 KB |
Output isn't correct |
| 21 |
Incorrect |
55 ms |
4388 KB |
Output isn't correct |
| 22 |
Incorrect |
55 ms |
4184 KB |
Output isn't correct |
| 23 |
Incorrect |
53 ms |
4176 KB |
Output isn't correct |
| 24 |
Incorrect |
55 ms |
4136 KB |
Output isn't correct |
| 25 |
Incorrect |
58 ms |
4360 KB |
Output isn't correct |
| 26 |
Incorrect |
59 ms |
4188 KB |
Output isn't correct |
| 27 |
Incorrect |
53 ms |
4184 KB |
Output isn't correct |
| 28 |
Incorrect |
54 ms |
4312 KB |
Output isn't correct |
| 29 |
Incorrect |
53 ms |
4176 KB |
Output isn't correct |
| 30 |
Incorrect |
26 ms |
4288 KB |
Output isn't correct |
| 31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
