| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1168584 | Zero_OP | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#ifndef LOCAL
#include "gap.h"
#endif
using namespace std;
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))
#define dbg(x) "[" #x " = " << (x) << "]"
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
typedef long long ll;
using db = double;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vl = vector<ll>;
using vc = vector<char>;
using vd = vector<db>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vpl = vector<pl>;
const int MAX = 2e5 + 5;
ll a[MAX];
long long findGap(int T, int N){
if(T == 1){
MinMax(0ll, (long long)1e18, a[0], a[N-1]);
for(int i = 0, j = N-1; i < j; ++i, --j){
MinMax(a[i]+1, a[j]-1, a[i+1], a[j-1]);
}
long long ans = 1;
FOR(i, 1, N) maximize(ans, a[i] - a[i-1]);
return ans;
} else{
long long L, R;
MinMax(0, 1e18, L, R);
long long D = (R - L + N - 2) / (N-1) + 1; //ceil((R-L)/(N-1))
long long ans = D-1, pre = L;
for(long long lo = L+1; lo <= R; lo += D){
long long x, y;
MinMax(lo, min(lo + D, R), x, y);
if(x != -1) maximize(ans, x - pre), pre = y;
}
return ans;
}
}