#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 cur, mx;
MinMax(0, inf, &cur, &mx);
if (n == 2) {
return mx - cur;
}
mx = 1;
while (cur + mx + 1 < inf) {
ll len = mx + 1, s = -1, e = -1;
while (len < inf && e == -1) {
MinMax(cur + 1, min(cur + len, inf), &s, &e);
len *= 2;
}
if (s != -1) {
mx = max(mx, s - cur);
}
if (e != -1) {
cur = e;
} else {
cur = inf + 1;
}
}
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
11 |
Correct |
1 ms |
2392 KB |
Output is correct |
12 |
Correct |
1 ms |
2508 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 |
2588 KB |
Output is correct |
17 |
Correct |
5 ms |
2588 KB |
Output is correct |
18 |
Correct |
5 ms |
2588 KB |
Output is correct |
19 |
Correct |
6 ms |
2812 KB |
Output is correct |
20 |
Correct |
4 ms |
2596 KB |
Output is correct |
21 |
Correct |
18 ms |
2856 KB |
Output is correct |
22 |
Correct |
21 ms |
2856 KB |
Output is correct |
23 |
Correct |
21 ms |
2872 KB |
Output is correct |
24 |
Correct |
18 ms |
2852 KB |
Output is correct |
25 |
Incorrect |
40 ms |
2860 KB |
Output isn't correct |
26 |
Correct |
18 ms |
2856 KB |
Output is correct |
27 |
Correct |
18 ms |
2852 KB |
Output is correct |
28 |
Correct |
18 ms |
2848 KB |
Output is correct |
29 |
Correct |
20 ms |
2860 KB |
Output is correct |
30 |
Correct |
17 ms |
2860 KB |
Output is correct |
31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
3 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
4 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
5 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
6 |
Correct |
1 ms |
2392 KB |
Output is correct |
7 |
Correct |
1 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
1 ms |
2392 KB |
Output is correct |
10 |
Correct |
1 ms |
2392 KB |
Output is 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 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
16 |
Correct |
5 ms |
2392 KB |
Output is correct |
17 |
Correct |
5 ms |
2752 KB |
Output is correct |
18 |
Correct |
5 ms |
2584 KB |
Output is correct |
19 |
Correct |
5 ms |
2584 KB |
Output is correct |
20 |
Correct |
4 ms |
2572 KB |
Output is correct |
21 |
Correct |
17 ms |
3100 KB |
Output is correct |
22 |
Correct |
18 ms |
2784 KB |
Output is correct |
23 |
Correct |
18 ms |
2856 KB |
Output is correct |
24 |
Correct |
17 ms |
2872 KB |
Output is correct |
25 |
Partially correct |
37 ms |
2856 KB |
Partially correct |
26 |
Correct |
19 ms |
2856 KB |
Output is correct |
27 |
Correct |
20 ms |
2860 KB |
Output is correct |
28 |
Correct |
18 ms |
2860 KB |
Output is correct |
29 |
Correct |
17 ms |
2868 KB |
Output is correct |
30 |
Correct |
13 ms |
2868 KB |
Output is correct |
31 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |