#include <bits/stdc++.h>
#include "gap.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
const ll inf = 1e18;
ll findGap(int t, int n) {
ll s, e;
MinMax(0, inf, &s, &e);
if (n == 2) {
return e - s;
}
ll len = e - s;
ll b = (len - 1) / (n - 1);
ll lst = s, mx = b;
ll en = e;
for (ll i = s + 1; i <= en - 1; i += b) {
MinMax(i, min(i + b - 1, en - 1), &s, &e);
b = mx;
if (s == -1) continue;
if (s != -1) {
mx = max(mx, s - lst);
}
lst = e;
}
mx = max(mx, en - lst);
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
6 |
Correct |
0 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
0 ms |
2392 KB |
Output is correct |
9 |
Correct |
0 ms |
2392 KB |
Output is correct |
10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
1 ms |
2392 KB |
Output is correct |
13 |
Correct |
1 ms |
2392 KB |
Output is correct |
14 |
Correct |
1 ms |
2392 KB |
Output is correct |
15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
16 |
Correct |
5 ms |
2584 KB |
Output is correct |
17 |
Correct |
5 ms |
2588 KB |
Output is correct |
18 |
Correct |
5 ms |
2592 KB |
Output is correct |
19 |
Correct |
5 ms |
2584 KB |
Output is correct |
20 |
Incorrect |
4 ms |
2572 KB |
Output isn't correct |
21 |
Correct |
23 ms |
2856 KB |
Output is correct |
22 |
Correct |
18 ms |
2856 KB |
Output is correct |
23 |
Correct |
17 ms |
2872 KB |
Output is correct |
24 |
Correct |
18 ms |
2856 KB |
Output is correct |
25 |
Incorrect |
38 ms |
2812 KB |
Output isn't correct |
26 |
Correct |
17 ms |
2860 KB |
Output is correct |
27 |
Correct |
17 ms |
2856 KB |
Output is correct |
28 |
Correct |
17 ms |
2856 KB |
Output is correct |
29 |
Correct |
17 ms |
3052 KB |
Output is correct |
30 |
Incorrect |
14 ms |
2856 KB |
Output isn't correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
3 |
Correct |
1 ms |
2392 KB |
Output is correct |
4 |
Correct |
0 ms |
2392 KB |
Output is correct |
5 |
Correct |
0 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2388 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
1 ms |
2392 KB |
Output is correct |
13 |
Correct |
1 ms |
2392 KB |
Output is correct |
14 |
Correct |
1 ms |
2392 KB |
Output is correct |
15 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Correct |
5 ms |
2580 KB |
Output is correct |
17 |
Correct |
5 ms |
2752 KB |
Output is correct |
18 |
Correct |
5 ms |
2588 KB |
Output is correct |
19 |
Correct |
5 ms |
2752 KB |
Output is correct |
20 |
Incorrect |
4 ms |
2568 KB |
Output isn't correct |
21 |
Correct |
17 ms |
2768 KB |
Output is correct |
22 |
Correct |
18 ms |
2860 KB |
Output is correct |
23 |
Correct |
17 ms |
2856 KB |
Output is correct |
24 |
Correct |
17 ms |
2864 KB |
Output is correct |
25 |
Correct |
37 ms |
2852 KB |
Output is correct |
26 |
Correct |
18 ms |
2868 KB |
Output is correct |
27 |
Correct |
17 ms |
2860 KB |
Output is correct |
28 |
Correct |
18 ms |
2856 KB |
Output is correct |
29 |
Correct |
17 ms |
2860 KB |
Output is correct |
30 |
Incorrect |
14 ms |
2848 KB |
Output isn't correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |