| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 662759 | yoavL | Abracadabra (CEOI22_abracadabra) | C++14 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <math.h>
#include <fstream>
#include <iomanip>
#include <functional>
#include <numeric>
#include <chrono>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using pb = pair<bool, bool>;
using vpb = vector<pb>;
using vvpb = vector<vpb>;
using vi = vector<int>;
using vvi = vector<vi>;
using pi = pair<int, int>;
using vpi = vector<pi>;
const ll inf = (ll)2e18;
const ll mod = (ll)(1e9 + 7);
#define FAST ios_base::sync_with_stdio(0)
#define FASTIN cin.tie(0)
#define FASTOUT cout.tie(0)
#define upmin(a, b) (a) = min((a), (b))
#define upmax(a, b) (a) = max((a), (b))
#define pr(x) cout << x << endl
#define prv(v) for(auto it : v) cout << it << " "; cout << endl;
#define prvv(v) for(auto it : v) { for(auto it2 : it) cout << it2 << " "; cout << endl; } cout << endl;
#define spr(x) cout << x << " "
#define DBG_FLAG (1) // Toggle to switch between bebug mode and solution mode
#ifdef DBG_FLAG
#define wpr(x) cout << #x << ": " << (x) << endl;
#define wprv(v) cout << #v << ": " << endl; for(auto it : v) cout << it << " "; cout << endl;
#define wprvv(v) cout << #v << ": " << endl; for(auto it : v) { for(auto it2 : it) cout << it2 << " "; cout << endl; } cout << endl;
#define wspr(x) cout << #x << ": " << x << " "
#endif
#ifndef DBG_FLAG
#define wpr(x)
#define wprv(v)
#define wprvv(v)
#define wspr(x)
#endif
#define x first
#define y second
#define rep(i, s, e) for(ll i = s; i < e; i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
ostream& operator<<(ostream& os, const pll& p)
{
cout << "{" << p.first << ", " << p.second << "}" << endl;
return os;
}
vll merge_cards(vll& arr)
{
ll n = arr.size();
ll p1 = 0, p2 = n / 2;
vll res;
while (res.size() < n) {
if (p1 == n / 2) res.push_back(arr[p2++]);
else if (p2 == n) res.push_back(arr[p1++]);
else if (arr[p1] < arr[p2]) res.push_back(arr[p1++]);
else res.push_back(arr[p2++]);
}
return res;
}
void solve()
{
ll n, qNum;
cin >> n >> qNum;
vll arr(n);
rep(i, 0, n) {
cin >> arr[i];
}
vvll mat;
mat.push_back(arr);
while (true) {
mat.push_back(merge_cards(mat.back()));
if (mat.back() == mat[mat.size() - 2]) {
mat.pop_back();
break;
}
}
while (qNum--) {
ll qT, qInd;
cin >> qT >> qInd;
upmin(qT, mat.size() - (ll)1);
pr(mat[qT][qInd - 1]);
}
}
int32_t main()
{
FAST;
FASTIN; FASTOUT;
solve();
}