Submission #251936

#	Time	Username	Problem	Language	Result	Execution time	Memory
251936		kartel	Poklon (COCI17_poklon7)	C++14	120 / 120	780 ms	88556 KiB

poklon

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define piii pair <int, pair <int, int> >
#define psi pair <string, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

pair <int, int> f[N];
int st[60];
int i, n;

piii umax(piii a, piii b)
{
    if (a.S.S > b.S.S) return a;
    if (a.S.S < b.S.S) return b;
    int l = 31, r = 31;

    while (!(a.F & st[l])) l--;
    while (!(b.F & st[r])) r--;

    while (l && r)
        {
            if (((a.F & st[l]) > 0) > ((b.F & st[r]) > 0)) return a;
            if (((a.F & st[l]) > 0) < ((b.F & st[r]) > 0)) return b;
            l--;
            r--;
        }
    if (a.F > b.F) return a;
    return b;
}

piii upd(piii x)
{
    x.S.F++;
    x.S.S++;
    return x;
}

string bin(ll x)
{
    string ans = "";
    if (x == 0) ans = "0";
    while (x)
    {
        if (x & 1)
             ans += "1";
        else ans += "0";
        //ans += char('0' + x & 1);
        x >>= 1;
    }
    reverse(all(ans));
    return ans;
}
piii make(int x)
{
    string a = bin(x);
    return {x, {0, sz(a)}};
}

piii rec(ll v)
{
    piii lF;
    piii rF;

    if (f[v].F > 0) lF = rec(f[v].F); else lF = make(-f[v].F);
    if (f[v].S > 0) rF = rec(f[v].S); else rF = make(-f[v].S);

    return upd(umax(lF, rF));
}


string restore(piii x)
{
    string ans = bin(x.F);
    for (int i = 0; i < x.S.F; i++) ans += "0";
    return ans;
}

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    in("17.in");
//    out("output.txt");
    cin >> n;
    st[0] = 1;
    for (i = 1; i < 32; i++) st[i] = st[i - 1] * 2;
    for (i = 1; i <= n; i++)
    {
        int l, r;
        cin >> l >> r;
        f[i] = {l, r};
    }

    cout << restore(rec(1)) << el;
}
//
//00000
//00110
//00111
//00011
//00000

• Subtask 1: 120 / 120