#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int _n;
cin >> _n;
int n = 1;
for (int i = 0; i < _n; i++) n *= 2;
vector <int> v;
v.resize(n);
vector <int> s;
for (int i = 0; i < n; i++) {
cin >> v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
/*
for (int i = 0; i < n; i++) cout << v[i] << " ";
cout << '\n';
for (int i = 0; i < n; i++) cout << s[i] << " ";
cout << '\n';
*/
map <int, int> razina;
int trenutno = _n + 1;
for (int i = 1; i <= n; i++) {
if (!(i & (i - 1))) trenutno--;
//cout << i << " " << trenutno << '\n';
razina[s[i - 1]] = trenutno;
}
for (int i = 0; i < n; i++) {
cout << razina[v[i]] << " ";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
7 ms |
560 KB |
Output is correct |
5 |
Correct |
19 ms |
1280 KB |
Output is correct |
6 |
Correct |
45 ms |
3320 KB |
Output is correct |
7 |
Correct |
87 ms |
4980 KB |
Output is correct |
8 |
Correct |
113 ms |
4616 KB |
Output is correct |
9 |
Correct |
583 ms |
24372 KB |
Output is correct |
10 |
Correct |
1297 ms |
38368 KB |
Output is correct |