# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
82735 |
2018-11-01T14:06:09 Z |
heon |
Turnir (COCI17_turnir) |
C++11 |
|
1258 ms |
44612 KB |
#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 |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
3 ms |
624 KB |
Output is correct |
4 |
Correct |
4 ms |
864 KB |
Output is correct |
5 |
Correct |
18 ms |
1564 KB |
Output is correct |
6 |
Correct |
48 ms |
3836 KB |
Output is correct |
7 |
Correct |
96 ms |
5828 KB |
Output is correct |
8 |
Correct |
124 ms |
6456 KB |
Output is correct |
9 |
Correct |
609 ms |
27224 KB |
Output is correct |
10 |
Correct |
1258 ms |
44612 KB |
Output is correct |