#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
long long findGap(int T, int N) {
ll mn, mx;
MinMax(1, 1e18, &mn, &mx);
ll step = (mx - mn) / (N - 1);
ll ans = step, x, y, l = mn, i;
for (i = mn; i + step < mx; i += step + 1) {
MinMax(i, i + step, &x, &y);
if (x != -1) {
ans = max(ans, x - l);
l = y;
}
}
MinMax(i, mx, &x, &y);
if (x != -1) ans = max(ans, x - l);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
2552 KB |
Output isn't correct |
17 |
Incorrect |
13 ms |
2384 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
2384 KB |
Output isn't correct |
19 |
Incorrect |
9 ms |
2384 KB |
Output isn't correct |
20 |
Incorrect |
5 ms |
2384 KB |
Output isn't correct |
21 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
22 |
Incorrect |
42 ms |
2640 KB |
Output isn't correct |
23 |
Incorrect |
42 ms |
2640 KB |
Output isn't correct |
24 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
25 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
26 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
27 |
Incorrect |
42 ms |
2852 KB |
Output isn't correct |
28 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
29 |
Incorrect |
37 ms |
2640 KB |
Output isn't correct |
30 |
Incorrect |
22 ms |
2640 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
6 |
Correct |
1 ms |
2384 KB |
Output is correct |
7 |
Correct |
1 ms |
2560 KB |
Output is correct |
8 |
Correct |
1 ms |
2384 KB |
Output is correct |
9 |
Correct |
1 ms |
2384 KB |
Output is correct |
10 |
Correct |
1 ms |
2384 KB |
Output is correct |
11 |
Correct |
2 ms |
2384 KB |
Output is correct |
12 |
Correct |
2 ms |
2384 KB |
Output is correct |
13 |
Correct |
2 ms |
2384 KB |
Output is correct |
14 |
Correct |
1 ms |
2384 KB |
Output is correct |
15 |
Correct |
1 ms |
2384 KB |
Output is correct |
16 |
Correct |
11 ms |
2384 KB |
Output is correct |
17 |
Correct |
10 ms |
2384 KB |
Output is correct |
18 |
Correct |
9 ms |
2384 KB |
Output is correct |
19 |
Correct |
12 ms |
2384 KB |
Output is correct |
20 |
Correct |
6 ms |
2384 KB |
Output is correct |
21 |
Correct |
42 ms |
2848 KB |
Output is correct |
22 |
Correct |
42 ms |
2644 KB |
Output is correct |
23 |
Correct |
37 ms |
2640 KB |
Output is correct |
24 |
Correct |
40 ms |
2640 KB |
Output is correct |
25 |
Correct |
34 ms |
2640 KB |
Output is correct |
26 |
Correct |
42 ms |
2876 KB |
Output is correct |
27 |
Correct |
46 ms |
2828 KB |
Output is correct |
28 |
Correct |
41 ms |
2852 KB |
Output is correct |
29 |
Correct |
38 ms |
2640 KB |
Output is correct |
30 |
Correct |
28 ms |
2640 KB |
Output is correct |
31 |
Correct |
1 ms |
2384 KB |
Output is correct |
32 |
Correct |
1 ms |
2384 KB |
Output is correct |