#include<bits/stdc++.h>
#include "gap.h"
#define maxn 100005
using namespace std;
typedef long long ll;
ll findGap(int T, int n) {
ll l = 0, r = 1000000000000000000;
int i = 1, j = n;
vector < ll > a(n + 1);
while (i <= j) {
ll x, y;
MinMax(l, r, &x, &y);
a[i] = x;
a[j] = y;
i ++;
j --;
l = x + 1;
r = y - 1;
}
ll ma = 0;
for (int i = 2; i <= n; ++i)
ma = max(ma, a[i] - a[i - 1]);
return ma;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
12 |
Correct |
6 ms |
512 KB |
Output is correct |
13 |
Correct |
5 ms |
384 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
5 ms |
384 KB |
Output is correct |
16 |
Correct |
19 ms |
768 KB |
Output is correct |
17 |
Correct |
16 ms |
768 KB |
Output is correct |
18 |
Correct |
16 ms |
768 KB |
Output is correct |
19 |
Correct |
16 ms |
768 KB |
Output is correct |
20 |
Correct |
12 ms |
768 KB |
Output is correct |
21 |
Correct |
71 ms |
1912 KB |
Output is correct |
22 |
Correct |
55 ms |
1912 KB |
Output is correct |
23 |
Correct |
53 ms |
1912 KB |
Output is correct |
24 |
Correct |
54 ms |
1888 KB |
Output is correct |
25 |
Correct |
47 ms |
1916 KB |
Output is correct |
26 |
Correct |
55 ms |
2044 KB |
Output is correct |
27 |
Correct |
53 ms |
1912 KB |
Output is correct |
28 |
Correct |
61 ms |
1888 KB |
Output is correct |
29 |
Correct |
55 ms |
1960 KB |
Output is correct |
30 |
Correct |
39 ms |
1920 KB |
Output is correct |
31 |
Correct |
5 ms |
384 KB |
Output is correct |
32 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Partially correct |
5 ms |
384 KB |
Partially correct |
3 |
Partially correct |
4 ms |
384 KB |
Partially correct |
4 |
Partially correct |
5 ms |
384 KB |
Partially correct |
5 |
Partially correct |
5 ms |
384 KB |
Partially correct |
6 |
Partially correct |
4 ms |
384 KB |
Partially correct |
7 |
Partially correct |
5 ms |
384 KB |
Partially correct |
8 |
Partially correct |
5 ms |
384 KB |
Partially correct |
9 |
Partially correct |
5 ms |
384 KB |
Partially correct |
10 |
Partially correct |
5 ms |
384 KB |
Partially correct |
11 |
Partially correct |
5 ms |
384 KB |
Partially correct |
12 |
Partially correct |
5 ms |
384 KB |
Partially correct |
13 |
Partially correct |
6 ms |
384 KB |
Partially correct |
14 |
Partially correct |
5 ms |
384 KB |
Partially correct |
15 |
Partially correct |
5 ms |
384 KB |
Partially correct |
16 |
Partially correct |
17 ms |
768 KB |
Partially correct |
17 |
Partially correct |
19 ms |
768 KB |
Partially correct |
18 |
Partially correct |
18 ms |
768 KB |
Partially correct |
19 |
Partially correct |
17 ms |
848 KB |
Partially correct |
20 |
Partially correct |
12 ms |
768 KB |
Partially correct |
21 |
Incorrect |
57 ms |
1888 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
53 ms |
1912 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
55 ms |
1912 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
51 ms |
1924 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
44 ms |
1836 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
61 ms |
1912 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
58 ms |
1892 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
57 ms |
1912 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
58 ms |
1836 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
42 ms |
1912 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
5 ms |
384 KB |
Partially correct |
32 |
Partially correct |
5 ms |
384 KB |
Partially correct |