#include <bits/stdc++.h>
#include "gap.h"
// #include "grader.cpp"
using namespace std;
using ll = long long;
ll findGap(int T, int n) {
ll s, t;
MinMax(0, (ll)1e18, &s, &t);
ll d = (t - s - 1) / (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 |
Incorrect |
0 ms |
344 KB |
Output isn't 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 |
0 ms |
344 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 |
9 ms |
600 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
648 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
600 KB |
Output isn't correct |
| 19 |
Incorrect |
8 ms |
600 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
600 KB |
Output isn't correct |
| 21 |
Incorrect |
40 ms |
1112 KB |
Output isn't correct |
| 22 |
Incorrect |
35 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
35 ms |
1236 KB |
Output isn't correct |
| 24 |
Incorrect |
35 ms |
1112 KB |
Output isn't correct |
| 25 |
Incorrect |
32 ms |
1112 KB |
Output isn't correct |
| 26 |
Incorrect |
34 ms |
1112 KB |
Output isn't correct |
| 27 |
Incorrect |
35 ms |
1112 KB |
Output isn't correct |
| 28 |
Incorrect |
35 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
38 ms |
1112 KB |
Output isn't correct |
| 30 |
Incorrect |
24 ms |
1360 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 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 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 |
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 |
8 ms |
600 KB |
Output is correct |
| 17 |
Correct |
11 ms |
600 KB |
Output is correct |
| 18 |
Correct |
11 ms |
644 KB |
Output is correct |
| 19 |
Correct |
8 ms |
600 KB |
Output is correct |
| 20 |
Partially correct |
7 ms |
580 KB |
Partially correct |
| 21 |
Correct |
36 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
36 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
35 ms |
1232 KB |
Output is correct |
| 25 |
Correct |
32 ms |
1112 KB |
Output is correct |
| 26 |
Correct |
45 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
35 ms |
1112 KB |
Output is correct |
| 28 |
Correct |
44 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
40 ms |
1112 KB |
Output is correct |
| 30 |
Partially correct |
22 ms |
1112 KB |
Partially correct |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
