| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 200715 | Nordway | 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<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "gap.h"
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define up_b upper_bound
#define low_b lower_bound
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
template<class T,int SZ> struct BIT{
T t[SZ];
void upd(int x,T y){
for(int i=x;i<SZ;i=(i|(i+1))){
t[i]+=y;
}
}
T pref(int x){
T res=0;
for(int i=x;i>=0;i=(i&(i+1))-1){
res+=t[i];
}
return res;
}
T get(int l,int r){
return pref(r)-pref(l-1);
}
};
template<class T,int SZ> struct ST{
T t[4*SZ];
void build(T a[],int v,int tl,int tr){
if(tl==tr){
t[v]=a[tl];
return ;
}
int tm=(tl+tr)/2;
build(a,v*2,tl,tm);
build(a,v*2+1,tm+1,tr);
t[v]=t[v*2]+t[v*2+1];
}
void upd(int v,int tl,int tr,int pos,T val){
if(tl==tr){
t[v]+=val;
return ;
}
int tm=(tl+tr)/2;
if(pos<=tm)upd(v*2,tl,tm,pos,val);
else upd(v*2+1,tm+1,tr,pos,val);
t[v]=t[v*2]+t[v*2+1];
}
T get(int v,int tl,int tr,int l,int r){
if(tl>r||l>tr)return 0;
if(l<=tl&&tr<=r)return t[v];
int tm=(tl+tr)/2;
return get(v*2,tl,tm,l,r)+get(v*2+1,tm+1,tr,l,r);
}
};
const int N=1e5+11;
const int M=1e3+11;
const int W=1e3+11;
const int inf=INT_MAX;
const ll INF=1e18;
const ll mod=1e9+7;
const ld EPS=1e-9;
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
ll a[N];
pair<ll,pair<ll,ll>>solve(ll l,ll r){
if(l>r)return mp(0,mp(-1,-1));
ll mn=l,mx=r;
MinMax(l,r,&mn,&mx);
if(mn==-1&&mx==-1)return mp(0,mp(-1,-1));
ll mid=(mx+mn)/2;
pair<ll,ll>L=solve(mn+1,mid);
pair<ll,ll>R=solve(mid+1,mx-1);
ll res=max(L.x,R.x);
if(L.y.x!=-1)res=max(res,L.y.x-mn);
if(R.y.y!=-1)res=max(res,mx-R.y.y);
if(L.y.y!=-1&&R.y.x!=-1)res=max(res,R.y.x-L.y.y);
else mp(res,mp(mn,mx));
}
ll findGap(int T,int n){
ll l=0,r=INF;
ll mn,mx;
MinMax(l,r,&mn,&mx);
ll ans;
if(n==2)ans=mx-mn;
else{
pair<ll,pair<ll,ll>>p=solve(mn+1,mx-1);
ans=p.x;
ans=max(ans,max(p.y.x-mn,mx-p.y.y));
}
return ans;
}