#include <algorithm>
#include "gap.h"
long long findGap(int T, int N) {
long long R = 1000000000000000000LL;
long long e, r;
MinMax(0, R, &e, &r);
r -= e;
long long dist = (r + N - 2) / (N - 1), st = e, ans = 0, val = -1;
for (int i = 1; i < N; i++) {
long long a, b;
MinMax(st, st + dist, &a, &b);
st += dist + 1;
if (a != -1) {
if (val != -1)
ans = std::max(ans, a - val);
val = b;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
11 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
12 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
14 |
Incorrect |
3 ms |
256 KB |
Output isn't correct |
15 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
16 |
Incorrect |
22 ms |
512 KB |
Output isn't correct |
17 |
Incorrect |
18 ms |
512 KB |
Output isn't correct |
18 |
Incorrect |
18 ms |
508 KB |
Output isn't correct |
19 |
Incorrect |
17 ms |
512 KB |
Output isn't correct |
20 |
Incorrect |
9 ms |
512 KB |
Output isn't correct |
21 |
Incorrect |
82 ms |
1124 KB |
Output isn't correct |
22 |
Incorrect |
66 ms |
1144 KB |
Output isn't correct |
23 |
Incorrect |
66 ms |
1024 KB |
Output isn't correct |
24 |
Incorrect |
69 ms |
1116 KB |
Output isn't correct |
25 |
Incorrect |
61 ms |
1136 KB |
Output isn't correct |
26 |
Incorrect |
68 ms |
1132 KB |
Output isn't correct |
27 |
Incorrect |
64 ms |
1172 KB |
Output isn't correct |
28 |
Incorrect |
95 ms |
1144 KB |
Output isn't correct |
29 |
Incorrect |
64 ms |
1144 KB |
Output isn't correct |
30 |
Incorrect |
34 ms |
1144 KB |
Output isn't correct |
31 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
3 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
3 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
256 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
1 ms |
256 KB |
Output is correct |
16 |
Correct |
17 ms |
512 KB |
Output is correct |
17 |
Correct |
16 ms |
512 KB |
Output is correct |
18 |
Correct |
17 ms |
512 KB |
Output is correct |
19 |
Correct |
25 ms |
448 KB |
Output is correct |
20 |
Correct |
10 ms |
512 KB |
Output is correct |
21 |
Correct |
74 ms |
1144 KB |
Output is correct |
22 |
Correct |
68 ms |
1116 KB |
Output is correct |
23 |
Correct |
69 ms |
1116 KB |
Output is correct |
24 |
Correct |
72 ms |
1052 KB |
Output is correct |
25 |
Correct |
59 ms |
1136 KB |
Output is correct |
26 |
Correct |
65 ms |
1136 KB |
Output is correct |
27 |
Correct |
84 ms |
1052 KB |
Output is correct |
28 |
Correct |
76 ms |
1136 KB |
Output is correct |
29 |
Correct |
82 ms |
1056 KB |
Output is correct |
30 |
Correct |
46 ms |
1104 KB |
Output is correct |
31 |
Correct |
3 ms |
256 KB |
Output is correct |
32 |
Correct |
2 ms |
384 KB |
Output is correct |