제출 #247999

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
247999		Vimmer	Turnir (COCI17_turnir)	C++14	100 / 100	642 ms	35364 KiB

turnir

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 2000100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



int b[N], a[N];

map <int, int> mp;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int m = (1 << n);

    vector <pair <int, int> > gr(m);

    for (int i = 0; i < m; i++) {cin >> gr[i].F; gr[i].S = i;}

    int need = 2;

    sort(gr.begin(), gr.end());

    b[gr[0].S] = n;

    for (int i = 1; i < m; i++)
    {
        b[gr[i].S] = b[gr[i - 1].S];

        if (need > i + 1) continue;

        need *= 2;

        b[gr[i].S]--;
    }

    for (int i = m - 1; i>= 0; i--)
    {
        int nm = gr[i].S, val = gr[i].F;

        if (mp.find(val) == mp.end()) {mp[val] = b[nm]; continue;}

        b[nm] = mp[val];
    }

    for (int i = 0; i < m; i++) cout << b[i] << " ";
}

• Subtask 1: 100 / 100