Submission #729991

#	Time	Username	Problem	Language	Result	Execution time	Memory
729991		baojiaopisu	Abracadabra (CEOI22_abracadabra)	C++14	10 / 100	3039 ms	50372 KiB

Main

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e6 + 10;

int a[N], b[N], ans[N];
vector<pii> query[N];

void BaoJiaoPisu() {
	int n, q; cin >> n >> q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	
	for(int i = 1; i <= q; i++) {
		int t, c; cin >> t >> c;
		minimize(t, n);
		if(t == 0) ans[i] = a[c];
		query[t].pb(mp(c, i));
	}	

	int it = 0;
	while(true) {
		++it;
		int i = 1, j = n / 2 + 1;
		int curr = 0;
		while(i <= n / 2 || j <= n) {
			if(i > n / 2) b[++curr] = a[j++];
			else if(j > n) b[++curr] = a[i++];
			else if(a[i] < a[j]) b[++curr] = a[i++];
			else b[++curr] = a[j++];
		}

		bool ok = true;
		for(int i = 1; i <= n; i++) {
			ok &= (a[i] == b[i]);
			a[i] = b[i];
		}

		for(auto x : query[it]) {
			ans[x.se] = a[x.fi];
		}
		if(ok) break;
	}

	if(it < n) {
		for(auto x : query[n]) {
			ans[x.se] = a[x.fi];
		}
	}

	for(int i = 1; i <= q; i++) {
		cout << ans[i] << '\n';
	}
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:125:17: warning: unused variable 'ddd' [-Wunused-variable]
  125 |     int tc = 1, ddd = 0;
      |                 ^~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25