198312025-12-25 09:39:20birozsDinamitpython3Wrong answer 8/5017ms3372 KiB
N,M,K = map(int,input().split())
T = []
for _ in range(N):
    sor = list(map(int,input().split()))
    T.append(sor)
#Q[i][j] a minimális érték a bal felső saroktól az adott pontig
Q = []
sor = [0] * M
for _ in range(N):
    Q.append(sor)

#Q első sorának j-edik eleme az első j szám összege
Q[0][0] = T[0][0]
for j in range(1,M):
    Q[0][j] = Q[0][j-1] + T[0][j]
#Q első oszlopának i-edik eleme az első i szám összege
for i in range(1,N):
    Q[i][0] = Q[i-1][0] + T[i][0]

if K == 0:
    for i in range(1,N):
        for j in range(1,M):
            if Q[i][j-1] < Q[i-1][j]:
                Q[i][j] = Q[i][j-1] + T[i][j]
            else:
                Q[i][j] = Q[i-1][j] + T[i][j]
    print(Q[N-1][M-1])
else:
    print(0)
SubtaskSumTestVerdictTimeMemory
base8/50
1Wrong answer0/016ms2972 KiB
2Wrong answer0/017ms3120 KiB
3Wrong answer0/217ms3120 KiB
4Accepted2/217ms3116 KiB
5Accepted3/317ms3256 KiB
6Accepted3/317ms3120 KiB
7Wrong answer0/217ms3276 KiB
8Wrong answer0/317ms3208 KiB
9Wrong answer0/216ms3128 KiB
10Wrong answer0/217ms3136 KiB
11Wrong answer0/316ms3136 KiB
12Wrong answer0/316ms3372 KiB
13Wrong answer0/216ms3152 KiB
14Wrong answer0/316ms2956 KiB
15Wrong answer0/216ms3100 KiB
16Wrong answer0/316ms3240 KiB
17Wrong answer0/216ms3148 KiB
18Wrong answer0/316ms3124 KiB
19Wrong answer0/217ms3212 KiB
20Wrong answer0/317ms3200 KiB
21Wrong answer0/217ms3144 KiB
22Wrong answer0/317ms3124 KiB