| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 660668 | BidoTeima | Poklon (COCI17_poklon7) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
ID: BidoTeima
LANG: C++11
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void moo(string filename);
void ACPLS(string str = "")
{
if(str=="NOF")return;
if(str.size())
moo(str);
else{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
}
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc \
int tttttt/*,subtask*/; \
cin >> tttttt/* >> subtask*/; \
while (tttttt--)/*end
*/
vector<__int128_t>adj[(int)1e6+5];
__int128_t sum[(int)1e6+5];
__int128_t dfs(ll node){
if(node<=0)return -node;
__int128_t x = dfs(adj[node][0]);
__int128_t y = dfs(adj[node][1]);
return sum[node]=x+y+abs(x-y);
}
int main()
{
//ACPLS();
int n;
cin>>n;
for(int i = 1; i <= n; i++){
ll u,v;
cin>>u>>v;
adj[i].push_back(u);
adj[i].push_back(v);
}
dfs(1);
string binary;
if(sum[1]==0)binary="0";
else while(sum[1]){
binary.push_back((sum[1]%2)+'0');
sum[1]/=2;
}
reverse(binary.begin(),binary.end());
cout<<binary;
}