Submission #25,693

2026-02-25 15:48:13

python3

Accepted 80/80

41ms

4540 KiB

def main():
    sor=input()
    darabok=sor.split(' ')
    emberek=int(darabok[0])
    kapcsolatok=int(darabok[1])
    csaladfa=[]
    unokak=[]
    for i in range(emberek+1):
        csaladfa.append([])
    for i in range(kapcsolatok):
        sor=input()
        darabok = sor.split(' ')
        apa=int(darabok[0])
        fia=int(darabok[1])
        csaladfa[apa].append(fia)
    for i in range(emberek+1):
        unokak.append(0)
    for i in range(1, emberek+1):
        for j in range(len(csaladfa[i])):
            gyerek=csaladfa[i][j]
            unokak[i]+=len(csaladfa[gyerek])
    legnagyobb = max(unokak)
    legnagyobb_sorszam = unokak.index(max(unokak))
    if legnagyobb==0:
        print(-1)
    else:
        print(legnagyobb_sorszam, legnagyobb)
if __name__ == '__main__':
    main()

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	17ms	2956 KiB
		2	Accepted	0/0	29ms	4072 KiB
		3	Accepted	4/4	17ms	3156 KiB
		4	Accepted	4/4	17ms	2980 KiB
		5	Accepted	4/4	41ms	4404 KiB
		6	Accepted	4/4	39ms	4288 KiB
		7	Accepted	4/4	17ms	3124 KiB
		8	Accepted	4/4	16ms	3164 KiB
		9	Accepted	4/4	28ms	3588 KiB
		10	Accepted	4/4	39ms	4444 KiB
		11	Accepted	4/4	41ms	4392 KiB
		12	Accepted	4/4	28ms	3636 KiB
		13	Accepted	4/4	39ms	4456 KiB
		14	Accepted	4/4	41ms	4348 KiB
		15	Accepted	4/4	39ms	4308 KiB
		16	Accepted	4/4	39ms	4232 KiB
		17	Accepted	4/4	39ms	4400 KiB
		18	Accepted	4/4	41ms	4296 KiB
		19	Accepted	2/2	21ms	3928 KiB
		20	Accepted	2/2	19ms	3948 KiB
		21	Accepted	3/3	20ms	3896 KiB
		22	Accepted	3/3	24ms	4012 KiB
		23	Accepted	3/3	39ms	4540 KiB
		24	Accepted	3/3	41ms	4404 KiB