Submission #1163233


Source Code Expand

import copy

def traverse(N,A,mm):
	m=copy.deepcopy(mm)
	t=[]
	rp=[]
	c=[]
	for i in range(N+1):
		t.extend([0])
		rp.extend([0])
		c.extend([[0]])
	
	start=1
	for i in range(start,N+1):
		#if len(m[i])==1 and A[i]>0:
		if A[i]>0:
			root=i
			break
	
	eerror=False
	if len(m[root]) in [0,1]:
		t[root]=A[root]
	else:
		t[root]=2*A[root]
	
	
	while not(i==root and len(m[i])==0):
		#print(i,t[i],m[i],rp[i])
		
		if len(m[i])==0:
			#print('back')
			c[i][0]=t[i]
			r=i
			i=rp[i]
			#print(i,t[i],m[i],rp[i])
			t[i]-=t[r]
			c[i].extend([t[r]])
			#print('minus')
			#print(c)
			if t[i]<0:
				return(False)
				#eerror=True
				#break
		else:
			#print('forward')
			r=i
			i=m[i].pop()
			if rp[i]==0:
				rp[i]=r
			#print(i,t[i],m[i],rp[i])	
			if len(m[i]) in [0,1]:
				t[i]=A[i]
			else:
				t[i]=2*A[i]
			#print('plus')
			#print(i,t[i],m[i],rp[i])
			if r in m[i]:
				m[i].remove(r)
				#print('remove')
		
	
	for cc in c[1:]:
		cc_max=cc.index(max(cc))
		if len(cc)>2 and cc[cc_max]>sum([cc[i] for i in range(len(cc)) if i!=cc_max]):
			return(False)
			
	if t[root]==0 and eerror==False:
		return(True)
	else:
		return(False)
		
		
N= int(input())
A=[0]
for x in input().split():
	A.extend([int(x)])

m=[]

for i in range(N+1):
	m.extend([[]])

for i in range(N-1):
	l=[int(xx) for xx in input().split()]
	#l=[int(xx) for xx in L.pop()]
	if 0<l[0]<=N and 0<l[1]<=N:
		m[l[0]]+=[l[1]]
		m[l[1]]+=[l[0]]

		
if traverse(N,A,m):
	print('YES')
else:
	print('NO')
	

Submission Info

Submission Time
Task C - Cleaning
User Pgmto70
Language Python (3.4.3)
Score 0
Code Size 1571 Byte
Status RE
Exec Time 1270 ms
Memory 55940 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 49
RE × 2
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in4.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
in1.txt AC 1241 ms 53860 KB
in10.txt AC 1237 ms 53768 KB
in11.txt AC 1211 ms 55800 KB
in12.txt AC 1229 ms 55940 KB
in13.txt RE 979 ms 47748 KB
in14.txt RE 1006 ms 47516 KB
in15.txt AC 22 ms 3444 KB
in16.txt AC 22 ms 3444 KB
in17.txt AC 22 ms 3444 KB
in18.txt AC 22 ms 3444 KB
in19.txt AC 1225 ms 54000 KB
in2.txt AC 1252 ms 53856 KB
in20.txt AC 1179 ms 52740 KB
in21.txt AC 1160 ms 52496 KB
in22.txt AC 1206 ms 53140 KB
in23.txt AC 1249 ms 52488 KB
in24.txt AC 1171 ms 52956 KB
in25.txt AC 22 ms 3444 KB
in26.txt AC 1009 ms 51104 KB
in27.txt AC 1008 ms 51356 KB
in28.txt AC 22 ms 3444 KB
in29.txt AC 1018 ms 48456 KB
in3.txt AC 1226 ms 53152 KB
in30.txt AC 22 ms 3444 KB
in31.txt AC 1164 ms 52584 KB
in32.txt AC 1191 ms 53488 KB
in33.txt AC 1243 ms 53260 KB
in34.txt AC 1243 ms 53612 KB
in35.txt AC 1239 ms 52480 KB
in36.txt AC 1238 ms 54024 KB
in37.txt AC 31 ms 3948 KB
in38.txt AC 1053 ms 52220 KB
in39.txt AC 1049 ms 51056 KB
in4.txt AC 1270 ms 52580 KB
in40.txt AC 1156 ms 53608 KB
in41.txt AC 1120 ms 52448 KB
in42.txt AC 1247 ms 53872 KB
in43.txt AC 1183 ms 52600 KB
in44.txt AC 1185 ms 54020 KB
in45.txt AC 1254 ms 53604 KB
in5.txt AC 1267 ms 53996 KB
in6.txt AC 1247 ms 52580 KB
in7.txt AC 1087 ms 47736 KB
in8.txt AC 273 ms 15096 KB
in9.txt AC 1228 ms 52592 KB
sample1.txt AC 22 ms 3444 KB
sample2.txt AC 22 ms 3444 KB
sample3.txt AC 22 ms 3444 KB