Submission #18,173

2025-10-09 15:20:22

python3

Accepted 80/80

39ms

3680 KiB

N,M = map(int,input().split())
Apja = [0] * (N+1)
for i in range(M):
    A,F = map(int,input().split())
    Apja[F] = A
dedi = [0] * (N+1)
for i in range(1,N+1):
    if Apja[i] != 0 and Apja[Apja[i]] != 0:
        dedi[Apja[Apja[i]]] += 1
if sum(dedi) == 0:
    print(-1)
else:
    print(dedi.index(max(dedi)),max(dedi))

	Sum	Test	Verdict		Time	Memory
base	80/80
		1	Accepted	0/0	16ms	3032 KiB
		2	Accepted	0/0	28ms	3380 KiB
		3	Accepted	4/4	16ms	3316 KiB
		4	Accepted	4/4	16ms	3124 KiB
		5	Accepted	4/4	37ms	3632 KiB
		6	Accepted	4/4	39ms	3640 KiB
		7	Accepted	4/4	16ms	3148 KiB
		8	Accepted	4/4	17ms	3124 KiB
		9	Accepted	4/4	27ms	3336 KiB
		10	Accepted	4/4	39ms	3636 KiB
		11	Accepted	4/4	39ms	3648 KiB
		12	Accepted	4/4	27ms	3172 KiB
		13	Accepted	4/4	39ms	3588 KiB
		14	Accepted	4/4	39ms	3628 KiB
		15	Accepted	4/4	37ms	3544 KiB
		16	Accepted	4/4	39ms	3632 KiB
		17	Accepted	4/4	39ms	3636 KiB
		18	Accepted	4/4	37ms	3680 KiB
		19	Accepted	2/2	17ms	3180 KiB
		20	Accepted	2/2	17ms	3124 KiB
		21	Accepted	3/3	17ms	3092 KiB
		22	Accepted	3/3	19ms	3136 KiB
		23	Accepted	3/3	37ms	3636 KiB
		24	Accepted	3/3	37ms	3624 KiB