# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660710 | BidoTeima | Poklon (COCI17_poklon7) | C++17 | 740 ms | 56064 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<int,int>adj[(int)1e6+5];
pair<int,int>ans={0,0};
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;
}
void dfs(ll node, int d){
if(node <= 0){
if(node == 0)return;
if(log2(max(1ll,-node))+d>=log2(max(1,ans.first))+ans.second){
ans={-node,d};
}
return;
}
dfs(adj[node].first,d+1);
dfs(adj[node].second,d+1);
}
int main()
{
//ACPLS();
int n;
cin>>n;
for(int i = 1; i <= n; i++){
ll u,v;
cin>>u>>v;
adj[i].first=(u);
adj[i].second=(v);
}
dfs(1,0);
cout<<binary(ans.first);
for(int i = 0; i < ans.second; i++)cout<<0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |