Submission #634486

#	Time	Username	Problem	Language	Result	Execution time	Memory
634486		inksamurai	Poklon (COCI17_poklon7)	C++17	0 / 120	530 ms	262144 KiB

poklon

#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3PGDklf ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

signed main(){
_3PGDklf;
	int n;
	cin>>n;
	vec(vi) adj(n);
	rep(i,n){
		int ul,ur;
		cin>>ul>>ur;
		adj[i].pb(ul);
		adj[i].pb(ur);
	}
	auto bintostr=[&](int v){
		string s="";
		if(v==0) return s="0";
		while(v){
			s+=(char)(v%2+'0');
			v/=2;
		}
		reverse(s.begin(), s.end());
		return s;
	};
	vi cntr(n);
	vec(string) rbe(n);
	auto dfs=[&](auto self,int v)->void{
		int ma=-1;
		rep(i,sz(adj[v])){
			int u=adj[v][i];
			if(i==0){
				if(u>0){
					self(self,u-1);
				}else{
					ma=max(ma,-u);
				}
			}else{
				if(u>0){
					self(self,u-1);
				}else{
					ma=max(ma,-u);
				}
			}
		}
		cntr[v]=v;
		if(ma>=0) rbe[v]=bintostr(ma);
		int ul=cntr[adj[v][0]<=0?v:adj[v][0]-1];
		int ur=cntr[adj[v][1]<=0?v:adj[v][1]-1];
		if(!(ul>=0 and ur>=0)){
			cout<<"asdashdasdji\n";
			exit(0);
		}
		cntr[v]=ul;
		if(sz(rbe[ul])<sz(rbe[ur]) or (sz(rbe[ul])==sz(rbe[ur]) and rbe[ul]<rbe[ur])){
			cntr[v]=ur;
		}
		// rbe[cntr[v]]+="0";
	};
	dfs(dfs,0);
	print(rbe[cntr[0]]);
}

• Subtask 1: 0 / 120