oj.uz

Submission #1014605

# Submission time Handle Problem Language Result Execution time Memory
1014605 2024-07-05T07:50:37 Z vjudge1 Abracadabra (CEOI22_abracadabra) C++17
10 / 100
 3000 ms 26720 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,l,r) for(int i=l; i<r; i++)
#define all(x) x.begin(),x.end()
#define len(x) (int)x.size();
#define fi first
#define se second
#define elif else if
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
constexpr ll LINF=1001001001001001001LL;
constexpr ll MINF=1001001001001LL;
constexpr int INF=1001001001;

int N;
vi riffle(vi p){
    int lf=0;
    int ri=N/2;
    vi ret(N);
    rep(i,N){
        if(lf==N/2||(ri!=N&&p[lf]>p[ri])){
            ret[i]=p[ri];
            ri++;
        }
        else{
            ret[i]=p[lf];
            lf++;
        }
    }
    return ret;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int Q;
    cin>>N>>Q;
    vi P(N);
    rep(i,N)cin>>P[i];
    vector<vector<pii>> query(30000);
    rep(i,Q){
        int t,p;
        cin>>t>>p;
        query[min(29999,t)].emplace_back(i,p-1);
    }
    vi ans(Q);
    rep(i,30000){
        for(auto &[j,p]:query[i]){
            ans[j]=P[p];
        }
        P=riffle(P);
    }
    for(int i:ans)cout<<i<<"\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 25424 KB Output is correct
2 Correct 162 ms 24148 KB Output is correct
3 Correct 175 ms 23768 KB Output is correct
4 Correct 153 ms 22444 KB Output is correct
5 Correct 164 ms 25848 KB Output is correct
6 Correct 170 ms 25936 KB Output is correct
7 Correct 162 ms 26452 KB Output is correct
8 Correct 152 ms 24400 KB Output is correct
9 Correct 145 ms 23160 KB Output is correct
10 Correct 155 ms 23092 KB Output is correct
11 Correct 151 ms 23608 KB Output is correct
12 Correct 193 ms 20988 KB Output is correct
13 Correct 157 ms 22132 KB Output is correct
14 Correct 179 ms 24872 KB Output is correct
15 Correct 159 ms 22812 KB Output is correct
16 Correct 35 ms 1112 KB Output is correct
17 Correct 158 ms 21436 KB Output is correct
18 Correct 150 ms 21060 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3033 ms 26720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3040 ms 5620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 25424 KB Output is correct
2 Correct 162 ms 24148 KB Output is correct
3 Correct 175 ms 23768 KB Output is correct
4 Correct 153 ms 22444 KB Output is correct
5 Correct 164 ms 25848 KB Output is correct
6 Correct 170 ms 25936 KB Output is correct
7 Correct 162 ms 26452 KB Output is correct
8 Correct 152 ms 24400 KB Output is correct
9 Correct 145 ms 23160 KB Output is correct
10 Correct 155 ms 23092 KB Output is correct
11 Correct 151 ms 23608 KB Output is correct
12 Correct 193 ms 20988 KB Output is correct
13 Correct 157 ms 22132 KB Output is correct
14 Correct 179 ms 24872 KB Output is correct
15 Correct 159 ms 22812 KB Output is correct
16 Correct 35 ms 1112 KB Output is correct
17 Correct 158 ms 21436 KB Output is correct
18 Correct 150 ms 21060 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Execution timed out 3033 ms 26720 KB Time limit exceeded
22 Halted 0 ms 0 KB -