Submission #856110

#TimeUsernameProblemLanguageResultExecution timeMemory
856110vjudge1Turnir (COCI17_turnir)C++17
20 / 100
3063 ms65536 KiB
#include <bits/stdc++.h>
using namespace std;
#define sp << " " << 
#define int long long
#define vi vector<int>
#define pb push_back
#define F(xxx,yyy) for (int xxx=1;xxx<=yyy;xxx++)
#define pii pair<int,int>
#define all(x) x.begin()+1,x.end()
const int N = 4e5+1;


void solve() {
	int n;
	cin >> n;
	int N = n;
	n = pow(2,n);
	vi a(n+1);
	F(i,n) cin >> a[i];
	map<int,int> mp,mp2;
	F(i,n) mp[a[i]]++;
	vi bg(n+1);
	vector<pii> ps(n+1);
	F(i,n) ps[i] = {a[i],i};
	sort(ps.begin()+1,ps.end());
	F(i,n) mp2[ps[i].first]++,bg[ps[i].second] = i-mp2[ps[i].first]+mp[ps[i].first]-1;
	vi ans(n+1);
	F(i,n) {
		for (int j=0;j<n;j++) {
			if (bg[i] >= (1<<j)-1) ans[i] = N-j;
		}
	}
	F(i,n) cout << ans[i] << " ";
	cout << endl;
}     	
                 
                 
                 
                 
                 
                 
                 
                 
                                
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}


#Verdict Execution timeMemoryGrader output
Fetching results...