#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll a[100100];
int n;
ll ans = 1;
ll findGap(int T, int N) {
n = N;
if (T == 1 || N <= 40) {
a[0] = -1, a[n + 1] = inf + 1;
for (int i = 1;i <= n / 2;i++) {
MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
}
if (n & 1) {
ll _;
MinMax(a[n / 2] + 1, a[n / 2 + 2] - 1, &a[n / 2 + 1], &_);
}
for (int i = 1;i < n;i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}
ll mn, mx;
MinMax(0, inf, &mn, &mx);
ll now = mn;
while (now < mx) {
ll n1, n2;
ll t = ans;
for (;;t *= 2) {
MinMax(now + 1, now + t, &n1, &n2);
if (n1 != -1) break;
}
ans = max(ans, n1 - now);
now = n2;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 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 |
340 KB |
Output is correct |
16 |
Correct |
8 ms |
648 KB |
Output is correct |
17 |
Correct |
8 ms |
624 KB |
Output is correct |
18 |
Correct |
8 ms |
640 KB |
Output is correct |
19 |
Correct |
8 ms |
844 KB |
Output is correct |
20 |
Correct |
6 ms |
856 KB |
Output is correct |
21 |
Correct |
29 ms |
1984 KB |
Output is correct |
22 |
Correct |
31 ms |
1964 KB |
Output is correct |
23 |
Correct |
30 ms |
1988 KB |
Output is correct |
24 |
Correct |
30 ms |
1912 KB |
Output is correct |
25 |
Correct |
27 ms |
2004 KB |
Output is correct |
26 |
Correct |
30 ms |
1968 KB |
Output is correct |
27 |
Correct |
29 ms |
1988 KB |
Output is correct |
28 |
Correct |
30 ms |
1976 KB |
Output is correct |
29 |
Correct |
30 ms |
1992 KB |
Output is correct |
30 |
Correct |
25 ms |
1896 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
3 |
Partially correct |
0 ms |
344 KB |
Partially correct |
4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
5 |
Partially correct |
0 ms |
344 KB |
Partially correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 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 |
2 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
16 |
Correct |
5 ms |
816 KB |
Output is correct |
17 |
Correct |
5 ms |
632 KB |
Output is correct |
18 |
Correct |
5 ms |
588 KB |
Output is correct |
19 |
Correct |
5 ms |
644 KB |
Output is correct |
20 |
Correct |
5 ms |
616 KB |
Output is correct |
21 |
Correct |
18 ms |
1012 KB |
Output is correct |
22 |
Correct |
19 ms |
1212 KB |
Output is correct |
23 |
Correct |
19 ms |
1212 KB |
Output is correct |
24 |
Correct |
19 ms |
1236 KB |
Output is correct |
25 |
Partially correct |
44 ms |
1232 KB |
Partially correct |
26 |
Correct |
19 ms |
1216 KB |
Output is correct |
27 |
Correct |
19 ms |
1216 KB |
Output is correct |
28 |
Correct |
19 ms |
1220 KB |
Output is correct |
29 |
Correct |
19 ms |
1464 KB |
Output is correct |
30 |
Correct |
19 ms |
1232 KB |
Output is correct |
31 |
Partially correct |
1 ms |
344 KB |
Partially correct |
32 |
Correct |
1 ms |
344 KB |
Output is correct |