| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 536163 | mario05092929 | Gap (APIO16_gap) | C++17 | 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 "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
int lp,rp;
long long findGap(int T, ll n) {
ll l = 0, r = 1e18,mn,mx;
if(T & 1) {
MinMax(l,r,&mn,&mx);
lp = 1, rp = n;
while(1) {
a[lp++] = mn;
a[rp--] = mx;
l = mn+1, r = mx-1;
if(lp > rp) break;
MinMax(l,r,&mn,&mx);
}
ll mxx = 0;
for(int i = 1;i < n;i++) {
mxx = max(mxx,a[i+1]-a[i]);
}
return mxx;
}
else {
MinMax(l,r,&mn,&mx);
ll diff = 0;
ll len = (mx-mn)/n+1;
ll st = mn+1;
ll tmn,tmx;
for(int i = 1;i <= n;i++) {
MinMax(st,st+len,&tmn,&tmx);
if(tmn == -1) continue;
diff = max(diff,tmn-mn);
mn = tmx;
}
return diff;
}
}