#include "gap.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll pl,pr;
ll l=0,r=1e18;
long long findGap(int T, int N)
{
ll mx=0;
if(T==1)
{
MinMax(l,r,&pl,&pr);
l=pl,r=pr;
for(int i=1;i<=(N+1)/2-1;i++){
MinMax(l+1,r-1,&pl,&pr);
if(pl!=-1)
mx=max(mx,abs(pl-l)),l=pl;
if(pr!=-1)
mx=max(mx,abs(pr-r)),r=pr;
//cout<<l<<' '<<pl<<' '<<r<<' '<<pr<<'\n';
}
}
mx=max(mx,r-l);
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
6 |
Correct |
1 ms |
2384 KB |
Output is correct |
7 |
Correct |
1 ms |
2384 KB |
Output is correct |
8 |
Correct |
1 ms |
2384 KB |
Output is correct |
9 |
Correct |
1 ms |
2384 KB |
Output is correct |
10 |
Correct |
1 ms |
2384 KB |
Output is correct |
11 |
Correct |
1 ms |
2384 KB |
Output is correct |
12 |
Correct |
1 ms |
2384 KB |
Output is correct |
13 |
Correct |
1 ms |
2384 KB |
Output is correct |
14 |
Correct |
1 ms |
2552 KB |
Output is correct |
15 |
Correct |
1 ms |
2384 KB |
Output is correct |
16 |
Correct |
7 ms |
2384 KB |
Output is correct |
17 |
Correct |
7 ms |
2384 KB |
Output is correct |
18 |
Correct |
7 ms |
2384 KB |
Output is correct |
19 |
Correct |
7 ms |
2556 KB |
Output is correct |
20 |
Correct |
6 ms |
2384 KB |
Output is correct |
21 |
Correct |
27 ms |
2640 KB |
Output is correct |
22 |
Correct |
25 ms |
2640 KB |
Output is correct |
23 |
Correct |
29 ms |
2640 KB |
Output is correct |
24 |
Correct |
25 ms |
2640 KB |
Output is correct |
25 |
Correct |
23 ms |
2640 KB |
Output is correct |
26 |
Correct |
26 ms |
2640 KB |
Output is correct |
27 |
Correct |
26 ms |
2640 KB |
Output is correct |
28 |
Correct |
25 ms |
2820 KB |
Output is correct |
29 |
Correct |
26 ms |
2640 KB |
Output is correct |
30 |
Correct |
27 ms |
2640 KB |
Output is correct |
31 |
Correct |
1 ms |
2384 KB |
Output is correct |
32 |
Correct |
1 ms |
2384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
2472 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2556 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
16 |
Incorrect |
4 ms |
2384 KB |
Output isn't correct |
17 |
Incorrect |
4 ms |
2384 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
2384 KB |
Output isn't correct |
19 |
Incorrect |
7 ms |
2384 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
2384 KB |
Output isn't correct |
21 |
Incorrect |
12 ms |
2792 KB |
Output isn't correct |
22 |
Incorrect |
16 ms |
2640 KB |
Output isn't correct |
23 |
Incorrect |
13 ms |
2812 KB |
Output isn't correct |
24 |
Incorrect |
13 ms |
2868 KB |
Output isn't correct |
25 |
Incorrect |
11 ms |
2640 KB |
Output isn't correct |
26 |
Incorrect |
14 ms |
2640 KB |
Output isn't correct |
27 |
Incorrect |
14 ms |
2852 KB |
Output isn't correct |
28 |
Incorrect |
13 ms |
2640 KB |
Output isn't correct |
29 |
Incorrect |
13 ms |
2640 KB |
Output isn't correct |
30 |
Incorrect |
8 ms |
2640 KB |
Output isn't correct |
31 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
32 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |