#include <iostream>
#include "gap.h"
using namespace std;
long long all[100005];
long long findGap(int T,int N)
{
long long a,b,l=0,r=N-1,x=0,y=1e18,ans=0;
int i;
while(l<=r)
{
//printf("%lld %lld\n",l,r);
MinMax(x,y,&a,&b);
all[l]=a;
all[r]=b;
//printf("%lld %lld\n",a,b);
x=a+1;
y=b-1;
l++;
r--;
}
for(i=1;i<N;i++) ans=max(ans,all[i]-all[i-1]);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
3 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
13 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
3 ms |
356 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
4 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
16 ms |
768 KB |
Output is correct |
17 |
Correct |
15 ms |
768 KB |
Output is correct |
18 |
Correct |
14 ms |
768 KB |
Output is correct |
19 |
Correct |
15 ms |
648 KB |
Output is correct |
20 |
Correct |
12 ms |
768 KB |
Output is correct |
21 |
Correct |
54 ms |
1896 KB |
Output is correct |
22 |
Correct |
50 ms |
1912 KB |
Output is correct |
23 |
Correct |
48 ms |
1912 KB |
Output is correct |
24 |
Correct |
51 ms |
2040 KB |
Output is correct |
25 |
Correct |
72 ms |
1912 KB |
Output is correct |
26 |
Correct |
47 ms |
1912 KB |
Output is correct |
27 |
Correct |
49 ms |
1912 KB |
Output is correct |
28 |
Correct |
51 ms |
1884 KB |
Output is correct |
29 |
Correct |
48 ms |
1912 KB |
Output is correct |
30 |
Correct |
36 ms |
1916 KB |
Output is correct |
31 |
Correct |
2 ms |
384 KB |
Output is correct |
32 |
Correct |
3 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
384 KB |
Output is correct |
2 |
Partially correct |
2 ms |
384 KB |
Partially correct |
3 |
Partially correct |
2 ms |
384 KB |
Partially correct |
4 |
Partially correct |
3 ms |
384 KB |
Partially correct |
5 |
Partially correct |
2 ms |
384 KB |
Partially correct |
6 |
Partially correct |
2 ms |
384 KB |
Partially correct |
7 |
Partially correct |
2 ms |
384 KB |
Partially correct |
8 |
Partially correct |
2 ms |
384 KB |
Partially correct |
9 |
Partially correct |
1 ms |
384 KB |
Partially correct |
10 |
Partially correct |
2 ms |
384 KB |
Partially correct |
11 |
Partially correct |
3 ms |
384 KB |
Partially correct |
12 |
Partially correct |
3 ms |
384 KB |
Partially correct |
13 |
Partially correct |
2 ms |
384 KB |
Partially correct |
14 |
Partially correct |
3 ms |
384 KB |
Partially correct |
15 |
Partially correct |
3 ms |
384 KB |
Partially correct |
16 |
Partially correct |
18 ms |
768 KB |
Partially correct |
17 |
Partially correct |
13 ms |
740 KB |
Partially correct |
18 |
Partially correct |
16 ms |
688 KB |
Partially correct |
19 |
Partially correct |
14 ms |
768 KB |
Partially correct |
20 |
Partially correct |
10 ms |
768 KB |
Partially correct |
21 |
Incorrect |
47 ms |
1912 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
48 ms |
1876 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
60 ms |
1912 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
53 ms |
1912 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
41 ms |
1856 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
62 ms |
1912 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
47 ms |
1912 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
53 ms |
1912 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
49 ms |
1912 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
36 ms |
1912 KB |
Expected int32, but "2500100000" found |
31 |
Partially correct |
2 ms |
384 KB |
Partially correct |
32 |
Partially correct |
2 ms |
384 KB |
Partially correct |