#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
map<long long,bool> vis;
vector<long long> v;
long long findGap(int T, int N)
{ long long ans = 0;
if(T == 1){
long long mn=0,mx=0;
long long s = 0 , e = 1e18;
for(int i=0;i<(N+1)/2;i++){
MinMax(s,e,&mn,&mx);
if(!vis[mn])
v.push_back(mn);
vis[mn] = true;
if(!vis[mx])
v.push_back(mx);
vis[mx] = 1;
s = mn+1;
e = mx-1;
}
sort(v.begin(),v.end());
int si = v.size();
for(int i=0;i<si-1;i++){
ans = max(ans,v[i+1]-v[i]);
}
}
else{
long long s,e;
MinMax(0,1e18,&s,&e);
long long step = (e-s)/(N-1);
ans = step;
long long mn,mx;
for(long long i = s+step;i<e;){
for(;i<=e;i+=step){
MinMax(s,i,&mn,&mx);
if(mx != s)
break;
}
long long f = mx;
if(f-s > step){
MinMax(i-step,f,&mn,&mx);
ans = max(ans,mn-s);
step = ans;
}
s = f;
i = s + step;
}
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5284 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5284 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5284 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5284 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5284 KB |
Output is correct |
| 16 |
Correct |
26 ms |
7032 KB |
Output is correct |
| 17 |
Correct |
29 ms |
7032 KB |
Output is correct |
| 18 |
Correct |
23 ms |
7032 KB |
Output is correct |
| 19 |
Correct |
19 ms |
7032 KB |
Output is correct |
| 20 |
Correct |
19 ms |
7032 KB |
Output is correct |
| 21 |
Correct |
113 ms |
12420 KB |
Output is correct |
| 22 |
Correct |
116 ms |
12420 KB |
Output is correct |
| 23 |
Correct |
116 ms |
12420 KB |
Output is correct |
| 24 |
Correct |
109 ms |
12420 KB |
Output is correct |
| 25 |
Correct |
99 ms |
12420 KB |
Output is correct |
| 26 |
Correct |
106 ms |
12420 KB |
Output is correct |
| 27 |
Correct |
116 ms |
12420 KB |
Output is correct |
| 28 |
Correct |
119 ms |
12420 KB |
Output is correct |
| 29 |
Correct |
113 ms |
12420 KB |
Output is correct |
| 30 |
Correct |
96 ms |
12420 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5152 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
5152 KB |
Partially correct |
| 3 |
Execution timed out |
2000 ms |
5152 KB |
Execution timed out |
| 4 |
Partially correct |
0 ms |
5152 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
5152 KB |
Partially correct |
| 6 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 10 |
Execution timed out |
2000 ms |
5152 KB |
Execution timed out |
| 11 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5152 KB |
Output is correct |
| 15 |
Partially correct |
0 ms |
5152 KB |
Partially correct |
| 16 |
Correct |
9 ms |
5152 KB |
Output is correct |
| 17 |
Correct |
3 ms |
5152 KB |
Output is correct |
| 18 |
Correct |
6 ms |
5152 KB |
Output is correct |
| 19 |
Correct |
6 ms |
5152 KB |
Output is correct |
| 20 |
Execution timed out |
2000 ms |
5152 KB |
Execution timed out |
| 21 |
Correct |
29 ms |
5152 KB |
Output is correct |
| 22 |
Correct |
39 ms |
5152 KB |
Output is correct |
| 23 |
Correct |
33 ms |
5152 KB |
Output is correct |
| 24 |
Correct |
26 ms |
5152 KB |
Output is correct |
| 25 |
Partially correct |
66 ms |
5152 KB |
Partially correct |
| 26 |
Correct |
26 ms |
5152 KB |
Output is correct |
| 27 |
Correct |
33 ms |
5152 KB |
Output is correct |
| 28 |
Correct |
29 ms |
5152 KB |
Output is correct |
| 29 |
Correct |
39 ms |
5152 KB |
Output is correct |
| 30 |
Execution timed out |
2000 ms |
5152 KB |
Execution timed out |
| 31 |
Execution timed out |
2000 ms |
5152 KB |
Execution timed out |
| 32 |
Correct |
0 ms |
5152 KB |
Output is correct |
