Submission #1029588

#TimeUsernameProblemLanguageResultExecution timeMemory
1029588hotboy2703Comparing Plants (IOI20_plants)C++17
0 / 100
4129 ms1051156 KiB
#include "plants.h" #include<bits/stdc++.h> using namespace std; using ll = long long; #define pll pair <ll,ll> #define fi first #define se second #define MP make_pair #define sz(a) (ll((a).size())) #define BIT(mask,i) (((mask) >> (i))&1) #define MASK(i) (1LL<<(i)) namespace trung{ const ll MAXN = 2e5+100; const ll INF = 1e9+7; ll n,k; namespace seg{ pll tree[MAXN*4+100]; ll lazy[MAXN*4+100]; pll combine(pll x,pll y){ if (x.fi > y.fi)return y; else return x; } void build(vector <int> &val,ll id=1,ll l=0,ll r=n-1){ if (l==r){tree[id] = MP(val[l],l);} else{ ll mid = (l + r) >> 1; build(val,id<<1,l,mid); build(val,id<<1|1,mid+1,r); tree[id] = combine(tree[id<<1],tree[id<<1|1]); } } void push(ll id,ll x){ tree[id].fi+=x; lazy[id]+=x; } void lz(ll id){ push(id<<1,lazy[id]); push(id<<1|1,lazy[id]); lazy[id] = 0; } void update(ll l1,ll r1,ll id=1,ll l=0,ll r=n-1){ // if (id==1)cout<<"UPD "<<l1<<' '<<r1<<endl; if (l1 > r || l > r1 || l1 > r1)return; if (l1 <= l && r <= r1){ push(id,-1); return; } lz(id); ll mid = (l + r) >> 1; update(l1,r1,id<<1,l,mid); update(l1,r1,id<<1|1,mid+1,r); tree[id] = combine(tree[id<<1],tree[id<<1|1]); } void del(ll i,ll id=1,ll l=0,ll r=n-1){ if (l > i || i > r)return; if (l==r){ tree[id].fi = INF; return; } lz(id); ll mid = (l + r) >> 1; del(i,id<<1,l,mid); del(i,id<<1|1,mid+1,r); tree[id] = combine(tree[id<<1],tree[id<<1|1]); } ll get(ll l1,ll r1,ll id=1,ll l=0,ll r=n-1){ if (l1 > r || l > r1 || l1 > r1)return n+1; if (tree[id].fi!=0)return n+1; if (l1 <= l && r <= r1)return tree[id].se; lz(id); ll mid = (l + r) >> 1; ll res = get(l1,r1,id<<1,l,mid); if (res==n+1)res = get(l1,r1,id<<1|1,mid+1,r); return res; } } ll h[MAXN]; ll label; vector <ll> all; void solve(ll x){ ll l = x-k+1,r=x-1; // cout<<x<<' '<<l<<' '<<r<<endl; ll tmp; while ((tmp=seg::get(l+n,r+n)) != n+1){ solve(tmp); } while ((tmp=seg::get(l,r)) != n+1){ solve(tmp); } all.push_back(x); } } void init(int K, std::vector<int> r){ using namespace trung; n=sz(r); k=K; seg::build(r); // cout<<"OK"<<endl; ll cur; label = n; while ((cur=seg::get(0,n-1)) != n+1){ // cout<<"CUR "<<cur<<endl; solve(cur); for (auto x:all){ h[x] = --label; ll l = x-k+1,r=x-1; seg::update(l,r); seg::update(l+n,r+n); seg::del(x); } all.clear(); } } int compare_plants(int x, int y){ using namespace trung; return (h[x] > h[y] ? 1 : -1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...