Submission #13,416

2025-01-07 21:17:52

python3

Accepted 50/50

224ms

21112 KiB

from sys import stdin
input=stdin.readline

def solv():
 N=int(input())
 G=[[] for i in range(N+1)]
 fiuk=set()
 for i in range(N-1):
  apa,fia = map(int,input().split())
  fiuk.add(fia)
  G[apa].append(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 len(G[v])==0: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	50/50
		1	Accepted	0/0	16ms	3132 KiB
		2	Accepted	0/0	206ms	19600 KiB
		3	Accepted	1/1	14ms	3124 KiB
		4	Accepted	3/3	16ms	3164 KiB
		5	Accepted	3/3	16ms	3016 KiB
		6	Accepted	1/1	14ms	3136 KiB
		7	Accepted	1/1	16ms	3072 KiB
		8	Accepted	1/1	17ms	3124 KiB
		9	Accepted	2/2	180ms	20112 KiB
		10	Accepted	3/3	181ms	20112 KiB
		11	Accepted	3/3	17ms	3208 KiB
		12	Accepted	4/4	223ms	20624 KiB
		13	Accepted	4/4	224ms	20624 KiB
		14	Accepted	3/3	28ms	4784 KiB
		15	Accepted	3/3	177ms	20368 KiB
		16	Accepted	3/3	179ms	19824 KiB
		17	Accepted	3/3	215ms	20112 KiB
		18	Accepted	4/4	152ms	13936 KiB
		19	Accepted	4/4	166ms	19500 KiB
		20	Accepted	4/4	210ms	21112 KiB