254782026-02-20 11:46:51MangoKert (75 pont)python3Time limit exceeded 28/75601ms27616 KiB
a = input().split()
sorsz,sorh,szinek = int(a[0]),int(a[1]),int(a[2])


virags = []
tobblet = 0
tomb = {}


legh = 1

for i in range(sorsz):
    vantobblet = False
    tomb = {}
    mosth = 0
    sor = input().split()
    sor = [0] + sor
    virags.append(sor)
    for f in range(1,sorh+1):
        virags[i][f] = int(virags[i][f])
        if virags[i][f] not in tomb:
            tomb[virags[i][f]] = 0
        tomb[virags[i][f]] += 1
        if virags[i][f] == virags[i][f-1]:
            mosth += 1
        elif mosth > legh:
            legh = mosth
        if tomb[virags[i][f]] > sorh / 2:
            vantobblet = True
    if vantobblet:
        tobblet += 1

print(tobblet, legh, sep="\n")
SubtaskSumTestVerdictTimeMemory
base28/75
1Accepted0/016ms3368 KiB
2Time limit exceeded0/0593ms21928 KiB
3Partially correct2/416ms3304 KiB
4Partially correct2/416ms3116 KiB
5Partially correct2/417ms3092 KiB
6Partially correct2/416ms3124 KiB
7Partially correct2/417ms3196 KiB
8Partially correct2/417ms3376 KiB
9Partially correct2/417ms3144 KiB
10Partially correct2/429ms3632 KiB
11Partially correct3/618ms3228 KiB
12Partially correct3/643ms4052 KiB
13Partially correct3/697ms5680 KiB
14Time limit exceeded0/6601ms21812 KiB
15Time limit exceeded0/6601ms27616 KiB
16Time limit exceeded0/6583ms21340 KiB
17Partially correct3/7352ms13468 KiB