181952025-10-13 09:18:35birozsKert (75 pont)python3Time limit exceeded 63/75518ms32000 KiB
from sys import stdin
from collections import defaultdict
M, N, P = [int(x) for x in stdin.readline().split()]
T = []
for i in range(M):
    sor = [int(x) for x in stdin.readline().split()]
    T.append(sor)
tobbseg = 0
for i in range(M):
    V = {}
    for j in range(N):
        if T[i][j] not in V:
            V[T[i][j]] = 1
        else:
            V[T[i][j]] += 1
    maxdb = max(V.values())
    if maxdb > N - maxdb:
        tobbseg += 1
print(tobbseg)
maxhossz = 0
for i in range(M):
    hossz = 1
    for j in range(N-1):
        if T[i][j] == T[i][j+1]:
            hossz += 1
        else:
            if hossz > maxhossz:
                maxhossz = hossz
            hossz = 1
    if hossz > maxhossz:
        maxhossz = hossz
print(maxhossz)
SubtaskSumTestVerdictTimeMemory
base63/75
1Accepted0/019ms3800 KiB
2Time limit exceeded0/0518ms24452 KiB
3Accepted4/419ms3572 KiB
4Accepted4/419ms3608 KiB
5Accepted4/418ms3504 KiB
6Accepted4/418ms3384 KiB
7Accepted4/418ms3380 KiB
8Accepted4/419ms3568 KiB
9Accepted4/418ms3372 KiB
10Accepted4/428ms3896 KiB
11Accepted6/619ms3636 KiB
12Accepted6/637ms4444 KiB
13Accepted6/675ms6064 KiB
14Accepted6/6476ms23860 KiB
15Runtime error0/6157ms32000 KiB
16Time limit exceeded0/6518ms24128 KiB
17Accepted7/7252ms14140 KiB