| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1260643 | wedonttalkanymore | Turnir (COCI17_turnir) | C++20 | 387 ms | 78232 KiB | 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 20;
int n;
pii a[1 << 20];
int ans[1 << 20];
vector <int> fre[1 << 20];
vector <int> comp;
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (fopen(".inp", "r")) {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
    cin >> n;
    int sz = 1 << n;
    for (int i = 0; i < sz; i++) {
        cin >> a[i].fi;
        a[i].se = i;
        fre[a[i].fi].push_back(i);
        comp.push_back(a[i].fi);
    }
    sort(a, a + sz);
    sort(comp.begin(), comp.end());
    comp.erase(unique(comp.begin(), comp.end()), comp.end());
    // for (int i = 0; i < sz; i++) cout << a[i].fi << ' ';
    // cout << '\n';
    int t = 0;
    for (int i = 0; i < comp.size(); i++) {
        t += fre[comp[i]].size();
        int l = 1, r = 32, res = 0;
        while(l <= r) {
            int mid = (l + r) / 2;
            if ((1 << mid) <= t) {
                res = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
        for (int x : fre[comp[i]]) {
            ans[x] = n - res;
        }
    }
    cout << '\n';
    for (int i = 0; i < sz; i++) cout << ans[i] << ' ';
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
