# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
725791 | Baytoro | Abracadabra (CEOI22_abracadabra) | C++17 | 218 ms | 11936 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>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define endl '\n'
#define ll long long
#define int long long
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const ll INF=1e18,mod=1e9+9,N=1e6+5;
int a[1005][505];
void solve(){
int n,q;cin>>n>>q;
for(int i=0;i<n;i++) cin>>a[i][0];
for(int j=1;j<=n/2;j++){
int l=0,r=n/2,cur=0;
for(int i=0;i<n && l<n/2 && r<n;i++){
if(a[l][j-1]<a[r][j-1])
a[cur++][j]=a[l++][j-1];
else
a[cur++][j]=a[r++][j-1];
}
while(l<n/2)
a[cur++][j]=a[l++][j-1];
while(r<n)
a[cur++][j]=a[r++][j-1];
}
while(q--){
int x,y;cin>>y>>x;
y=min(y,n/2);
cout<<a[x-1][y]<<endl;
}
}
main(){
//fopn("team");
ios;
int T=1;
//cin>>T;
for(int i=1;i<=T;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
Compilation message (stderr)
# | 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... |