Submission #18,197

2025-10-13 10:30:00

python3

Accepted 75/75

421ms

19160 KiB

M, N, P = map(int,input().split())
maxhossz = 0
tobbseg = 0
for _ in range(M):
    sor = list(map(int,input().split()))
    V = {}
    for virag in sor:
        if virag not in V:
            V[virag] = 1
        else:
            V[virag] += 1
    maxdb = max(V.values())
    if maxdb > N - maxdb:
        tobbseg += 1
    hossz = 1
    for j in range(N-1):
        if sor[j] == sor[j+1]:
            hossz += 1
        else:
            if hossz > maxhossz:
                maxhossz = hossz
            hossz = 1
    if hossz > maxhossz:
        maxhossz = hossz
print(tobbseg)
print(maxhossz)

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	16ms	3324 KiB
		2	Accepted	0/0	375ms	5612 KiB
		3	Accepted	4/4	16ms	3120 KiB
		4	Accepted	4/4	16ms	3072 KiB
		5	Accepted	4/4	16ms	3008 KiB
		6	Accepted	4/4	17ms	3128 KiB
		7	Accepted	4/4	16ms	3124 KiB
		8	Accepted	4/4	16ms	3140 KiB
		9	Accepted	4/4	17ms	3124 KiB
		10	Accepted	4/4	23ms	3380 KiB
		11	Accepted	6/6	17ms	3124 KiB
		12	Accepted	6/6	30ms	3392 KiB
		13	Accepted	6/6	61ms	3636 KiB
		14	Accepted	6/6	372ms	4120 KiB
		15	Accepted	6/6	388ms	19160 KiB
		16	Accepted	6/6	421ms	5680 KiB
		17	Accepted	7/7	194ms	4324 KiB