oj.uz

Submission #794536

# Submission time Handle Problem Language Result Execution time Memory
794536 2023-07-26T15:32:47 Z ono_de206 Abracadabra (CEOI22_abracadabra) C++14
50 / 100
 3000 ms 48400 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 = 2e5 + 10, mxq = 1e6 + 10;
vector<pair<int, int>> qu[mxn];
int a[mxn], ans[mxq], nxt[mxn], did[mxn];

signed main() {
	fast;
	int n, q;
	cin >> n >> q;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		did[i] = -1;
	}

	for(int i = 1; i <= q; i++) {
		int t, id;
		cin >> t >> id;
		mnn(t, n);
		if(t == 0) {
			ans[i] = a[id];
		} else {
			qu[t].eb(id, i);
		}
	}

	stack<pair<int, int>> st;
	for(int i = 1; i <= n; i++) {
		nxt[i] = n + 1;
	}
	nxt[n + 1] = n + 1;
	for(int i = 1; i <= n; i++) {
		while(st.size() && st.top().ff < a[i]) {
			nxt[st.top().ss] = i;
			st.pop();
		}
		st.emplace(a[i], i);
	}

	set<pair<int, pair<int, int>>> s;
	for(int i = 1; i <= n; i = nxt[i]) {
		s.emplace(a[i], make_pair(i, nxt[i] - 1));
		assert(i <= nxt[i] - 1);
	}

	int len = n;

	for(int t = 1; t <= n; t++) {
		while(1) {
			auto val = *s.rbegin();
			if(len - (val.ss.ss - val.ss.ff + 1) >= n / 2) {
				len -= (val.ss.ss - val.ss.ff + 1);
				for(int i = val.ss.ff; i <= val.ss.ss; i++) {
					did[len + (i - val.ss.ff + 1)] = a[i];
				}
				s.erase(*s.rbegin());
			} else {
				break;
			}
		}
		if(len > n / 2) {
			auto val = *s.rbegin();
			s.erase(*s.rbegin());
			len -= (val.ss.ss - val.ss.ff + 1);
			s.emplace(val.ff, make_pair(val.ss.ff, val.ss.ff + n / 2 - len - 1));
			for(int i = val.ss.ff + n / 2 - len; i <= val.ss.ss; i = nxt[i]) {
				s.emplace(a[i], make_pair(i, min(nxt[i] - 1, val.ss.ss)));
			}
			len += (val.ss.ss - val.ss.ff + 1);
		}
		sort(all(qu[t]));
		auto it = s.begin();
		int lol = 0;
		for(auto U : qu[t]) {
			int id = U.ff;
			int i = U.ss;
			if(id > len) {
				ans[i] = did[id];
				continue;
			}
			while(it != s.end() && lol + (*it).ss.ss - (*it).ss.ff + 1 < id) {
				lol += (*it).ss.ss - (*it).ss.ff + 1;
				it++;
			}
			ans[i] = a[(*it).ss.ff + id - lol - 1];
		}
	}
	
	for(int i = 1; i <= q; i++) {
		cout << ans[i] << '\n';
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 30724 KB Output is correct
2 Correct 219 ms 29200 KB Output is correct
3 Correct 221 ms 28628 KB Output is correct
4 Correct 228 ms 26280 KB Output is correct
5 Correct 225 ms 30496 KB Output is correct
6 Correct 208 ms 30432 KB Output is correct
7 Correct 226 ms 31868 KB Output is correct
8 Correct 215 ms 28876 KB Output is correct
9 Correct 216 ms 27544 KB Output is correct
10 Correct 215 ms 27700 KB Output is correct
11 Correct 231 ms 27980 KB Output is correct
12 Correct 212 ms 24352 KB Output is correct
13 Correct 225 ms 26488 KB Output is correct
14 Correct 214 ms 29872 KB Output is correct
15 Correct 226 ms 26768 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 134 ms 18392 KB Output is correct
18 Correct 185 ms 22020 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5036 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 36164 KB Output is correct
2 Correct 284 ms 48400 KB Output is correct
3 Correct 274 ms 38960 KB Output is correct
4 Correct 230 ms 35340 KB Output is correct
5 Correct 233 ms 36236 KB Output is correct
6 Correct 223 ms 34984 KB Output is correct
7 Correct 248 ms 40368 KB Output is correct
8 Correct 250 ms 39728 KB Output is correct
9 Correct 228 ms 35500 KB Output is correct
10 Correct 232 ms 36852 KB Output is correct
11 Correct 209 ms 31148 KB Output is correct
12 Correct 208 ms 31548 KB Output is correct
13 Correct 238 ms 35932 KB Output is correct
14 Correct 213 ms 32140 KB Output is correct
15 Correct 237 ms 37540 KB Output is correct
16 Correct 19 ms 8628 KB Output is correct
17 Correct 195 ms 38284 KB Output is correct
18 Correct 183 ms 30420 KB Output is correct
19 Correct 48 ms 12244 KB Output is correct
20 Correct 65 ms 15680 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1581 ms 14576 KB Output is correct
2 Execution timed out 3067 ms 14412 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 30724 KB Output is correct
2 Correct 219 ms 29200 KB Output is correct
3 Correct 221 ms 28628 KB Output is correct
4 Correct 228 ms 26280 KB Output is correct
5 Correct 225 ms 30496 KB Output is correct
6 Correct 208 ms 30432 KB Output is correct
7 Correct 226 ms 31868 KB Output is correct
8 Correct 215 ms 28876 KB Output is correct
9 Correct 216 ms 27544 KB Output is correct
10 Correct 215 ms 27700 KB Output is correct
11 Correct 231 ms 27980 KB Output is correct
12 Correct 212 ms 24352 KB Output is correct
13 Correct 225 ms 26488 KB Output is correct
14 Correct 214 ms 29872 KB Output is correct
15 Correct 226 ms 26768 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 134 ms 18392 KB Output is correct
18 Correct 185 ms 22020 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 5036 KB Output is correct
21 Correct 297 ms 36164 KB Output is correct
22 Correct 284 ms 48400 KB Output is correct
23 Correct 274 ms 38960 KB Output is correct
24 Correct 230 ms 35340 KB Output is correct
25 Correct 233 ms 36236 KB Output is correct
26 Correct 223 ms 34984 KB Output is correct
27 Correct 248 ms 40368 KB Output is correct
28 Correct 250 ms 39728 KB Output is correct
29 Correct 228 ms 35500 KB Output is correct
30 Correct 232 ms 36852 KB Output is correct
31 Correct 209 ms 31148 KB Output is correct
32 Correct 208 ms 31548 KB Output is correct
33 Correct 238 ms 35932 KB Output is correct
34 Correct 213 ms 32140 KB Output is correct
35 Correct 237 ms 37540 KB Output is correct
36 Correct 19 ms 8628 KB Output is correct
37 Correct 195 ms 38284 KB Output is correct
38 Correct 183 ms 30420 KB Output is correct
39 Correct 48 ms 12244 KB Output is correct
40 Correct 65 ms 15680 KB Output is correct
41 Correct 1581 ms 14576 KB Output is correct
42 Execution timed out 3067 ms 14412 KB Time limit exceeded
43 Halted 0 ms 0 KB -