181942025-10-13 09:09:40birozsKert (75 pont)python3Time limit exceeded 69/75515ms30804 KiB
M,N,P = map(int,input().split())
T = []
for i in range(M):
    sor = list(map(int,input().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
base69/75
1Accepted0/016ms3172 KiB
2Time limit exceeded0/0503ms23796 KiB
3Accepted4/416ms3320 KiB
4Accepted4/416ms3124 KiB
5Accepted4/416ms3312 KiB
6Accepted4/416ms3120 KiB
7Accepted4/416ms3380 KiB
8Accepted4/417ms3212 KiB
9Accepted4/416ms3028 KiB
10Accepted4/425ms3552 KiB
11Accepted6/617ms3124 KiB
12Accepted6/634ms4148 KiB
13Accepted6/671ms5884 KiB
14Accepted6/6467ms23472 KiB
15Accepted6/6486ms30804 KiB
16Time limit exceeded0/6515ms23928 KiB
17Accepted7/7246ms13796 KiB