#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long MX=1000000000000000000;
long long findGap(int T, int N)
{
long long mn,mx,pas=1,mn1,mx1,xr=1;
MinMax(0,MX,&mn,&mx);
xr=1;
if(T==1){
for(int i=1;i<(N+1)/2;i++){
MinMax(mn+1,mx-1,&mn1,&mx1);
if(mn1==-1) break;
pas=max(pas,max(mn1-mn,mx-mx1));
mx=mx1;
mn=mn1;
}
return max(pas,mx-mn);
}
while(1){
if(mn>=mx) break;
MinMax(mn+1,mn+1+xr,&mn1,&mx1);
if(mn1==-1) {xr*=2;continue;}
pas=max(pas,mn1-mn);
mn=mx1;
}
return pas;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
488 KB |
Output is correct |
3 |
Correct |
2 ms |
488 KB |
Output is correct |
4 |
Correct |
2 ms |
488 KB |
Output is correct |
5 |
Correct |
2 ms |
488 KB |
Output is correct |
6 |
Correct |
2 ms |
488 KB |
Output is correct |
7 |
Correct |
2 ms |
584 KB |
Output is correct |
8 |
Correct |
2 ms |
584 KB |
Output is correct |
9 |
Correct |
2 ms |
584 KB |
Output is correct |
10 |
Correct |
2 ms |
584 KB |
Output is correct |
11 |
Correct |
2 ms |
584 KB |
Output is correct |
12 |
Correct |
3 ms |
584 KB |
Output is correct |
13 |
Correct |
2 ms |
584 KB |
Output is correct |
14 |
Correct |
2 ms |
584 KB |
Output is correct |
15 |
Correct |
2 ms |
584 KB |
Output is correct |
16 |
Correct |
15 ms |
756 KB |
Output is correct |
17 |
Correct |
15 ms |
756 KB |
Output is correct |
18 |
Correct |
15 ms |
756 KB |
Output is correct |
19 |
Correct |
15 ms |
756 KB |
Output is correct |
20 |
Correct |
12 ms |
900 KB |
Output is correct |
21 |
Correct |
55 ms |
1344 KB |
Output is correct |
22 |
Correct |
58 ms |
1344 KB |
Output is correct |
23 |
Correct |
57 ms |
1344 KB |
Output is correct |
24 |
Correct |
56 ms |
1344 KB |
Output is correct |
25 |
Correct |
47 ms |
1344 KB |
Output is correct |
26 |
Correct |
55 ms |
1388 KB |
Output is correct |
27 |
Correct |
58 ms |
1404 KB |
Output is correct |
28 |
Correct |
58 ms |
1404 KB |
Output is correct |
29 |
Correct |
58 ms |
1404 KB |
Output is correct |
30 |
Correct |
41 ms |
1404 KB |
Output is correct |
31 |
Correct |
2 ms |
1404 KB |
Output is correct |
32 |
Correct |
2 ms |
1404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
1404 KB |
Partially correct |
2 |
Partially correct |
2 ms |
1404 KB |
Partially correct |
3 |
Partially correct |
2 ms |
1404 KB |
Partially correct |
4 |
Partially correct |
2 ms |
1404 KB |
Partially correct |
5 |
Partially correct |
2 ms |
1404 KB |
Partially correct |
6 |
Correct |
2 ms |
1404 KB |
Output is correct |
7 |
Incorrect |
2 ms |
1404 KB |
Output isn't correct |
8 |
Correct |
2 ms |
1404 KB |
Output is correct |
9 |
Correct |
2 ms |
1404 KB |
Output is correct |
10 |
Correct |
2 ms |
1404 KB |
Output is correct |
11 |
Correct |
2 ms |
1404 KB |
Output is correct |
12 |
Correct |
2 ms |
1404 KB |
Output is correct |
13 |
Correct |
2 ms |
1404 KB |
Output is correct |
14 |
Incorrect |
2 ms |
1404 KB |
Output isn't correct |
15 |
Partially correct |
3 ms |
1404 KB |
Partially correct |
16 |
Incorrect |
11 ms |
1404 KB |
Output isn't correct |
17 |
Correct |
10 ms |
1404 KB |
Output is correct |
18 |
Correct |
10 ms |
1404 KB |
Output is correct |
19 |
Correct |
10 ms |
1404 KB |
Output is correct |
20 |
Correct |
7 ms |
1404 KB |
Output is correct |
21 |
Correct |
35 ms |
1464 KB |
Output is correct |
22 |
Correct |
34 ms |
1464 KB |
Output is correct |
23 |
Correct |
33 ms |
1464 KB |
Output is correct |
24 |
Correct |
33 ms |
1516 KB |
Output is correct |
25 |
Partially correct |
71 ms |
1516 KB |
Partially correct |
26 |
Correct |
32 ms |
1516 KB |
Output is correct |
27 |
Correct |
33 ms |
1516 KB |
Output is correct |
28 |
Correct |
35 ms |
1516 KB |
Output is correct |
29 |
Correct |
34 ms |
1516 KB |
Output is correct |
30 |
Correct |
24 ms |
1516 KB |
Output is correct |
31 |
Partially correct |
2 ms |
1516 KB |
Partially correct |
32 |
Correct |
2 ms |
1516 KB |
Output is correct |