| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1297791 | lambd47 | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include<gap.h>
using namespace std;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
ll findGap(int t, int n){
if(t==2){
ll lef,rig;
MinMax(0,1e18,lef,rig);
ll d=(rig-lef)/n+1;
if(n==2){
return rig-lef;
}
vector<pair<ll,ll>> vec;
for(ll i=lef;i<=rig;i+=d){
ll a,b;
MinMax(i,i+d-1,a,b);
vec.push_back({a,b});
}
int resp=d;
int lst=lef;
for(auto [l,r]:vec){
if(l==-1)continue;
resp=max(resp,l-lst);
lst=r;
}
return lst;
}
}
