oj.uz

Submission #856146

# Submission time Handle Problem Language Result Execution time Memory
856146 2023-10-02T17:38:41 Z vjudge1 Turnir (COCI17_turnir) C++17
100 / 100
 519 ms 19168 KB 
#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()



void solve() {
	int n;
	cin >> n;
	int N = n;
	n = 1;
	F(i,N) n*=2;
	vi a(n+1);
	F(i,n) cin >> a[i];
	vi b(n+1);
	F(i,n) b[i] = a[i];
	sort(b.begin()+1,b.end());
	for (int i=1;i<=n;i++) {
		int r = upper_bound(b.begin()+1,b.end(),a[i])-b.begin()-1;
		int ans = N;
		for (int j=1;j<=N;j++) if (r >= (1<<j)) ans = N-j;
		cout << ans << " ";
	}
	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();
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 9 ms 860 KB Output is correct
6 Correct 22 ms 1368 KB Output is correct
7 Correct 49 ms 2804 KB Output is correct
8 Correct 89 ms 5084 KB Output is correct
9 Correct 220 ms 9684 KB Output is correct
10 Correct 519 ms 19168 KB Output is correct