# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247923 | NONAME | Turnir (COCI17_turnir) | C++14 | 800 ms | 15736 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>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
int n, a[(1 << 21)], b[(1 << 21)], pw[(1 << 21)];
int main() {
fast_io;
cin >> n;
n = (1 << n);
for (int i = 0; i < n; ++i)
cin >> a[i], b[i] = a[i];
sort(b, b + n);
int cur = 1, p = 0;
for (int i = 0; i <= n; ++i) {
if (i == cur)
cur *= 2, ++p;
pw[i] = p;
}
for (int i = 0; i < n; ++i) {
int x = upper_bound(b, b + n, a[i]) - b;
cout << pw[n] - pw[x] << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |