#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<r2-l2) 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 |
500 KB |
Output is correct |
2 |
Correct |
1 ms |
2488 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 |
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 |
8 ms |
2848 KB |
Output is correct |
17 |
Correct |
8 ms |
2848 KB |
Output is correct |
18 |
Correct |
8 ms |
3092 KB |
Output is correct |
19 |
Correct |
8 ms |
2852 KB |
Output is correct |
20 |
Correct |
7 ms |
2848 KB |
Output is correct |
21 |
Correct |
32 ms |
4020 KB |
Output is correct |
22 |
Correct |
31 ms |
3992 KB |
Output is correct |
23 |
Correct |
32 ms |
3788 KB |
Output is correct |
24 |
Correct |
32 ms |
4004 KB |
Output is correct |
25 |
Correct |
29 ms |
3996 KB |
Output is correct |
26 |
Correct |
32 ms |
4004 KB |
Output is correct |
27 |
Correct |
34 ms |
3860 KB |
Output is correct |
28 |
Correct |
31 ms |
3960 KB |
Output is correct |
29 |
Correct |
32 ms |
4204 KB |
Output is correct |
30 |
Correct |
27 ms |
3996 KB |
Output is correct |
31 |
Correct |
0 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2392 KB |
Output is correct |
2 |
Correct |
0 ms |
2392 KB |
Output is correct |
3 |
Correct |
0 ms |
2392 KB |
Output is correct |
4 |
Correct |
1 ms |
2392 KB |
Output is correct |
5 |
Partially correct |
0 ms |
2392 KB |
Partially correct |
6 |
Partially correct |
1 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 |
1 ms |
2392 KB |
Partially correct |
10 |
Correct |
0 ms |
2392 KB |
Output is 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 |
8 ms |
2596 KB |
Partially correct |
17 |
Partially correct |
8 ms |
2596 KB |
Partially correct |
18 |
Partially correct |
8 ms |
2592 KB |
Partially correct |
19 |
Partially correct |
8 ms |
2752 KB |
Partially correct |
20 |
Correct |
2 ms |
2584 KB |
Output is correct |
21 |
Partially correct |
32 ms |
2856 KB |
Partially correct |
22 |
Partially correct |
34 ms |
2856 KB |
Partially correct |
23 |
Partially correct |
32 ms |
2852 KB |
Partially correct |
24 |
Partially correct |
33 ms |
2864 KB |
Partially correct |
25 |
Partially correct |
33 ms |
2852 KB |
Partially correct |
26 |
Partially correct |
32 ms |
2856 KB |
Partially correct |
27 |
Partially correct |
32 ms |
2864 KB |
Partially correct |
28 |
Partially correct |
32 ms |
2872 KB |
Partially correct |
29 |
Partially correct |
33 ms |
2772 KB |
Partially correct |
30 |
Correct |
8 ms |
2836 KB |
Output is correct |
31 |
Correct |
1 ms |
2392 KB |
Output is correct |
32 |
Correct |
1 ms |
2392 KB |
Output is correct |