#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int dnc(int l, int r){
if (l>=r) return 0;
int mid=(l+r)>>1;
int l1, r1, l2, r2;
MinMax(l, mid, &l1, &r1);
MinMax(mid+1, r, &l2, &r2);
int ll=l1;
if (ll==-1) ll=l2;
int rr=r2;
if (rr==-1) rr=r1;
if (ll==-1 || rr==-1) return r-l+2;
int ans=max({(r+1)-rr, ll-(l-1), (l2==-1 || r1==-1)?0:l2-r1});
if (ans<r1-l1) ans=max(ans, dnc(l1+1, r1-1));
if (ans<l2-r2) ans=max(ans, dnc(l2+1, r2-1));
return ans;
}
long long findGap(int32_t T, int32_t N)
{
if (T==1){
int pl=0, pr=1e18;
vector<int> a;
while (N>0){
int l, r;
MinMax(pl, pr, &l, &r);
a.push_back(l);
if (l!=r) a.push_back(r);
pl=l+1;
pr=r-1;
N-=2;
}
sort(a.begin(), a.end());
int ans=0;
for (int i=1; i<(int)a.size(); ++i) ans=max(ans, a[i]-a[i-1]);
return ans;
}
int l, r;
MinMax(0, 1e18, &l, &r);
if (N==2) return r-l;
if (r-l==2) return 1;
return dnc(l+1, r-1);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2400 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2488 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2644 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 |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
3008 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2856 KB |
Output is correct |
| 18 |
Correct |
8 ms |
2860 KB |
Output is correct |
| 19 |
Correct |
8 ms |
3020 KB |
Output is correct |
| 20 |
Correct |
7 ms |
2820 KB |
Output is correct |
| 21 |
Correct |
36 ms |
4000 KB |
Output is correct |
| 22 |
Correct |
32 ms |
3800 KB |
Output is correct |
| 23 |
Correct |
37 ms |
4008 KB |
Output is correct |
| 24 |
Correct |
32 ms |
3992 KB |
Output is correct |
| 25 |
Correct |
30 ms |
3792 KB |
Output is correct |
| 26 |
Correct |
41 ms |
3784 KB |
Output is correct |
| 27 |
Correct |
32 ms |
3832 KB |
Output is correct |
| 28 |
Correct |
36 ms |
4152 KB |
Output is correct |
| 29 |
Correct |
32 ms |
3944 KB |
Output is correct |
| 30 |
Correct |
27 ms |
4192 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 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
2388 KB |
Output isn't correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Incorrect |
5 ms |
2564 KB |
Output isn't correct |
| 17 |
Incorrect |
3 ms |
2596 KB |
Output isn't correct |
| 18 |
Incorrect |
4 ms |
2592 KB |
Output isn't correct |
| 19 |
Incorrect |
4 ms |
2600 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
2580 KB |
Output isn't correct |
| 21 |
Incorrect |
13 ms |
2852 KB |
Output isn't correct |
| 22 |
Incorrect |
12 ms |
2872 KB |
Output isn't correct |
| 23 |
Incorrect |
12 ms |
3108 KB |
Output isn't correct |
| 24 |
Incorrect |
13 ms |
2864 KB |
Output isn't correct |
| 25 |
Correct |
16 ms |
3044 KB |
Output is correct |
| 26 |
Incorrect |
13 ms |
2856 KB |
Output isn't correct |
| 27 |
Incorrect |
19 ms |
2808 KB |
Output isn't correct |
| 28 |
Incorrect |
14 ms |
3020 KB |
Output isn't correct |
| 29 |
Incorrect |
13 ms |
2896 KB |
Output isn't correct |
| 30 |
Incorrect |
7 ms |
2816 KB |
Output isn't correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
