# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257014 | Nucleist | Gap (APIO16_gap) | C++14 | 144 ms | 5752 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.
//Self-control leads to consistency.
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define EPS 0.000001
struct greateri
{
template<class T>
bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
ll findGap(int T,int N){
ll mx=0,mn=0;
ll dol=pow(10,18);
MinMax(0,dol,&mn,&mx);
ll l=mn+1,r=mx-1;
set<ll>ans;
ans.insert(mn),ans.insert(mx);
ll f=(r-l+1)/(N-1);
for (ll i = l; i <= r; i+=(f+1))
{
ll k=i,k1=i+f;
if(i+f>r){
k1=r;
}
MinMax(k,k1,&mn,&mx);
ans.insert(mn),ans.insert(mx);
if(i+f>r){
break;
}
}
ll sol=0;
ans.erase(-1);
ll last=*(ans.begin());
for(auto it:ans){
if(last!=it){
sol=max(sol,it-last);
last=it;
}
}
return sol;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |