# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029907 | KasymK | Gap (APIO16_gap) | C++17 | 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"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int MOD = 1e9+7;
const int N = 1e5+5;
const ll INF = 1e18;
ll a[N];
ll findGap(int t, int n){
if(t == 1){
ll l = 0, r = INF, id = 0, mn, mx, ans = 0;
for(int i = 0; i < (n+1)/2; ++i){
MinMax(l, r, &mn, &mx);
a[id++] = mn;
a[id++] = mx;
l = mn+1, r = mx-1;
}
sort(a, a+n);
for(int i = 0; i < n-1; ++i)
umin(ans, a[i+1]-a[i]);
return ans;
}
int a_, b_, mn, mx, id = 0;
MinMax(0ll, INF, &mn, &mx);
ll d = (mx-mn-1)/(n-1);
a[id++] = mn;
for(ll l = mn+1; l < mx; l+=d+1){
MinMax(l, min(l+d, mx-1), &a_, &b_);
if(a_ != -1)
a[id++] = a_, a[id++] = b_;
}
a[id++] = mx;
ll ans = 0;
for(int i = 0; i < n-1; ++i)
umin(ans, a[i+1]-a[i]);
return ans;
}