# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237801 | marlicu | Turnir (COCI17_turnir) | C++14 | 1297 ms | 38368 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);
cin.tie(0); cout.tie(0);
int _n;
cin >> _n;
int n = 1;
for (int i = 0; i < _n; i++) n *= 2;
vector <int> v;
v.resize(n);
vector <int> s;
for (int i = 0; i < n; i++) {
cin >> v[i];
s.push_back(v[i]);
}
sort(s.begin(), s.end());
/*
for (int i = 0; i < n; i++) cout << v[i] << " ";
cout << '\n';
for (int i = 0; i < n; i++) cout << s[i] << " ";
cout << '\n';
*/
map <int, int> razina;
int trenutno = _n + 1;
for (int i = 1; i <= n; i++) {
if (!(i & (i - 1))) trenutno--;
//cout << i << " " << trenutno << '\n';
razina[s[i - 1]] = trenutno;
}
for (int i = 0; i < n; i++) {
cout << razina[v[i]] << " ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |