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 ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 2e5+10;
struct BIT{
int bit[mxn];
void modify(int p,int v){
for(;p<mxn;p+=p&-p)bit[p] += v;
return;
}
int getval(int s,int e){
int re = 0;
for(;e>0;e-= e&-e)re += bit[e];
s--;
for(;s>0;s-= s&-s)re -= bit[s];
return re;
}
};
struct D{
int tp,a,b,tag;
D(){}
D(int tt,int aa,int bb,int tg = 0):tp(tt),a(aa),b(bb),tag(tg){}
};
int ans[mxn];
int arr[mxn];
int N,Q;
BIT bit;
void dc(int l,int r,vector<D> &v){
if(v.empty())return;
if(l == r){
for(auto &i:v){
if(i.tp)ans[i.tp] = l;
}
return;
}
int mid = (l+r)>>1;
vector<D> lv,rv;
for(auto &i:v){
if(!i.tp){
if(i.b<=mid)lv.push_back(i);
else{
rv.push_back(i);
bit.modify(i.a,1);
}
}
else{
if(bit.getval(i.a,i.b)+i.tag>mid)rv.push_back(i);
else{
i.tag += bit.getval(i.a,i.b);
lv.push_back(i);
}
}
}
for(auto &i:rv){
if(!i.tp)bit.modify(i.a,-bit.getval(i.a,i.a));
}
dc(l,mid,lv);
dc(mid+1,r,rv);
return;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N>>Q;
vector<D> v;
for(int i = 1;i<=N;i++){
int k;
cin>>k;
v.push_back(D(0,i,k));
}
for(int i = 1;i<=Q;i++){
int s,e;
cin>>s>>e;
v.push_back(D(i,s,e));
}
dc(0,mxn-1,v);
for(int i = 1;i<=Q;i++)cout<<ans[i]<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |