Submission #634497

# Submission time Handle Problem Language Result Execution time Memory
634497 2022-08-24T13:28:29 Z inksamurai Poklon (COCI17_poklon7) C++17
0 / 120
429 ms 262144 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

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{
		if(v==0) return "0";
		string s="";
		while(v>0){
			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]=string(30,'1');
		// 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]]);
}

Compilation message

poklon.cpp: In function 'int main()':
poklon.cpp:31:7: warning: variable 'bintostr' set but not used [-Wunused-but-set-variable]
   31 |  auto bintostr=[&](int v)->string{
      |       ^~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Incorrect 4 ms 2132 KB Output isn't correct
12 Incorrect 8 ms 2276 KB Output isn't correct
13 Incorrect 21 ms 10100 KB Output isn't correct
14 Incorrect 51 ms 20008 KB Output isn't correct
15 Incorrect 42 ms 12608 KB Output isn't correct
16 Incorrect 185 ms 60176 KB Output isn't correct
17 Incorrect 314 ms 135564 KB Output isn't correct
18 Incorrect 342 ms 142748 KB Output isn't correct
19 Incorrect 427 ms 150312 KB Output isn't correct
20 Runtime error 429 ms 262144 KB Execution killed with signal 9