# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
705900 | Alihan_8 | Gap (APIO16_gap) | C++17 | 48 ms | 2240 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 <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
typedef long long ll;
ll findGap(int T, int N){
ll n = N, Mn = 0, Mx = 1e18;
MinMax(Mn, Mx, &Mn, &Mx);
if ( T == 1 ){
vector <ll> res;
res.pb(Mn), res.pb(Mx);
for ( int i = 0; i <= n/2; i++ ){
MinMax(Mn+1, Mx-1, &Mn, &Mx);
if ( Mn == -1 ) continue;
res.pb(Mn), res.pb(Mx);
}
sort(all(res));
Mx = 0;
for ( int i = 1; i < (int)res.size(); i++ ){
Mx = max(Mx, res[i]-res[i-1]);
}
return Mx;
}
ll step = (Mn-Mx+n-2)/(n-1), ans = step, x, y, last = Mn;
for (; Mn+step < Mx; Mn += step+1 ){
MinMax(Mn, Mn+step, &x, &y);
if ( x == -1 ) continue;
ans = max(ans, x-last);
last = y;
}
return ans;
}
#if false
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector <int> p(n);
for ( auto &i: p ) cin >> i;
cout << findGap(1, n);
cout << '\n';
/*
4
2 3 6 8
*/
}
#endif
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |