oj.uz

답안 #791439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
791439 2023-07-24T06:30:55 Z ono_de206 Abracadabra (CEOI22_abracadabra) C++14
10 / 100
 213 ms 11744 KB 
#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.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 9880 KB Output is correct
2 Correct 165 ms 11744 KB Output is correct
3 Correct 161 ms 11456 KB Output is correct
4 Correct 155 ms 11392 KB Output is correct
5 Correct 169 ms 11684 KB Output is correct
6 Correct 162 ms 11324 KB Output is correct
7 Correct 184 ms 11700 KB Output is correct
8 Correct 158 ms 11380 KB Output is correct
9 Correct 155 ms 11476 KB Output is correct
10 Correct 157 ms 11340 KB Output is correct
11 Correct 161 ms 11628 KB Output is correct
12 Correct 173 ms 11360 KB Output is correct
13 Correct 167 ms 11424 KB Output is correct
14 Correct 156 ms 11560 KB Output is correct
15 Correct 175 ms 11616 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 147 ms 11452 KB Output is correct
18 Correct 152 ms 11400 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 213 ms 9992 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 135 ms 9228 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 9880 KB Output is correct
2 Correct 165 ms 11744 KB Output is correct
3 Correct 161 ms 11456 KB Output is correct
4 Correct 155 ms 11392 KB Output is correct
5 Correct 169 ms 11684 KB Output is correct
6 Correct 162 ms 11324 KB Output is correct
7 Correct 184 ms 11700 KB Output is correct
8 Correct 158 ms 11380 KB Output is correct
9 Correct 155 ms 11476 KB Output is correct
10 Correct 157 ms 11340 KB Output is correct
11 Correct 161 ms 11628 KB Output is correct
12 Correct 173 ms 11360 KB Output is correct
13 Correct 167 ms 11424 KB Output is correct
14 Correct 156 ms 11560 KB Output is correct
15 Correct 175 ms 11616 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 147 ms 11452 KB Output is correct
18 Correct 152 ms 11400 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Runtime error 213 ms 9992 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -