Submission #19724583

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define tr(it,a) for(auto it=a.begin();it!=a.end();it++)
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
int main() {
	FASTIO
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int t = 1;
//	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		if (n == 1) {
			cout << 2 << endl;
			break;
		}
		stack < pair<ll, ll>> s1, s2;
		for (int i = 1; i <= pow(2, n); i++) {
			ll x;
			cin >> x;
			s1.push(mp(x, i));
		}
		for (int i = 0; i < n - 1; i++) {
			if (i % 2 == 0) {
				while (!s1.empty()) {
					auto it1 = s1.top();
					s1.pop();
					auto it2 = s1.top();
					s1.pop();
					if (it1.F > it2.F) {
						s2.push(it1);
					}
					else {
						s2.push(it2);
					}
				}
			}
			else {
				while (!s2.empty()) {
					auto it1 = s2.top();
					s2.pop();
					auto it2 = s2.top();
					s2.pop();
					if (it1.F > it2.F) {
						s1.push(it1);
					}
					else {
						s1.push(it2);
					}
				}
			}
		}
		ll ans = 0;
		while (!s1.empty()) {
			auto it1 = s1.top();
			s1.pop();
			auto it2 = s1.top();
			s1.pop();
			ans = min(it1.S, it2.S);
		}
		while (!s2.empty()) {
			auto it1 = s2.top();
			s2.pop();
			auto it2 = s2.top();
			s2.pop();
			ans = min(it1.S, it2.S);
		}
		cout << ans << endl;
	}

	return 0;
}

Submission Info

Judge Result