Submission #249537

#	Time	Username	Problem	Language	Result	Execution time	Memory
249537		Vimmer	Poklon (COCI17_poklon7)	C++14	120 / 120	920 ms	151516 KiB

poklon

#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 1000010
#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 unsigned long long ull;
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 L[N], R[N];

void tranc(vector <char> &gr, int x)
{
    gr.clear();

    while (x > 0)
    {
        if (x % 2) gr.pb('1');
          else gr.pb('0');

        x /= 2;
    }

    reverse(gr.begin(), gr.end());
}

pair <int, vector <char> > dfs(int v)
{
    pair <int, vector <char> > l, r;

    if (L[v] < 0) l = dfs(abs(L[v])); else {l.F = 0; tranc(l.S, L[v]);}

    if (R[v] < 0) r = dfs(abs(R[v])); else {r.F = 0; tranc(r.S, R[v]);}

    if (sz(l.S) + l.F < sz(r.S) + r.F) swap(l, r);

    if (sz(l.S) + l.F != sz(r.S) + r.F) {l.F++; return l;}

    for (int i = 0; i < min(sz(r.S), sz(l.S)); i++)
    {
        if (l.S[i] == r.S[i]) continue;

        if (r.S[i] == '1') swap(l, r);

        break;
    }

    l.F++;

    return l;
}

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;

    for (int i = 1; i <= n; i++)
    {
        int l, r;

        cin >> l >> r;

        if (l < 0) L[i] = abs(l); else L[i] = -l;

        if (r < 0) R[i] = abs(r); else R[i] = -r;
    }

    pair <int, vector <char> > gr = dfs(1);

    for (int i = 0; i < gr.F; i++) gr.S.pb('0');

    for (auto it : gr.S) cout << it;
}

• Subtask 1: 120 / 120