제출 #247960

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247960		VEGAnn	Turnir (COCI17_turnir)	C++14	100 / 100	411 ms	17260 KiB

turnir

#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int n, a[(1 << N)], ans[(1 << N)], nm[(1 << N)];

bool cmp(int _x, int _y){
    return a[_x] < a[_y];
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 0; i < (1 << n); i++) {
        cin >> a[i];
        nm[i] = i;
    }

    sort(nm, nm + (1 << n), cmp);

    for (int it = (1 << n) - 1; it >= 0; ){
        int i = nm[it];

        int cnt = it + 1;

        int po = 0;

        while ((1 << (po + 1)) <= cnt)
            po++;

        int j = it;

        while (j >= 0 && a[nm[j]] == a[i]){
            ans[nm[j]] = n - po;
            j--;
        }

        it = j;
    }

    for (int i = 0; i < (1 << n); i++)
        cout << ans[i] << " ";

    return 0;
}

• Subtask 1: 100 / 100