Submission #1016192

#TimeUsernameProblemLanguageResultExecution timeMemory
1016192irmuunAbracadabra (CEOI22_abracadabra)C++17
10 / 100
259 ms524288 KiB
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n,q;
    cin>>n>>q;
    int a[n+5];
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int b[n+5][n+5],cur=0;
    for(int i=1;i<=n;i++){
        b[0][i]=a[i];
    }
    while(true){
        cur++;
        int l=1,r=n/2+1,i=0;
        while(l<=n/2||r<=n){
            if(l>n/2){
                b[cur][++i]=a[r++];
            }
            else if(r>n) {
                b[cur][++i]=a[l++];
            }
            else if(a[l]<a[r]) {
                b[cur][++i]=a[l++];
            }
            else{
                b[cur][++i]=a[r++];
            }
        }
        bool ok=true;
        for(int i=1;i<=n;i++){
            if(a[i]!=b[cur][i]) ok=false;
        }
        if(ok) break;
        for(int i=1;i<=n;i++){
            a[i]=b[cur][i];
        }
    }
    while(q--){
        int t,k;
        cin>>t>>k;
        t=min(t,cur);
        cout<<b[t][k]<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...