oj.uz

Submission #813146

# Submission time Handle Problem Language Result Execution time Memory
813146 2023-08-07T13:53:18 Z GrindMachine Abracadabra (CEOI22_abracadabra) C++17
10 / 100
 476 ms 524288 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,q; cin >> n >> q;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];

    auto oa = a;
    vector<vector<ll>> here(n+5);
    here[0] = a;

    rep1(id,n){
        vector<ll> v1,v2,v3;
        rep(i,n){
            if(i < n/2){
                v1.pb(a[i]);
            }
            else{
                v2.pb(a[i]);
            }
        }    

        ll ptr1 = 0, ptr2 = 0;
        while(ptr1 < n/2 or ptr2 < n/2){
            if(ptr1 == n/2){
                v3.pb(v2[ptr2++]);
            }
            else if(ptr2 == n/2){
                v3.pb(v1[ptr1++]);
            }
            else{
                if(v1[ptr1] < v2[ptr2]){
                    v3.pb(v1[ptr1++]);
                }
                else{
                    v3.pb(v2[ptr2++]);
                }
            }
        }

        a = v3;
        here[id] = a;
    }

    while(q--){
        ll t,i; cin >> t >> i;
        amin(t,n);
        ll ans = here[t][i-1];
        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 19720 KB Output is correct
2 Correct 180 ms 19464 KB Output is correct
3 Correct 186 ms 18668 KB Output is correct
4 Correct 159 ms 17724 KB Output is correct
5 Correct 174 ms 19148 KB Output is correct
6 Correct 160 ms 17664 KB Output is correct
7 Correct 175 ms 19196 KB Output is correct
8 Correct 159 ms 17648 KB Output is correct
9 Correct 166 ms 18076 KB Output is correct
10 Correct 175 ms 17768 KB Output is correct
11 Correct 165 ms 18208 KB Output is correct
12 Correct 149 ms 16732 KB Output is correct
13 Correct 159 ms 17408 KB Output is correct
14 Correct 168 ms 18592 KB Output is correct
15 Correct 166 ms 17952 KB Output is correct
16 Correct 7 ms 8000 KB Output is correct
17 Correct 151 ms 16932 KB Output is correct
18 Correct 170 ms 16968 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 473 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 476 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 19720 KB Output is correct
2 Correct 180 ms 19464 KB Output is correct
3 Correct 186 ms 18668 KB Output is correct
4 Correct 159 ms 17724 KB Output is correct
5 Correct 174 ms 19148 KB Output is correct
6 Correct 160 ms 17664 KB Output is correct
7 Correct 175 ms 19196 KB Output is correct
8 Correct 159 ms 17648 KB Output is correct
9 Correct 166 ms 18076 KB Output is correct
10 Correct 175 ms 17768 KB Output is correct
11 Correct 165 ms 18208 KB Output is correct
12 Correct 149 ms 16732 KB Output is correct
13 Correct 159 ms 17408 KB Output is correct
14 Correct 168 ms 18592 KB Output is correct
15 Correct 166 ms 17952 KB Output is correct
16 Correct 7 ms 8000 KB Output is correct
17 Correct 151 ms 16932 KB Output is correct
18 Correct 170 ms 16968 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Runtime error 473 ms 524288 KB Execution killed with signal 9
22 Halted 0 ms 0 KB -