#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1000000009
#define MOD 1000000007
#define lim 200005
using namespace std;
void solve(){
int n; cin >> n;
map<int, int> num;
map<int, int> ans;
int arr[(1<<n)+1];
for(int i=1; i<=(1<<n); i++){
int a; cin >> a;
arr[i]=a;
num[a]++;
}
int cur=0;
for(auto p:num){
cur+=p.nd;
cerr << p.st spc p.nd spc cur << endl;
ans[p.st] = n - __lg(cur);
}
for(int i=1; i<=(1<<n); i++) cout << ans[arr[i]] << " ";
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);
#ifdef Local
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int t=1;
//cin >> t;
while(t--) solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
360 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
76 ms |
1840 KB |
Output is correct |
6 |
Correct |
331 ms |
6740 KB |
Output is correct |
7 |
Correct |
462 ms |
9784 KB |
Output is correct |
8 |
Correct |
157 ms |
4176 KB |
Output is correct |
9 |
Correct |
2953 ms |
51232 KB |
Output is correct |
10 |
Execution timed out |
3052 ms |
65536 KB |
Time limit exceeded |