| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1306976 | namhh | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#define int long long
#include "gap.h"
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
const int N = 1e5+5;
int a[N];
int findGap(int T, int N){
if(T == 1){
int mn,mx;
MinMax(1,1e18,&mn,&mx);
a[1] = mn;
a[N] = mx;
for(int i = 2; i <= (N+1)/2; i++){
int mnn,mxx;
MinMax(a[i-1]+1,a[N-i+2]-1,&mnn,&mxx);
a[i] = mnn;
a[N-i+1] = mxx;
}
int ans = 0;
for(int i = 2; i <= N; i++) ans = max(ans,a[i]-a[i-1]);
return ans;
}
else{
int mn,mx;
MinMax(1,1e18,&mn,&mx);
a[1] = mn;
a[N] = mx;
int gap = (mx-mn+N-2)/(N-1);
int ans = gap;
int cur = a[1];
while(true){
int mnn,mxx;
int l = cur+1;
int r = min(l+ans,a[N]);
MinMax(l,r,&mnn,&mxx);
if(mnn != mxx){
ans = max(ans,mnn-cur);
cur = mxx;
}
else{
if(mnn != -1){
ans = max(ans,mnn-cur);
cur = mnn;
}
}
if(r == a[N]) break;
}
return ans;
}
}