| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 503964 | Carmel_Ab1 | Gap (APIO16_gap) | C++17 | 106 ms | 11988 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"
typedef long long ll;
typedef vector<ll> vl;
#define all(x) x.begin(),x.end()
#define pb push_back
ll ceil(ll a,ll b){return (a+b-1)/b;}
ll findGap(int T, int n){
ll L=0,R=1e18;
vl a;
if(T==1){
int i=0;
while(2*i<n){
MinMax(L,R,&L,&R);
a.pb(L);
a.pb(R);
L++,R--;
i++;
}
if(L==R && L!=-1)
a.pb(L);
ll ans=0;
sort(all(a));
for(int i=0; i+1<a.size(); i++)
ans=max(ans,a[i+1]-a[i]);
return ans;
}
MinMax(0,1e18,&L,&R);
ll block=ceil(R-L+1,n);
ll ans=0;
multiset<ll>s={L};
a={L,R};
for(int i=0; i<n; i++){
ll l=max(L+1,L+i*block);
ll r=min(R-1,l+block-1);
if(i==n-1)
s.insert(R);
while(l<r){
MinMax(l,r,&l,&r);
if(l==-1)break;
a.pb(l);
a.pb(r);
s.insert(l);
s.insert(r);
ans=max(ans,r-(*(--s.lower_bound(r))));
if(s.upper_bound(l)!=s.end())
ans=max(ans,*s.upper_bound(l)-l);
l++,r--;
if(r-l<=ans)break;
}
if(l==r && l!=-1)
a.pb(l);
}
sort(all(a));
for(int i=0; i+1<a.size(); i++)
ans=max(ans,a[i+1]-a[i]);
return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
