| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 739686 | ReLice | 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 "gap.h"
#include <bits/stdc++.h>
#ifndef ONLINE_JUDGE
#include "grader.cpp"
#endif
#define ll long long
#define pb push_back
using namespace std;
const ll inf=1e18+7;
long long findGap(int t, int n){
ll ans=0,a,b,c,d,i,j,l,r;
if(t==1){
a=1,b=inf;
MinMax(a,b,&c,&d);
vector <ll> v;
v.pb(c);
v.pb(d);
for(i=1;i<(n+1)/2;i++){
a=c+1;
b=d-1;
MinMax(a,b,&c,&d);
v.pb(c);
v.pb(d);
}
sort(v.begin(),v.end());
for(i=1;i<n;i++){
ans=max(ans,v[i]-v[i-1]);
}
}
else{
a=1,b=inf;
MinMax(a,b,&c,&d);
vector <ll> v;
v.pb(c),v.pb(d);
l=d,r=c;
j=(d-c-1)%(n-1);
for(i=r+1;i<l;i+=(l-r-1)/(n-1)){
a=i;
if(j>0){
i++;
j--;
}
b=i+(l-r-1)/(n-1)-1;
cout<<a<<' '<<b<<endl;
MinMax(a,b,&c,&d);
if(c==-1) continue;
v.pb(c);
if(c!=d)v.pb(d);
}
sort(v.begin(),v.end());
for(i=1;i<n;i++){
ans=max(ans,v[i]-v[i-1]);
}
}
return ans;
}