# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
246005 | wwdd | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
ll lol(ll n) {
vl wa,wb;
ll lo = 0,hi = 1e18;
ll ok = (n+1)/2;
for(int i=0;i<ok;i++) {
ll ma,mi;
MinMax(lo,hi,&mi,&ma);
lo = mi+1;hi = ma-1;
wa.push_back(mi);
wb.push_back(ma);
}
if(n&1) {wa.pop_back();}
for(int i=wb.size()-1;i>=0;i--) {wa.push_back(wb[i]);}
ll res = 0;
for(int i=1;i<n;i++) {
res = max(res,wa[i]-wa[i-1]);
}
return res;
}
ll solve(ll n) {
ll lo = 0,hi = 1e18;
ll st,ed;
MinMax(lo,hi,&st,&ed);
ll bd = (ed-st+n-2)/(n-1);
vl w;
w.push_back(st);
lo = st+1;
for(int i=0;i<n-1;i++) {
hi = min(lo+bd,ed);
ll sa,sb;
MinMax(lo,hi,&sa,&sb);
if(sa != -1) {
w.push_back(sa);
w.push_back(sb);
}
lo = hi+1;
}
w.push_back(ed);
ll res = 0;
for(int i=1;i<w.size();i++) {
res = max(res,w[i]-w[i-1]);
}
return res;
}
ll findGap(int T, int N) {
if(T == 1) {
return lol(N);
} else {
return solve(N);
}
}