#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);
vector<ll> v = {s};
while (s + 1 < t) {
ll x, y;
MinMax(s + 1, min(s + d, t - 1), &x, &y);
if (x != -1) v.insert(v.end(), {x, y});
s += d;
}
ll mx = 0;
for (int i = 1; i < (int)v.size(); i++) mx = max(mx, v[i] - v[i - 1]);
return max(mx, t - v.back());
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
436 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
552 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 |
1 ms |
340 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 |
10 ms |
980 KB |
Output isn't correct |
17 |
Incorrect |
13 ms |
1020 KB |
Output isn't correct |
18 |
Incorrect |
13 ms |
976 KB |
Output isn't correct |
19 |
Incorrect |
12 ms |
996 KB |
Output isn't correct |
20 |
Incorrect |
5 ms |
596 KB |
Output isn't correct |
21 |
Incorrect |
36 ms |
2256 KB |
Output isn't correct |
22 |
Incorrect |
36 ms |
2256 KB |
Output isn't correct |
23 |
Incorrect |
36 ms |
2256 KB |
Output isn't correct |
24 |
Incorrect |
45 ms |
2348 KB |
Output isn't correct |
25 |
Incorrect |
34 ms |
3276 KB |
Output isn't correct |
26 |
Incorrect |
37 ms |
2368 KB |
Output isn't correct |
27 |
Incorrect |
36 ms |
2256 KB |
Output isn't correct |
28 |
Incorrect |
36 ms |
2256 KB |
Output isn't correct |
29 |
Incorrect |
45 ms |
2256 KB |
Output isn't correct |
30 |
Incorrect |
22 ms |
1464 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 |
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 |
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 |
9 ms |
980 KB |
Output is correct |
17 |
Correct |
9 ms |
980 KB |
Output is correct |
18 |
Correct |
8 ms |
980 KB |
Output is correct |
19 |
Correct |
8 ms |
952 KB |
Output is correct |
20 |
Partially correct |
5 ms |
600 KB |
Partially correct |
21 |
Correct |
45 ms |
2264 KB |
Output is correct |
22 |
Correct |
37 ms |
2256 KB |
Output is correct |
23 |
Correct |
38 ms |
2256 KB |
Output is correct |
24 |
Correct |
35 ms |
2252 KB |
Output is correct |
25 |
Correct |
36 ms |
3276 KB |
Output is correct |
26 |
Correct |
48 ms |
2248 KB |
Output is correct |
27 |
Correct |
35 ms |
2260 KB |
Output is correct |
28 |
Correct |
36 ms |
2248 KB |
Output is correct |
29 |
Correct |
35 ms |
2256 KB |
Output is correct |
30 |
Partially correct |
25 ms |
1624 KB |
Partially correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |