제출 #109214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
109214		Frankenween	Turnir (COCI17_turnir)	C++17	100 / 100	376 ms	42204 KiB

turnir

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod1 = (ll)1e9 + 7;
const ll mod2 = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;


using namespace std;


template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
    for (T &cnt : arr) {
        in >> cnt;
    }
    return in;
};


void solve() {
    ll n, dg;
    cin >> n;
    dg = n;
    n = (1LL << n);
    vector<ll> arr(n);
    cin >> arr;
    vector<pair<ll, ll>> have(n);
    for (int i = 0; i < n; i++) {
        have[i].first = arr[i];
        have[i].second = i;
    }
    sort(all(have));
    vector<ll> answer(n);
    while (!have.empty()) {
        ll val = have.back().first;
        ll rest = (have.size() - 1);
        ll i = 22;
        while ((1LL << i) - 1 > rest) {
            i--;
        }
        while (!have.empty() and have.back().first == val) {
            answer[have.back().second] = i;
            have.pop_back();
        }
    }
    for (int i = 0; i < n; i++) {
        cout << dg - answer[i] << " ";
    }
}


int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#else
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout.precision(30);
    ll seed = time(0);
    //cerr << "Seed: " << seed << "\n";
    srand(seed);
    solve();
    return 0;
}

• Subtask 1: 100 / 100