Submission #247923

#TimeUsernameProblemLanguageResultExecution timeMemory
247923NONAMETurnir (COCI17_turnir)C++14
100 / 100
800 ms15736 KiB
#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 timeMemoryGrader output
Fetching results...