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;
const int maxn=200000+10;
int n,q;
int all[maxn],res[maxn],link[maxn];
set<int>st;
void solve(int v){
st.clear();
st.insert(n+1);
for(int i=1;i<=n;i++){
link[all[i]]=i;
}
int now=n;
int ted=n/2;
for(int i=n;i>=1;i--){
//<<i<<endl;
auto x=*st.lower_bound(link[i]);
if(x==link[i])
{
continue;
}
int len=x-link[i];
int z=0;
if(ted>0){
int f=min((len-1)/ted,v);
z=len-f*ted;
v-=f;
ted-=z;
}
else{
z=len;
}
//<<len<<" "<<ted<<" "<<z<<endl;
for(int j=z-1;j>=0;j--){
//<<j<<" "<<link[i]<<" "<<all[link[i]+j]<<" "<<len<<" "<<now<<endl;
res[now]=all[link[i]+j];
st.insert(link[i]+j);
now--;
//<<"salam"<<endl;
}
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>all[i];
}
int u,v;
cin>>v>>u;
solve(v);
int lastv=v;
cout<<res[u]<<"\n";
for(int i=1;i<q;i++){
cin>>v>>u;
if(lastv!=v){
assert(0);
solve(v);
lastv=v;
}
cout<<res[u]<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |