Submission #13,413

2025-01-07 21:06:05

python3

Time limit exceeded 46/50

326ms

27896 KiB

from sys import stdin
input=stdin.readline

def solv():
 N=int(input())
 G={}
 fiuk=set()
 for i in range(N-1):
  apa,fia = [int(x) for x in 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	2976 KiB
		2	Accepted	0/0	261ms	19584 KiB
		3	Accepted	1/1	17ms	2968 KiB
		4	Accepted	3/3	17ms	2972 KiB
		5	Accepted	3/3	16ms	2992 KiB
		6	Accepted	1/1	16ms	3124 KiB
		7	Accepted	1/1	16ms	3044 KiB
		8	Accepted	1/1	17ms	3316 KiB
		9	Accepted	2/2	266ms	19920 KiB
		10	Accepted	3/3	233ms	19880 KiB
		11	Accepted	3/3	16ms	3124 KiB
		12	Accepted	4/4	266ms	21104 KiB
		13	Accepted	4/4	268ms	21100 KiB
		14	Accepted	3/3	35ms	4724 KiB
		15	Accepted	3/3	298ms	22128 KiB
		16	Accepted	3/3	257ms	21612 KiB
		17	Accepted	3/3	287ms	21088 KiB
		18	Accepted	4/4	195ms	16496 KiB
		19	Accepted	4/4	241ms	21360 KiB
		20	Time limit exceeded	0/4	326ms	27896 KiB