# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82735 | heon | Turnir (COCI17_turnir) | C++11 | 1258 ms | 44612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int logaj(int a){
int cnt = 0;
while(a){
a /= 2;
cnt++;
}
return cnt - 1;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector <int> v((1 << n));
vector <int> pocetni;
for(int i = 0; i < (1 << n); i++){
cin >> v[i];
pocetni.push_back(v[i]);
}
sort(v.begin(), v.end());
map <int,int> mp;
for(int i = 0; i < (1 << n) - 1; i++){
if(v[i] != v[i+1]) mp[v[i]] = n - logaj(i+1);
}
for(auto x : pocetni) cout << mp[x] << " ";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |