oj.uz

답안 #634639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
634639 2022-08-24T16:15:44 Z inksamurai Poklon (COCI17_poklon7) C++17
120 / 120
 742 ms 239996 KB 
#include <bits/stdc++.h>
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

const int _n=1000001;

int cntr[_n];
pii rbe[_n];




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);
	}
	string s;
	auto bintostr=[&](int v)->string{
		if(v==0) return "0";
		s="";
		while(v>0){
			s+=(char)((v%2)+'0');
			v/=2;
		}
		reverse(s.begin(), s.end());
		return s;
	};
	auto compare=[&](pii l,pii r)->bool{
		if(l.se!=r.se){
			return l.se>r.se;
		}
		string sl=bintostr(l.fi);
		string sr=bintostr(r.fi);
		// while(sz(sl)<sz(sr)){
		// 	sl.pb('0');
		// }
		// while(sz(sr)<sz(sl)){
		// 	sr.pb('0');
		// }
		return sl>sr;
	};
	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]={ma,sz(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];
		cntr[v]=ul;
		if(compare(rbe[ur],rbe[ul])){
			cntr[v]=ur;
		}
		rbe[cntr[v]].se+=1;
	};
	dfs(dfs,0);
	pii p=rbe[cntr[0]];
	string tmp=bintostr(p.fi);
	cout<<tmp;
	rep(_,p.se-sz(tmp)){
		cout<<"0";
	}
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 1816 KB Output is correct
12 Correct 9 ms 1720 KB Output is correct
13 Correct 36 ms 7960 KB Output is correct
14 Correct 73 ms 15856 KB Output is correct
15 Correct 74 ms 6932 KB Output is correct
16 Correct 264 ms 44300 KB Output is correct
17 Correct 531 ms 97368 KB Output is correct
18 Correct 562 ms 105356 KB Output is correct
19 Correct 742 ms 97528 KB Output is correct
20 Correct 701 ms 239996 KB Output is correct