Submission #13,415

2025-01-07 21:09:35

python3

Time limit exceeded 46/50

337ms

28012 KiB

from sys import stdin
input=stdin.readline

def solv():
 N=int(input())
 G={}
 fiuk=set()
 for i in range(N-1):
  apa,fia = map(int,input().split())
  fiuk.add(fia)
  try:G[apa].append(fia)
  except:G[apa]=[fia]
 king=-1
 for i in range(1,N+1):
  if i not in fiuk:
   king=i
   break
 cur=[king]
 while cur:
  tmp=[]
  for v in cur:
   if v not in G:continue
   for w in G[v]:
    tmp.append(w)
  if len(tmp) == 0:
   print(cur[0])
   return
  cur=tmp
    
solv()

	Sum	Test	Verdict		Time	Memory
base	46/50
		1	Accepted	0/0	16ms	3116 KiB
		2	Accepted	0/0	218ms	19568 KiB
		3	Accepted	1/1	16ms	3128 KiB
		4	Accepted	3/3	16ms	3048 KiB
		5	Accepted	3/3	17ms	3124 KiB
		6	Accepted	1/1	14ms	3020 KiB
		7	Accepted	1/1	16ms	3124 KiB
		8	Accepted	1/1	17ms	3176 KiB
		9	Accepted	2/2	203ms	19884 KiB
		10	Accepted	3/3	233ms	19928 KiB
		11	Accepted	3/3	16ms	3124 KiB
		12	Accepted	4/4	236ms	21108 KiB
		13	Accepted	4/4	237ms	21108 KiB
		14	Accepted	3/3	34ms	4824 KiB
		15	Accepted	3/3	277ms	22132 KiB
		16	Accepted	3/3	264ms	21620 KiB
		17	Accepted	3/3	222ms	21108 KiB
		18	Accepted	4/4	166ms	16500 KiB
		19	Accepted	4/4	241ms	21364 KiB
		20	Time limit exceeded	0/4	337ms	28012 KiB