#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long findGap(int T, int n){
ll mn,mx;
MinMax(1,1e18,&mn,&mx);
if(T==1){
vector<ll> a(n);
a[0]=mn,a[n-1]=mx;
if(n==2)return mx-mn;
ll ans=0;
for(int l=1,r=n-2;l<=r;l++,r--){
MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);
ans=max({ans,a[l]-a[l-1],a[r+1]-a[r]});
}
return ans;
}
ll ans=(mx-mn+n-2)/(n-1);
for(ll l=mn,r=mx,p=mn;l+1<r;){
MinMax(l+1,min(l+ans,r),&mn,&mx);
l+=ans+1;
if(mn!=-1)ans=max(ans,mn-p),p=mx;
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
1 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 |
0 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 |
1 ms |
2644 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 |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2608 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2648 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2572 KB |
Output is correct |
| 21 |
Correct |
31 ms |
3588 KB |
Output is correct |
| 22 |
Correct |
34 ms |
3828 KB |
Output is correct |
| 23 |
Correct |
38 ms |
3628 KB |
Output is correct |
| 24 |
Correct |
30 ms |
3620 KB |
Output is correct |
| 25 |
Correct |
27 ms |
3552 KB |
Output is correct |
| 26 |
Correct |
30 ms |
3716 KB |
Output is correct |
| 27 |
Correct |
32 ms |
3500 KB |
Output is correct |
| 28 |
Correct |
40 ms |
3608 KB |
Output is correct |
| 29 |
Correct |
32 ms |
3616 KB |
Output is correct |
| 30 |
Correct |
27 ms |
3628 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
0 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 |
0 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 |
1 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 |
2644 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
6 ms |
2580 KB |
Output is correct |
| 17 |
Correct |
5 ms |
2584 KB |
Output is correct |
| 18 |
Correct |
6 ms |
2584 KB |
Output is correct |
| 19 |
Correct |
5 ms |
2580 KB |
Output is correct |
| 20 |
Correct |
4 ms |
2572 KB |
Output is correct |
| 21 |
Correct |
20 ms |
2848 KB |
Output is correct |
| 22 |
Correct |
20 ms |
3000 KB |
Output is correct |
| 23 |
Correct |
18 ms |
2856 KB |
Output is correct |
| 24 |
Correct |
18 ms |
2848 KB |
Output is correct |
| 25 |
Correct |
41 ms |
2860 KB |
Output is correct |
| 26 |
Correct |
20 ms |
2852 KB |
Output is correct |
| 27 |
Correct |
19 ms |
2864 KB |
Output is correct |
| 28 |
Correct |
21 ms |
2856 KB |
Output is correct |
| 29 |
Correct |
20 ms |
2856 KB |
Output is correct |
| 30 |
Correct |
16 ms |
2800 KB |
Output is correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2644 KB |
Output is correct |
