# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108932 | autumn_eel | Gap (APIO16_gap) | C++14 | 52 ms | 2040 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>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
#include "gap.h"
ll solve1(int n){
deque<ll>f,r;
while(f.size()+r.size()<n){
ll mn,mx;
ll L=(f.empty()?0:f.back()+1),R=(r.empty()?1e18:r.front()-1);
MinMax(L,R,&mn,&mx);
assert(mn!=-1);
f.push_back(mn);
if(mn!=mx)r.push_front(mx);
}
while(!r.empty()){
f.push_back(r.front());
r.pop_front();
}
assert(f.size()==n);
ll ans=0;
rep(i,n-1)ans=max(ans,f[i+1]-f[i]);
return ans;
}
ll solve2(int n){
return 0;
}
long long findGap(int T, int N){
if(T==1)return solve1(N);
return solve2(N);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |