| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 634079 | fadi57 | 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<bits/stdc++.h>
#include "gap.h"
#include "grader.cpp"
using namespace std;
typedef long long ll;
const ll inf =1e18;
const ll mod=998244353;
ll findGap(int T, int N){
ll mn=0; ll mx=1e18;
MinMax( 0, mx, &mn, &mx);
ll st=mn;ll en=mx;
ll len=(mx-(mn+2)+N)/(N-1);
ll last=mn;
vector<ll>v;
v.push_back(mn);
//cout<<len<<endl;
//cout<<mx<<endl;
//cout<<en<<endl;
ll i=mn+1;
for(;i<=en;i+=len){
MinMax( i, min(i+len-1,en-1), &mn, &mx);
// cout<<i<<" "<<min(i+len-1,en-1)<<" "<<en<<endl;
if(mn!=-1){
v.push_back(mn); v.push_back(mx);
last=mx;
}
// cout<<"test \n";
}
// cout<<i<<" "<<mx<<endl;
MinMax( last, en-1, &mn, &mx);
v.push_back(mx);
v.push_back(mn);
v.push_back(en);
ll ans=len;
sort(v.begin(),v.end());
for( int j=1;j<v.size();j++){
ans=max(ans,v[j]-v[j-1]);
}
//cout<<ans<<endl;
return ans;
}