#include <bits/stdc++.h>
#include "gap.h"
// #include "grader.cpp"
using namespace std;
using ll = long long;
ll findGap(int T, int n) {
if (T == 1) {
ll s, t;
MinMax(0, (ll)1e18, &s, &t);
int cnt = 1;
ll ans = 0;
while (++cnt <= ((n + 1) >> 1) && s + 1 < t) {
ll x, y;
MinMax(s + 1, t - 1, &x, &y);
if (x == -1) break;
ans = max({ans, x - s, t - y});
s = x; t = y;
}
return max(ans, t - s);
}
ll s, t;
MinMax(0, LLONG_MAX, &s, &t); //n + 1
ll d = (t - s + n - 3) / (n - 1), mx = 0, a = s;
while (s + 1 < t) {
ll x, y;
MinMax(s + 1, min(s + d, t - 1), &x, &y);
if (x != -1) {
mx = max(mx, x - a); a = y;
}
s += d;
}
return max(mx, t - a);
}
# |
결과 |
실행 시간 |
메모리 |
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 |
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 |
0 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 |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
6 ms |
600 KB |
Output is correct |
17 |
Correct |
6 ms |
600 KB |
Output is correct |
18 |
Correct |
6 ms |
464 KB |
Output is correct |
19 |
Correct |
10 ms |
600 KB |
Output is correct |
20 |
Correct |
6 ms |
600 KB |
Output is correct |
21 |
Correct |
25 ms |
1104 KB |
Output is correct |
22 |
Correct |
25 ms |
1112 KB |
Output is correct |
23 |
Correct |
25 ms |
1112 KB |
Output is correct |
24 |
Correct |
25 ms |
1112 KB |
Output is correct |
25 |
Correct |
30 ms |
1236 KB |
Output is correct |
26 |
Correct |
25 ms |
1112 KB |
Output is correct |
27 |
Correct |
25 ms |
1112 KB |
Output is correct |
28 |
Correct |
32 ms |
1112 KB |
Output is correct |
29 |
Correct |
25 ms |
1024 KB |
Output is correct |
30 |
Correct |
26 ms |
1244 KB |
Output is correct |
31 |
Correct |
1 ms |
340 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 |
Correct |
1 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 |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 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 |
12 ms |
600 KB |
Output is correct |
17 |
Correct |
11 ms |
604 KB |
Output is correct |
18 |
Correct |
9 ms |
644 KB |
Output is correct |
19 |
Correct |
11 ms |
600 KB |
Output is correct |
20 |
Correct |
5 ms |
600 KB |
Output is correct |
21 |
Correct |
34 ms |
1216 KB |
Output is correct |
22 |
Correct |
42 ms |
1112 KB |
Output is correct |
23 |
Correct |
41 ms |
1112 KB |
Output is correct |
24 |
Correct |
41 ms |
1220 KB |
Output is correct |
25 |
Correct |
36 ms |
1108 KB |
Output is correct |
26 |
Correct |
35 ms |
1112 KB |
Output is correct |
27 |
Correct |
43 ms |
1004 KB |
Output is correct |
28 |
Correct |
37 ms |
1112 KB |
Output is correct |
29 |
Correct |
35 ms |
1112 KB |
Output is correct |
30 |
Correct |
25 ms |
1112 KB |
Output is correct |
31 |
Correct |
1 ms |
344 KB |
Output is correct |
32 |
Correct |
1 ms |
396 KB |
Output is correct |