# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294545 | 7_7_7 | Turnir (COCI17_turnir) | C++17 | 1513 ms | 42364 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()
{
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> b(1 << n);
vector<pair<int, int>> a(1 << n);
for(int i = 0; i < (1 << n); i ++){
cin >> a[i].first;
a[i].second = i;
b[i] = a[i].first;
}
sort(a.begin(), a.end());
map<int, int> res;
for(int i = 0; i < (1 << n); i ++){
res[a[i].first] = max(res[a[i].first], int(floor(log2(i + 1))));
}
for(int i = 0; i < (1 << n); i ++){
cout << n - res[b[i]] << " ";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |