#include"gap.h"
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll find_gap1(int n){
vector<ll>vec1,vec2;
ll l=0,r=1e18;
while(true){
MinMax(l,r,&l,&r);
if(l==r){
if(l!=-1)
vec1.push_back(l);
break;
}
vec1.push_back(l);
vec2.push_back(r);
l++;
r--;
if((int)vec1.size()+(int)vec2.size()==n)
break;
}
reverse(vec2.begin(),vec2.end());
vec1.insert(vec1.end(),vec2.begin(),vec2.end());
ll res=0;
for(int i=1;i<n;i++)
res=max(res,vec1[i]-vec1[i-1]);
return res;
}
ll find_gap2(int n){
ll mn,mx;
MinMax(0,1e18,&mn,&mx);
ll gap=(mx-mn+n)/n;
ll last=mn;
ll res=0;
for(ll i=mn;i<mx;i+=gap+1){
ll i1,i2;
MinMax(i,i+gap,&i1,&i2);
if(i1!=-1){
res=max(res,i1-last);
last=i2;
}
}
return res;
}
ll findGap(int t,int n){
if(t==1){
return find_gap1(n);
}else{
return find_gap2(n);
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2548 KB |
Output is correct |
| 16 |
Correct |
7 ms |
3352 KB |
Output is correct |
| 17 |
Correct |
7 ms |
3348 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2904 KB |
Output is correct |
| 19 |
Correct |
9 ms |
3096 KB |
Output is correct |
| 20 |
Correct |
6 ms |
3080 KB |
Output is correct |
| 21 |
Correct |
31 ms |
4540 KB |
Output is correct |
| 22 |
Correct |
28 ms |
4428 KB |
Output is correct |
| 23 |
Correct |
29 ms |
4424 KB |
Output is correct |
| 24 |
Correct |
30 ms |
4424 KB |
Output is correct |
| 25 |
Correct |
26 ms |
4416 KB |
Output is correct |
| 26 |
Correct |
28 ms |
4416 KB |
Output is correct |
| 27 |
Correct |
31 ms |
4428 KB |
Output is correct |
| 28 |
Correct |
29 ms |
4348 KB |
Output is correct |
| 29 |
Correct |
29 ms |
4428 KB |
Output is correct |
| 30 |
Correct |
24 ms |
4420 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 2 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 7 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 8 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
2396 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 11 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 12 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 13 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 14 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 15 |
Partially correct |
1 ms |
2392 KB |
Partially correct |
| 16 |
Partially correct |
10 ms |
2752 KB |
Partially correct |
| 17 |
Partially correct |
10 ms |
2392 KB |
Partially correct |
| 18 |
Partially correct |
10 ms |
2596 KB |
Partially correct |
| 19 |
Partially correct |
10 ms |
2588 KB |
Partially correct |
| 20 |
Correct |
5 ms |
2536 KB |
Output is correct |
| 21 |
Partially correct |
41 ms |
2852 KB |
Partially correct |
| 22 |
Partially correct |
47 ms |
2828 KB |
Partially correct |
| 23 |
Partially correct |
45 ms |
2856 KB |
Partially correct |
| 24 |
Partially correct |
49 ms |
2856 KB |
Partially correct |
| 25 |
Partially correct |
38 ms |
2856 KB |
Partially correct |
| 26 |
Partially correct |
40 ms |
2856 KB |
Partially correct |
| 27 |
Partially correct |
46 ms |
2856 KB |
Partially correct |
| 28 |
Partially correct |
40 ms |
2856 KB |
Partially correct |
| 29 |
Partially correct |
40 ms |
2856 KB |
Partially correct |
| 30 |
Correct |
22 ms |
2848 KB |
Output is correct |
| 31 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
