# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1087050 | toast12 | Turnir (COCI17_turnir) | C++14 | 1098 ms | 54608 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 main() {
int n;
cin >> n;
int x = (1<<n);
vector<int> nums(x);
map<int, int> cnt;
for (int i = 0; i < x; i++) {
cin >> nums[i];
cnt[nums[i]]++;
}
int cur = 0;
map<int, int> ans;
for (auto c : cnt) {
cur += c.second;
int temp = log2(cur);
ans[c.first] = n-temp;
}
for (int i = 0; i < x; i++) cout << ans[nums[i]] << ' ';
cout << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |