#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int type, int n) {
constexpr long long C = 1e18;
if (type == 1) {
vector<long long> a(n);
int idx_l = 0, idx_r = n - 1;
long long l = 0, r = C;
for (int t = 0; t < (n + 1) / 2; t++) {
MinMax(l, r, &a[idx_l], &a[idx_r]);
l = a[idx_l] + 1;
r = a[idx_r] - 1;
idx_l++;
idx_r--;
}
long long ans = 0;
for (int i = 0; i + 1 < n; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
} else {
return 0;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
2392 KB |
Output is correct |
3 |
Correct |
0 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 |
0 ms |
2392 KB |
Output is correct |
7 |
Correct |
0 ms |
2392 KB |
Output is correct |
8 |
Correct |
1 ms |
2392 KB |
Output is correct |
9 |
Correct |
0 ms |
2484 KB |
Output is correct |
10 |
Correct |
0 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 |
Correct |
1 ms |
2392 KB |
Output is correct |
16 |
Correct |
6 ms |
2764 KB |
Output is correct |
17 |
Correct |
10 ms |
2764 KB |
Output is correct |
18 |
Correct |
9 ms |
2648 KB |
Output is correct |
19 |
Correct |
7 ms |
2648 KB |
Output is correct |
20 |
Correct |
5 ms |
2648 KB |
Output is correct |
21 |
Correct |
26 ms |
3400 KB |
Output is correct |
22 |
Correct |
26 ms |
3416 KB |
Output is correct |
23 |
Correct |
26 ms |
3416 KB |
Output is correct |
24 |
Correct |
29 ms |
3416 KB |
Output is correct |
25 |
Correct |
25 ms |
3416 KB |
Output is correct |
26 |
Correct |
27 ms |
3508 KB |
Output is correct |
27 |
Correct |
25 ms |
3416 KB |
Output is correct |
28 |
Correct |
26 ms |
3416 KB |
Output is correct |
29 |
Correct |
26 ms |
3416 KB |
Output is correct |
30 |
Correct |
22 ms |
3416 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
0 ms |
2392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
2 |
Incorrect |
1 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 |
0 ms |
2392 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2484 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
16 |
Incorrect |
3 ms |
2484 KB |
Output isn't correct |
17 |
Incorrect |
3 ms |
2392 KB |
Output isn't correct |
18 |
Incorrect |
6 ms |
2392 KB |
Output isn't correct |
19 |
Incorrect |
3 ms |
2392 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
2392 KB |
Output isn't correct |
21 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
22 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
23 |
Incorrect |
12 ms |
2648 KB |
Output isn't correct |
24 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
25 |
Incorrect |
10 ms |
2648 KB |
Output isn't correct |
26 |
Incorrect |
12 ms |
2676 KB |
Output isn't correct |
27 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
28 |
Incorrect |
13 ms |
2644 KB |
Output isn't correct |
29 |
Incorrect |
12 ms |
2648 KB |
Output isn't correct |
30 |
Incorrect |
13 ms |
2648 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |