Submission #8533839


Source Code Expand

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

const int MAXN = 2.1e5;
int N;
int P[MAXN];
int invP[MAXN];
const int S = 1 << 18;
pair<int, int> seg[2][2 * S];
pair<int, int> query(int z, int l, int r) {
	assert(l <= r);
	pair<int, int> ans(1e9,1e9);
	for (int a = S + l, b = S + r + 1; a < b; a /= 2, b /= 2 ){
		if (a & 1) {
			ans = min(ans, seg[z][a]);
			a++;
		}
		if (b & 1) {
			--b;
			ans = min(ans, seg[z][b]);
		}
	}
	return ans;
}

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> N;
	for (int i = 0; i < N; i++) cin >> P[i], invP[P[i]] = i;
	for (int z = 0; z < 2; z++) {
		for (int i = S; i < 2 * S; i++) {
			seg[z][i] = {1e9, 1e9};
		}
	}
	for (int i = 0; i < N; i++) {
		seg[i&1][S+i] = {P[i], i};
	}
	for (int z = 0; z < 2; z++) {
		for (int i = S-1; i > 0; i--) {
			seg[z][i] = min(seg[z][2*i], seg[z][2*i+1]);
		}
	}

	using pii = pair<int, int>;
	using evt = pair<pii, pii>;
	priority_queue<evt, vector<evt>, greater<evt>> pq;
	auto solve = [&](int L, int R) {
		if (L > R) return;
		assert((R - L) & 1);
		int i = query(L&1, L, R-1).second;
		int j = query(!(i&1), i+1, R).second;
		pq.push({{P[i], P[j]}, {L, R}});
	};

	solve(0, N-1);
	while (!pq.empty()) {
		auto e = pq.top(); pq.pop();
		int l = e.second.first, r = e.second.second;
		int i = invP[e.first.first], j = invP[e.first.second];
		cout << P[i] << ' ' << P[j] << ' ';
		solve(l, i-1);
		solve(i+1, j-1);
		solve(j+1, r);
	}
	cout << '\n';

	return 0;
}

Submission Info

Submission Time
Task E - Young Maids
User ecnerwala
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1537 Byte
Status AC
Exec Time 69 ms
Memory 12020 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 3
AC × 23
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt
Case Name Status Exec Time Memory
0_00.txt AC 5 ms 8448 KB
0_01.txt AC 5 ms 8448 KB
0_02.txt AC 4 ms 8448 KB
1_00.txt AC 4 ms 8448 KB
1_01.txt AC 4 ms 8448 KB
1_02.txt AC 55 ms 11264 KB
1_03.txt AC 48 ms 11264 KB
1_04.txt AC 56 ms 11264 KB
1_05.txt AC 65 ms 12020 KB
1_06.txt AC 66 ms 11896 KB
1_07.txt AC 64 ms 12020 KB
1_08.txt AC 69 ms 11896 KB
1_09.txt AC 52 ms 11264 KB
1_10.txt AC 58 ms 11264 KB
1_11.txt AC 58 ms 11264 KB
1_12.txt AC 63 ms 11768 KB
1_13.txt AC 65 ms 11896 KB
1_14.txt AC 64 ms 11896 KB
1_15.txt AC 65 ms 11896 KB
1_16.txt AC 65 ms 11896 KB
1_17.txt AC 65 ms 11896 KB
1_18.txt AC 65 ms 11896 KB
1_19.txt AC 64 ms 11896 KB