| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 343787 | amunduzbaev | 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 "gap.h"
#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int NN = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll findGap(int T, int n){
ll l = 0, r = inf, mn, mx;
MinMax(l, r, &mn, &mx);
vector<ll> tmp;
ll len = (mx - mn+1)/n+1;
ll ans = 0, lastr = inf;
ll tt = mx;
cout<<mn<<" "<<mx<<endl;
for(ll l=mn;l + len<=tt; l+=len+1){
ll r = l + len;
MinMax(l, r, &mn, &mx);
if(mn == -1 || mx == -1) continue;
umax(ans, mn - lastr);
umax(ans, mx - mn);
lastr = mx;
}
sort(all(tmp));
//for(int i=0;i<sz(tmp)-1;i++) umax(ans, tmp[i+1] - tmp[i]);
return ans;
}