Submission #15,342

2025-02-18 22:37:44

python3

Accepted 75/75

245ms

4680 KiB

from sys import stdin
input=stdin.readline

def solv():
 N=int(input())
 d=[0]*(N+1)
 for i in range(N-1):
  u,v=map(int,input().split())
  d[u]+=1
  d[v]+=1
 x=y=0
 for i in range(1,N+1):
  y=max(y,d[i])
  if d[i]>2:
   x+=d[i]-2
 print(x,N-1-y)

solv()

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	16ms	2932 KiB
		2	Accepted	0/0	16ms	2868 KiB
		3	Accepted	0/0	27ms	3104 KiB
		4	Accepted	4/4	16ms	3052 KiB
		5	Accepted	4/4	16ms	3092 KiB
		6	Accepted	4/4	16ms	2868 KiB
		7	Accepted	4/4	16ms	3124 KiB
		8	Accepted	4/4	16ms	2976 KiB
		9	Accepted	4/4	16ms	3124 KiB
		10	Accepted	4/4	226ms	4672 KiB
		11	Accepted	4/4	234ms	4440 KiB
		12	Accepted	4/4	245ms	4660 KiB
		13	Accepted	4/4	240ms	4668 KiB
		14	Accepted	4/4	232ms	4660 KiB
		15	Accepted	4/4	240ms	4660 KiB
		16	Accepted	4/4	238ms	4488 KiB
		17	Accepted	4/4	239ms	4676 KiB
		18	Accepted	5/5	238ms	4672 KiB
		19	Accepted	6/6	232ms	4660 KiB
		20	Accepted	6/6	230ms	4680 KiB
		21	Accepted	2/2	14ms	3124 KiB