Submission #856082

#TimeUsernameProblemLanguageResultExecution timeMemory
856082vjudge1Turnir (COCI17_turnir)C++17
100 / 100
1773 ms65536 KiB
#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; 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(); }
#Verdict Execution timeMemoryGrader output
Fetching results...