Submission #791439

#	Time	Username	Problem	Language	Result	Execution time	Memory
791439		ono_de206	Abracadabra (CEOI22_abracadabra)	C++14	10 / 100	213 ms	11744 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
    return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
    return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
    return in;
}


template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1010;
int a[mxn][mxn];

void go() {
	int n, q;
	cin >> n >> q;
	for(int i = 1; i <= n; i++) {
		cin >> a[0][i];
	}
	for(int i = 1; i <= n; i++) {
		int l = 1, r = n / 2 + 1;
		for(int j = 1; j <= n; j++) {
			if(l == n / 2 + 1) a[i][j] = a[i - 1][r++];
			else if(r == n + 1) a[i][j] = a[i - 1][l++];
			else if(a[i - 1][l] < a[i - 1][r]) a[i][j] = a[i - 1][l++];
			else a[i][j] = a[i - 1][r++];
		}
	}
	while(q--) {
		int t, i;
		cin >> t >> i;
		mnn(t, n);
		cout << a[t][i] << '\n';
	}
}
 
signed main() {
	// #ifndef ONO
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	// #endif
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

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