#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/2;i++){
MinMax(l,r,&pl,&pr);
mx=max({mx,pl-l,r-pr});
l=pl+1,r=pr-1;
}
}
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
3 |
Incorrect |
2 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 |
2552 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 |
2384 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
15 |
Incorrect |
2 ms |
2556 KB |
Output isn't correct |
16 |
Incorrect |
7 ms |
2384 KB |
Output isn't correct |
17 |
Incorrect |
10 ms |
2384 KB |
Output isn't correct |
18 |
Incorrect |
7 ms |
2384 KB |
Output isn't correct |
19 |
Incorrect |
11 ms |
2384 KB |
Output isn't correct |
20 |
Incorrect |
7 ms |
2596 KB |
Output isn't correct |
21 |
Incorrect |
31 ms |
2660 KB |
Output isn't correct |
22 |
Incorrect |
43 ms |
2660 KB |
Output isn't correct |
23 |
Incorrect |
28 ms |
2640 KB |
Output isn't correct |
24 |
Incorrect |
26 ms |
2640 KB |
Output isn't correct |
25 |
Incorrect |
24 ms |
2820 KB |
Output isn't correct |
26 |
Incorrect |
35 ms |
2860 KB |
Output isn't correct |
27 |
Incorrect |
38 ms |
2736 KB |
Output isn't correct |
28 |
Incorrect |
26 ms |
2640 KB |
Output isn't correct |
29 |
Incorrect |
35 ms |
2640 KB |
Output isn't correct |
30 |
Incorrect |
21 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2636 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 |
2384 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
2384 KB |
Output isn't correct |
16 |
Incorrect |
6 ms |
2384 KB |
Output isn't correct |
17 |
Incorrect |
7 ms |
2384 KB |
Output isn't correct |
18 |
Incorrect |
4 ms |
2384 KB |
Output isn't correct |
19 |
Incorrect |
4 ms |
2384 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
2384 KB |
Output isn't correct |
21 |
Incorrect |
21 ms |
2640 KB |
Output isn't correct |
22 |
Incorrect |
24 ms |
2640 KB |
Output isn't correct |
23 |
Incorrect |
24 ms |
2640 KB |
Output isn't correct |
24 |
Incorrect |
24 ms |
2640 KB |
Output isn't correct |
25 |
Incorrect |
11 ms |
2640 KB |
Output isn't correct |
26 |
Incorrect |
25 ms |
2844 KB |
Output isn't correct |
27 |
Incorrect |
23 ms |
2640 KB |
Output isn't correct |
28 |
Incorrect |
14 ms |
2640 KB |
Output isn't correct |
29 |
Incorrect |
14 ms |
2640 KB |
Output isn't correct |
30 |
Incorrect |
16 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 |