oj.uz

Submission #247923

# Submission time Handle Problem Language Result Execution time Memory
247923 2020-07-12T06:39:42 Z NONAME Turnir (COCI17_turnir) C++14
100 / 100
 800 ms 15736 KB 
#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";
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 12 ms 1024 KB Output is correct
6 Correct 37 ms 1592 KB Output is correct
7 Correct 66 ms 3036 KB Output is correct
8 Correct 112 ms 4856 KB Output is correct
9 Correct 292 ms 8440 KB Output is correct
10 Correct 800 ms 15736 KB Output is correct