| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 520361 | krit3379 | Gap (APIO16_gap) | C++17 | 65 ms | 3216 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;
#include "gap.h"
long long a[100005],l,r,ans,ma,mi;
long long findGap(int t,int n){
int i,j;
if(t==1){
l=0,r=1e18;
for(i=1,j=n;i<=j;i++,j--){
MinMax(l,r,&mi,&ma);
a[i]=mi;
a[j]=ma;
l=mi+1;
r=ma-1;
}
for(i=1;i<n;i++)ans=max(ans,a[i+1]-a[i]);
return ans;
}
else{
long long last,gap;
vector<long long> a;
l=0,r=1e18;
MinMax(l,r,&mi,&ma);
a.push_back(mi);
a.push_back(ma);
last=ma-1;
gap=(ma-mi+n-2)/(n-1);
while(l<r){
l=mi+1;
r=min(mi+gap,last);
MinMax(l,r,&mi,&ma);
if(mi==-1){
mi=r;
if(r==last)break;
continue;
}
a.push_back(mi);
a.push_back(ma);
mi=r;
if(r==last)break;
}
sort(a.begin(),a.end());
for(i=1;i<a.size();i++)ans=max(ans,a[i]-a[i-1]);
return ans;
}
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
