Submission #1239533

#	Time	Username	Problem	Language	Result	Execution time	Memory
1239533		Amaarsaa	Poklon (COCI17_poklon7)	C++20	90 / 120	1101 ms	327680 KiB

poklon

#include <bits/stdc++.h>

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

ll lef[N], rig[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);
     }
     ll is_zero = 1;
     
//     for (ll i = max(int(0), int(r.size() - (l_a - r_a ))); i < r.size(); i ++) {
//     	if ( r[i] == '1') is_zero = 0;
//	 }
	 if ( max(int(0), int(r.size() -(l_a - r_a))) == 0) r = "0";
    else r = r.substr(0, max(int(0), int(r.size() -(l_a - r_a))));
//	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);
	}
	return str;
}
ll to_number(string str) {
	ll p, ind, r =0 ;
	p = 1;
	ind = str.size() - 1;
	while ( ind >= 0) {
		if ( str[ind] == '1') r += p;
		p *= 2;
		ind --;
	}
	return r;
}
pair < ll, ll > 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 {
    	pair < ll, ll > R = Find(lef[x]);
        lef_w = To_Bin(R.first);
        lef_add =R.second;
    }
    if ( rig[x] < 0) {
        rig_w = To_Bin(-rig[x]);
        rig_add = 0;
    }
    else {
        pair <ll, ll > R = Find(rig[x]);
        rig_w = To_Bin(R.first);
        rig_add =R.second;
    }
    pair < ll, ll > P;
    P = make_pair(to_number(Unite(lef_w, lef_add, rig_w, rig_add)), max(lef_add, rig_add) + 1);
    return P;
}


int main() {
	ios::sync_with_stdio();
	cin.tie(0);
	cout.tie(0);
    ll n, m, r, s, x, i, y;

    cin >> n;

    for (i = 1; i <= n; i ++){
        cin >> lef[i] >> rig[i];
    }
  //  cout << "HI" <<endl;
  pair < ll, ll > P = Find(1);
   string ans = To_Bin(P.first);
   ll depth = P.second;
//   if ( w[1].size() > 33) {
  // 	while(1);
   //}
   cout << ans;
   for (i =0 ; i < depth; i ++) cout << '0';
   cout<< endl;
}

• Subtask 1: 90 / 120