#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long arr[N];
long long findGap(int T, int N)
{
long long ans=LLONG_MIN;
int lind=1,rind=N;
long long l=0,r=1e18,mn,mx;
while(lind<=rind){
MinMax(l,r,&mn,&mx);
if(mn==-1) break;
arr[lind]=mn,arr[rind]=mx;
lind++,rind--;
l=mn+1,r=mx-1;
}
for(int i=0;i<N-1;i++){
ans=max(ans,arr[i+1]-arr[i]);
}
/*for(int i=0;i<N;i++) cout<<arr[i] <<" ";
cout<<"\n\n";*/
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
344 KB |
Output isn't 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 |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
16 |
Correct |
7 ms |
824 KB |
Output is correct |
17 |
Correct |
6 ms |
600 KB |
Output is correct |
18 |
Correct |
6 ms |
844 KB |
Output is correct |
19 |
Correct |
6 ms |
600 KB |
Output is correct |
20 |
Correct |
6 ms |
856 KB |
Output is correct |
21 |
Correct |
36 ms |
1768 KB |
Output is correct |
22 |
Correct |
27 ms |
1840 KB |
Output is correct |
23 |
Correct |
34 ms |
1880 KB |
Output is correct |
24 |
Correct |
29 ms |
1872 KB |
Output is correct |
25 |
Incorrect |
28 ms |
1880 KB |
Output isn't correct |
26 |
Correct |
26 ms |
2000 KB |
Output is correct |
27 |
Correct |
26 ms |
1876 KB |
Output is correct |
28 |
Correct |
26 ms |
1940 KB |
Output is correct |
29 |
Correct |
28 ms |
1752 KB |
Output is correct |
30 |
Correct |
22 ms |
1852 KB |
Output is correct |
31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
3 |
Partially correct |
1 ms |
344 KB |
Partially correct |
4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
5 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
6 |
Partially correct |
0 ms |
344 KB |
Partially correct |
7 |
Partially correct |
0 ms |
344 KB |
Partially correct |
8 |
Partially correct |
0 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 |
1 ms |
344 KB |
Partially correct |
13 |
Partially correct |
0 ms |
344 KB |
Partially correct |
14 |
Partially correct |
1 ms |
344 KB |
Partially correct |
15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
16 |
Partially correct |
6 ms |
856 KB |
Partially correct |
17 |
Partially correct |
8 ms |
600 KB |
Partially correct |
18 |
Partially correct |
6 ms |
600 KB |
Partially correct |
19 |
Partially correct |
6 ms |
692 KB |
Partially correct |
20 |
Partially correct |
5 ms |
600 KB |
Partially correct |
21 |
Incorrect |
25 ms |
1968 KB |
Expected int32, but "2500100000" found |
22 |
Incorrect |
25 ms |
1812 KB |
Expected int32, but "2500100000" found |
23 |
Incorrect |
25 ms |
1880 KB |
Expected int32, but "2500100000" found |
24 |
Incorrect |
25 ms |
1800 KB |
Expected int32, but "2500100000" found |
25 |
Incorrect |
22 ms |
1880 KB |
Expected int32, but "2500100000" found |
26 |
Incorrect |
25 ms |
1964 KB |
Expected int32, but "2500100000" found |
27 |
Incorrect |
25 ms |
1888 KB |
Expected int32, but "2500100000" found |
28 |
Incorrect |
35 ms |
1872 KB |
Expected int32, but "2500100000" found |
29 |
Incorrect |
25 ms |
1936 KB |
Expected int32, but "2500100000" found |
30 |
Incorrect |
20 ms |
1880 KB |
Expected int32, but "2500100000" found |
31 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
32 |
Partially correct |
0 ms |
344 KB |
Partially correct |