#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
ll a[100201];
ll findGap(int T, int n) {
ll l = 1, r = n, mn, mx;
ll low = 0, high = 1e18;
while (l < r) {
MinMax(low, high, &mn, &mx);
a[l++] = mn, a[r--] = mx;
low = mn + 1, high = mx - 1;
}
if (l == r) {
MinMax(low, high, &mn, &mx);
a[l] = mn;
}
ll ret = 0;
for (int i = 2; i <= n; i++) ret = max(ret, a[i] - a[i - 1]);
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
340 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
9 ms |
692 KB |
Output is correct |
17 |
Correct |
10 ms |
680 KB |
Output is correct |
18 |
Correct |
6 ms |
600 KB |
Output is correct |
19 |
Correct |
7 ms |
600 KB |
Output is correct |
20 |
Correct |
6 ms |
600 KB |
Output is correct |
21 |
Correct |
26 ms |
1936 KB |
Output is correct |
22 |
Correct |
27 ms |
1880 KB |
Output is correct |
23 |
Correct |
25 ms |
1872 KB |
Output is correct |
24 |
Correct |
25 ms |
1880 KB |
Output is correct |
25 |
Correct |
24 ms |
1880 KB |
Output is correct |
26 |
Correct |
27 ms |
1880 KB |
Output is correct |
27 |
Correct |
29 ms |
1872 KB |
Output is correct |
28 |
Correct |
26 ms |
1872 KB |
Output is correct |
29 |
Correct |
27 ms |
1868 KB |
Output is correct |
30 |
Correct |
22 ms |
1880 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
3 |
Partially correct |
0 ms |
344 KB |
Partially correct |
4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
5 |
Partially correct |
1 ms |
344 KB |
Partially correct |
6 |
Partially correct |
0 ms |
344 KB |
Partially correct |
7 |
Partially correct |
0 ms |
344 KB |
Partially correct |
8 |
Partially correct |
1 ms |
344 KB |
Partially correct |
9 |
Partially correct |
0 ms |
344 KB |
Partially correct |
10 |
Partially correct |
0 ms |
344 KB |
Partially correct |
11 |
Partially correct |
1 ms |
344 KB |
Partially correct |
12 |
Partially correct |
0 ms |
344 KB |
Partially correct |
13 |
Partially correct |
1 ms |
344 KB |
Partially correct |
14 |
Partially correct |
1 ms |
344 KB |
Partially correct |
15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
16 |
Partially correct |
6 ms |
736 KB |
Partially correct |
17 |
Partially correct |
7 ms |
600 KB |
Partially correct |
18 |
Partially correct |
7 ms |
788 KB |
Partially correct |
19 |
Partially correct |
10 ms |
600 KB |
Partially correct |
20 |
Partially correct |
5 ms |
600 KB |
Partially correct |
21 |
Incorrect |
26 ms |
1772 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
39 ms |
1872 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
26 ms |
1880 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
27 ms |
2012 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
24 ms |
1840 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
27 ms |
1880 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
35 ms |
1924 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
27 ms |
1876 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
26 ms |
1872 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
21 ms |
1880 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
32 |
Partially correct |
0 ms |
344 KB |
Partially correct |