#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int n)
{
long long a[n];
int cur = 0;
MinMax(0,1000000000000000000,a,a+n-1);
cur++;
while (cur < (n+1)/2){
//printf("%d ",cur);
MinMax(a[cur-1]+1,a[n-cur]-1,a+cur,a+n-1-cur);
cur++;
}
long long ans = 0;
for (int i = 1; i < n; i++){
//printf("%lld %lld, ",a[i],a[i-1]);
ans = max(ans,a[i]-a[i-1]);
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
14 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
12 ms |
760 KB |
Output is correct |
17 |
Correct |
13 ms |
760 KB |
Output is correct |
18 |
Correct |
12 ms |
760 KB |
Output is correct |
19 |
Correct |
13 ms |
760 KB |
Output is correct |
20 |
Correct |
9 ms |
760 KB |
Output is correct |
21 |
Correct |
45 ms |
1884 KB |
Output is correct |
22 |
Correct |
48 ms |
1912 KB |
Output is correct |
23 |
Correct |
46 ms |
1904 KB |
Output is correct |
24 |
Correct |
47 ms |
1912 KB |
Output is correct |
25 |
Correct |
38 ms |
1912 KB |
Output is correct |
26 |
Correct |
45 ms |
1904 KB |
Output is correct |
27 |
Correct |
45 ms |
1912 KB |
Output is correct |
28 |
Correct |
46 ms |
1956 KB |
Output is correct |
29 |
Correct |
44 ms |
1912 KB |
Output is correct |
30 |
Correct |
33 ms |
1912 KB |
Output is correct |
31 |
Correct |
2 ms |
376 KB |
Output is correct |
32 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Partially correct |
2 ms |
376 KB |
Partially correct |
3 |
Partially correct |
2 ms |
376 KB |
Partially correct |
4 |
Partially correct |
2 ms |
376 KB |
Partially correct |
5 |
Partially correct |
2 ms |
376 KB |
Partially correct |
6 |
Partially correct |
2 ms |
376 KB |
Partially correct |
7 |
Partially correct |
2 ms |
376 KB |
Partially correct |
8 |
Partially correct |
2 ms |
376 KB |
Partially correct |
9 |
Partially correct |
2 ms |
376 KB |
Partially correct |
10 |
Partially correct |
2 ms |
376 KB |
Partially correct |
11 |
Partially correct |
2 ms |
376 KB |
Partially correct |
12 |
Partially correct |
2 ms |
376 KB |
Partially correct |
13 |
Partially correct |
2 ms |
376 KB |
Partially correct |
14 |
Partially correct |
2 ms |
376 KB |
Partially correct |
15 |
Partially correct |
2 ms |
376 KB |
Partially correct |
16 |
Partially correct |
12 ms |
760 KB |
Partially correct |
17 |
Partially correct |
12 ms |
676 KB |
Partially correct |
18 |
Partially correct |
12 ms |
760 KB |
Partially correct |
19 |
Partially correct |
12 ms |
760 KB |
Partially correct |
20 |
Partially correct |
10 ms |
760 KB |
Partially correct |
21 |
Incorrect |
46 ms |
1912 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
47 ms |
1916 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
47 ms |
1912 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
44 ms |
1912 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
38 ms |
1912 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
46 ms |
1912 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
45 ms |
2040 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
46 ms |
1912 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
46 ms |
1852 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
34 ms |
1912 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
2 ms |
376 KB |
Partially correct |
32 |
Partially correct |
2 ms |
376 KB |
Partially correct |