256912026-02-25 15:44:02Peca2Legtöbb unoka (80 pont)python3Wrong answer 60/8041ms4512 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))
    print(legnagyobb_sorszam, legnagyobb)
if __name__ == '__main__':
    main()
SubtaskSumTestVerdictTimeMemory
base60/80
1Accepted0/016ms3312 KiB
2Accepted0/030ms4148 KiB
3Wrong answer0/417ms3124 KiB
4Wrong answer0/416ms3124 KiB
5Accepted4/441ms4392 KiB
6Accepted4/441ms4416 KiB
7Wrong answer0/417ms3124 KiB
8Wrong answer0/414ms2920 KiB
9Accepted4/427ms3728 KiB
10Accepted4/439ms4404 KiB
11Accepted4/439ms4272 KiB
12Accepted4/428ms3636 KiB
13Accepted4/439ms4400 KiB
14Accepted4/439ms4404 KiB
15Accepted4/439ms4404 KiB
16Accepted4/439ms4204 KiB
17Accepted4/439ms4512 KiB
18Accepted4/439ms4444 KiB
19Wrong answer0/220ms3892 KiB
20Wrong answer0/220ms3892 KiB
21Accepted3/319ms3892 KiB
22Accepted3/323ms3976 KiB
23Accepted3/339ms4404 KiB
24Accepted3/337ms4356 KiB