#include "gap.h"
long long findGap (int subTask, int n) {
long long l, r;
MinMax(0, 1e18, &l, &r);
long long block = (r - l - 1)/(n - 1);
// cout << l << " " << r << " " << block << endl;
long long ret = 0, last = l;
for (long long i = l + 1, j = l + 1 + block; j <= r; i += block, j += block) {
long long x, y;
MinMax(i, j - 1, &x, &y);
// cout << x << " " << y << endl;
if (x != -1) {
if (x - last > ret) {
ret = x - last;
}
last = y;
}
}
if (ret == 0) ret = r - l;
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
16 |
Incorrect |
19 ms |
4240 KB |
Output isn't correct |
17 |
Incorrect |
16 ms |
4240 KB |
Output isn't correct |
18 |
Incorrect |
16 ms |
4240 KB |
Output isn't correct |
19 |
Incorrect |
16 ms |
4240 KB |
Output isn't correct |
20 |
Incorrect |
9 ms |
4240 KB |
Output isn't correct |
21 |
Incorrect |
69 ms |
4240 KB |
Output isn't correct |
22 |
Incorrect |
79 ms |
4240 KB |
Output isn't correct |
23 |
Incorrect |
83 ms |
4240 KB |
Output isn't correct |
24 |
Incorrect |
73 ms |
4240 KB |
Output isn't correct |
25 |
Incorrect |
66 ms |
4240 KB |
Output isn't correct |
26 |
Incorrect |
66 ms |
4240 KB |
Output isn't correct |
27 |
Incorrect |
69 ms |
4240 KB |
Output isn't correct |
28 |
Incorrect |
69 ms |
4240 KB |
Output isn't correct |
29 |
Incorrect |
83 ms |
4240 KB |
Output isn't correct |
30 |
Incorrect |
39 ms |
4240 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4240 KB |
Output is correct |
2 |
Correct |
0 ms |
4240 KB |
Output is correct |
3 |
Correct |
0 ms |
4240 KB |
Output is correct |
4 |
Correct |
0 ms |
4240 KB |
Output is correct |
5 |
Correct |
0 ms |
4240 KB |
Output is correct |
6 |
Correct |
0 ms |
4240 KB |
Output is correct |
7 |
Correct |
0 ms |
4240 KB |
Output is correct |
8 |
Correct |
0 ms |
4240 KB |
Output is correct |
9 |
Correct |
0 ms |
4240 KB |
Output is correct |
10 |
Correct |
0 ms |
4240 KB |
Output is correct |
11 |
Correct |
0 ms |
4240 KB |
Output is correct |
12 |
Correct |
0 ms |
4240 KB |
Output is correct |
13 |
Correct |
0 ms |
4240 KB |
Output is correct |
14 |
Correct |
0 ms |
4240 KB |
Output is correct |
15 |
Correct |
0 ms |
4240 KB |
Output is correct |
16 |
Correct |
16 ms |
4240 KB |
Output is correct |
17 |
Correct |
19 ms |
4240 KB |
Output is correct |
18 |
Correct |
19 ms |
4240 KB |
Output is correct |
19 |
Correct |
16 ms |
4240 KB |
Output is correct |
20 |
Partially correct |
6 ms |
4240 KB |
Partially correct |
21 |
Correct |
73 ms |
4240 KB |
Output is correct |
22 |
Correct |
56 ms |
4240 KB |
Output is correct |
23 |
Correct |
76 ms |
4240 KB |
Output is correct |
24 |
Correct |
73 ms |
4240 KB |
Output is correct |
25 |
Correct |
63 ms |
4240 KB |
Output is correct |
26 |
Correct |
73 ms |
4240 KB |
Output is correct |
27 |
Correct |
69 ms |
4240 KB |
Output is correct |
28 |
Correct |
73 ms |
4240 KB |
Output is correct |
29 |
Correct |
73 ms |
4240 KB |
Output is correct |
30 |
Partially correct |
36 ms |
4240 KB |
Partially correct |
31 |
Incorrect |
0 ms |
4240 KB |
Output isn't correct |
32 |
Correct |
0 ms |
4240 KB |
Output is correct |