제출 #1239505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239505		Amaarsaa	Poklon (COCI17_poklon7)	C++20	78 / 120	1104 ms	327680 KiB

poklon

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const ll N = 1e6 + 2;

ll depth[N] = {0};
ll lef[N], rig[N];
string w[N];


string To_Bin(ll x) {
    ll i, r;
    string str = "";
    for (i = 30; i >= 0; i --) {
        r = 1<<i;
        if ( x >= r) {
            x -= r;
            str = str + "1";
        }
        else str = str + "0";
    }
    r = 0;
    while ( r < str.size() && str[r] == '0') r ++; 
    str = str.substr(r, str.size() - r);
    return str;
}
string add_one(string str) {
    ll r = str.size() - 1;
    while ( r >= 0 && str[r] == '1') {
        r --;
    }
    string str1 = str.substr(0, r + 1);
    if ( str1.size() == 0) str1 = "1";
    else str1[str1.size() - 1] = '1';
    str1 = str1 + string(str.size()- r - 1, '0');
    return str1;
}
string Unite(string l, ll l_a, string r, ll r_a) {
     if (l_a < r_a) {
         swap(l_a, r_a);
         swap(l, r);
     }
     string new_l, new_r;
     ll is_zero = 1;
     
     for (ll i = max(0ll, ll(r.size() - l_a)); i < r.size(); i ++) {
     	if ( r[i] == '1') is_zero = 0;
	 }
     l = l.substr(0, l.size() - l_a);
     r = r.substr(0, max(0ll, ll(r.size() - l_a)));
	if (r.size() == 0) r = "0";
	if ( is_zero == 0) r = add_one(r); 
	string str;
	if ( r.size() > l.size()) str = r;
	else {
		if ( l.size() > r.size()) str = l;
		else str= max(l, r);
	}
	str = str + string(l_a + 1, '0');
	return str;
}

void Find(ll x) {
    string lef_w, rig_w;
    ll lef_add, rig_add;

    if ( lef[x] < 0) {
        lef_w = To_Bin(-lef[x]);
        lef_add = 0;
    }
    else {
        Find(lef[x]);
        lef_w = w[lef[x]];
        lef_add = depth[lef[x]];
    }
    if ( rig[x] < 0) {
        rig_w = To_Bin(-rig[x]);
        rig_add = 0;
    }
    else {
        Find(rig[x]);
        rig_w = w[rig[x]];
        rig_add = depth[rig[x]];
    }
    depth[x] = max(lef_add, rig_add);
  w[x] = Unite(lef_w, lef_add, rig_w, rig_add);
 // cout << x << " " << w[x] << endl;
}

int main() {
    ll n, m, r, s, x, i, y;

    cin >> n;

    for (i = 1; i <= n; i ++){
        cin >> lef[i] >> rig[i];
    }
  //  cout << "HI" <<endl;
   Find(1);
	cout << w[1] << endl;
}

• Subtask 1: 78 / 120