# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660687 | BidoTeima | Poklon (COCI17_poklon7) | C++17 | 1110 ms | 262144 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
*/
pair<string,string>adjW[(int)1e6+5];
pair<int,int>adj[(int)1e6+5];
string sum[(int)1e6+5];
string binary(int x){
string ret;
if(x<0)x=-x;
if(!x)return "0";
while(x){
ret.push_back('0'+(x%2));
x/=2;
}
reverse(ret.begin(),ret.end());
return ret;
}
string mul2(string a){
if(a=="0")return "0";
a.push_back('0');
return a;
}
string mx(string&a,string&b){
if(a.size()>b.size())return a;
if(b.size()>a.size())return b;
for(int i = 0; i < (int)a.size(); i++){
if(a[i]=='1'&&b[i]=='0')return a;
if(a[i]=='0'&&b[i]=='1')return b;
}
return a;
}
string dfs(ll node){
string x = \
adj[node].first<=0?
adjW[node].first:
dfs(adj[node].first);
string y = \
adj[node].second<=0?
adjW[node].second:
dfs(adj[node].second);
return sum[node]=mul2(mx(x,y));
}
int main()
{
//ACPLS();
int n;
cin>>n;
for(int i = 1; i <= n; i++){
ll u,v;
cin>>u>>v;
adjW[i].first=(binary(u));
adjW[i].second=(binary(v));
adj[i].first=(u);
adj[i].second=(v);
}
dfs(1);
cout<<sum[1];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |