Problem:


Score : 500 points

Problem Statement

There are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \leq i \leq R) and the j-th column (1 \leq j \leq C). The i-th item is at (r_i, c_i) and has the value v_i.

Takahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).

He can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.

Find the maximum possible sum of the values of items he picks up.

Constraints

1 \leq R, C \leq 3000

1 \leq K \leq \min(2 \times 10^5, R \times C)

1 \leq r_i \leq R

1 \leq c_i \leq C

(r_i, c_i) \neq (r_j, c_j) (i \neq j)

1 \leq v_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

R C K
r_1 c_1 v_1
r_2 c_2 v_2
:
r_K c_K v_K

Output

Print the maximum possible sum of the values of items Takahashi picks up.

Sample Input 1

2 2 3
1 1 3
2 1 4
1 2 5

Sample Output 1

8

He has two ways to get to the goal:

Visit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.

Visit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.

Thus, the maximum possible sum of the values of items he picks up is 8.

Sample Input 2

2 5 5
1 1 3
2 4 20
1 2 1
1 3 4
1 4 2

Sample Output 2

29

We have four items in the 1-st row. The optimal choices are as follows:

Visit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.

Sample Input 3

4 5 10
2 5 12
1 5 12
2 3 15
1 2 20
1 1 28
2 4 26
3 2 27
4 5 21
3 5 10
1 3 10

Sample Output 3

142



Sample input:
2 2 3
1 1 3
2 1 4
1 2 5


Sample output:
8

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3


def next_line():
    return input()


def next_int():
    return int(input())


def next_int_array_one_line():
    return list(map(int, input().split()))


def next_int_array_multi_lines(size):
    return [int(input()) for _ in range(size)]


def next_str_array(size):
    return [input() for _ in range(size)]


def main():
    r, c, k = map(int, input().split())
    v = [[0 for _ in range(c + 1)] for _ in range(r + 1)]
    for i in range(k):
        row, col, val = map(int, input().split())
        v[row][col] = val

    dp = [[[0 for num in range(4)] for _ in range(c + 1)]
          for _ in range(r + 1)]
    for row in range(1, r + 1):
        for col in range(1, c + 1):
            for num in range(0, 4):
                if num == 0:
                    dp[row][col][num] = max(dp[row-1][col][3],  # down
                                            dp[row][col-1][num],  # right
                                            )
                else:
                    dp[row][col][num] = max(dp[row][col][num-1],  # str
                                            dp[row-1][col][3],  # down x
                                            dp[row][col-1][num],  # right x
                                            dp[row-1][col][3] + \
                                            v[row][col],  # down o
                                            dp[row][col-1][num-1] + \
                                            v[row][col],  # right o
                                            )
    # print(v)
    # print(dp)
    print(dp[r][c][3])


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


def main():
    R, C, N = map(int, input().split())
    a = [[0] * 3001 for _ in range(3001)]
    dp = [[[0] * 4 for i in range(3001)] for j in range(3001)]

    for i in range(N):
        r, c, v = map(int, input().split())
        a[r - 1][c - 1] = v

    """
    dp[i][j][k] := (i,j)にいるときの最大価値。その行ですでにk個選んだとき
    """

    for i in range(R):
        for j in range(C):
            for k in range(2, -1, -1):
                # アイテムを拾う遷移を最初にやる
                dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k] + a[i][j])
            for k in range(4):
                # 移動の遷移
                dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k])
                dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k])

    ans = 0
    for k in range(4):
        ans = max(ans, dp[R - 1][C - 1][k])
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


def main():
    R, C, N = map(int, input().split())
    a = [[0] * 3005 for _ in range(3005)]
    dp = [[[0] * 4 for i in range(3005)] for j in range(3005)]

    for i in range(N):
        r, c, v = map(int, input().split())
        a[r - 1][c - 1] = v

    """
    dp[i][j][k] := (i,j)にいるときの最大価値。その行ですでにk個選んだとき
    """

    for i in range(R):
        for j in range(C):
            for k in range(2, -1, -1):
                # アイテムを拾う遷移を最初にやる
                dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k] + a[i][j])
            for k in range(4):
                # 移動の遷移
                dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k])
                dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k])

    ans = 0
    for k in range(4):
        ans = max(ans, dp[R - 1][C - 1][k])
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
[R, C, K] = list(map(int, input().split()))
G = [[0]*(C+1) for i in range(R+1)]
for i in range(K):
    [r, c, v] = list(map(int, input().split()))
    G[r-1][c-1] = v

dp = [[[-1]*4 for i in range(C+1)] for j in range(R+1)]
dp[0][0][0] = 0
if G[0][0] != None: dp[0][0][1] = G[0][0]

for r in range(R):
    for c in range(C):
        for k in range(4):
            if dp[r][c][k] == -1: continue

            if k < 3: # can go right and pick up
                if dp[r][c+1][k+1] < dp[r][c][k] + G[r][c+1]:
                    dp[r][c+1][k+1] = dp[r][c][k] + G[r][c+1]
            if dp[r][c+1][k] < dp[r][c][k]:
                    dp[r][c+1][k] = dp[r][c][k]
            if dp[r+1][c][0] < dp[r][c][k]:
                dp[r+1][c][0] = dp[r][c][k]
            if dp[r+1][c][1] < dp[r][c][k] + G[r+1][c]:
                dp[r+1][c][1] = dp[r][c][k] + G[r+1][c]

print(max(dp[r][c]))

Submission status: Time Limit Exceeded

Solution code:
[R, C, K] = list(map(int, input().split()))
G = [[None]*C for i in range(R)]
for i in range(K):
    [r, c, v] = list(map(int, input().split()))
    G[r-1][c-1] = v

dp = [[[-1]*4 for i in range(C)] for j in range(R)]
dp[0][0][0] = 0
if G[0][0] != None: dp[0][0][1] = G[0][0]

for r in range(R):
    for c in range(C):
        for k in range(4):
            if dp[r][c][k] == -1: continue

            if c+1<C and G[r][c+1] != None and k < 3: # can go right and pick up
                if dp[r][c+1][k+1] < dp[r][c][k] + G[r][c+1]:
                    dp[r][c+1][k+1] = dp[r][c][k] + G[r][c+1]
            if c+1<C: # moving right without picking up
                if dp[r][c+1][k] < dp[r][c][k]:
                    dp[r][c+1][k] = dp[r][c][k]
            if r+1<R: # moving downward without picking up
                if dp[r+1][c][0] < dp[r][c][k]:
                    dp[r+1][c][0] = dp[r][c][k]
            if r+1<R and G[r+1][c] != None: # can go down and pick up
                if dp[r+1][c][1] < dp[r][c][k] + G[r+1][c]:
                    dp[r+1][c][1] = dp[r][c][k] + G[r+1][c]

print(max(dp[r][c]))

Submission status: Time Limit Exceeded

Solution code:
def main():
    R, C, K = list(map(int, input().split()))
    # dp[r][c][n]: r行目でn個のアイテムを拾う場合の(r, c)でのアイテムの価値の合計の最大
    dp = [[[0 for _ in range(4)] for _ in range(C)] for _ in range(R)]
    V = [[0 for _ in range(C)] for _ in range(R)]
    for _ in range(K):
        r, c, v = list(map(int, input().split()))
        V[r - 1][c - 1] = v
    dp[0][0][1] = V[0][0]
    for r in range(R):
        for c in range(C):
            if r == c == 0:
                continue
            v_rc = V[r][c]
            max_dp_before_row = 0 if r == 0 else max(dp[r - 1][c])
            # dp[r][c][0]
            v1 = 0 if c == 0 else dp[r][c - 1][0]
            dp[r][c][0] = max(v1, max_dp_before_row)
            # dp[r][c][1]
            v1 = 0 if c == 0 else max(dp[r][c - 1][1], dp[r][c - 1][0] + v_rc)
            v2 = 0 if r == 0 else (max_dp_before_row + v_rc)
            dp[r][c][1] = max(v1, v2)
            # dp[r][c][2], dp[r][c][3]
            for n in range(2, 4):
                dp[r][c][n] = 0 if c == 0 else max(dp[r][c - 1][n], dp[r][c - 1][n - 1] + v_rc)
    print(max(dp[R-1][C-1]))


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
[R, C, K] = list(map(int, input().split()))
G = [[None]*C for i in range(R)]
for i in range(K):
    [r, c, v] = list(map(int, input().split()))
    G[r-1][c-1] = v

dp = [[[-1]*4 for i in range(C)] for j in range(R)]
dp[0][0][0] = 0
if G[0][0] != None:
    dp[0][0][1] = G[0][0]

for r in range(R):
    for c in range(C):
        for k in range(4):
            if dp[r][c][k] == -1: continue

            if c+1<C and G[r][c+1] != None and k < 3: # can go right and pick up
                dp[r][c+1][k+1] = max(dp[r][c+1][k+1], dp[r][c][k] + G[r][c+1])
            if c+1<C: # moving right without picking up
                dp[r][c+1][k] = max(dp[r][c+1][k], dp[r][c][k])
            if r+1<R: # moving downward without picking up
                dp[r+1][c][0] = max(dp[r+1][c][0], dp[r][c][k])
            if r+1<R and G[r+1][c] != None: # can go right and pick up
                dp[r+1][c][1] = max(dp[r+1][c][1], dp[r][c][k] + G[r+1][c])

print(max(dp[r][c]))

Submission status: Time Limit Exceeded

Solution code:
[R, C, K] = list(map(int, input().split()))
G = [[None]*C for i in range(R)]
for i in range(K):
    [r, c, v] = list(map(int, input().split()))
    G[r-1][c-1] = v

dp = [[[0]*4 for i in range(C)] for j in range(R)]
path = [[[False]*4 for i in range(C)] for j in range(R)]
dp[0][0][0] = 0
path[0][0][0] = True
if G[0][0] != None:
    dp[0][0][1] = G[0][0]
    path[0][0][1] = True

for r in range(R):
    for c in range(C):
        for k in range(4):
            if path[r][c][k] == False: continue

            if c+1<C and G[r][c+1] != None and k < 3: # can go right and pick up
                dp[r][c+1][k+1] = max(dp[r][c+1][k+1], dp[r][c][k] + G[r][c+1])
                path[r][c+1][k+1] = True
            if c+1<C: # moving right without picking up
                dp[r][c+1][k] = max(dp[r][c+1][k], dp[r][c][k])
                path[r][c+1][k] = True
            if r+1<R: # moving downward without picking up
                dp[r+1][c][0] = max(dp[r+1][c][0], dp[r][c][k])
                path[r+1][c][0] = True
            if r+1<R and G[r+1][c] != None: # can go right and pick up
                dp[r+1][c][1] = max(dp[r+1][c][1], dp[r][c][k] + G[r+1][c])
                path[r+1][c][1] = True

print(max(dp[r][c]))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
f=lambda:map(int,input().split())
R,C,K=f()
g=np.zeros((R+1,C+1),int)
for _ in range(K):
  r,c,v=f()
  g[r][c]=v
dp=np.zeros((R+2,C+2,4),int)
for i in range(1,R+1):
  for j in range(1,C+1):
    for k in range(3,-1,-1):
      if k: dp[i][j][k]=max(dp[i][j][k],dp[i][j][k-1]+g[i][j])
      dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k])
      dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k])
print(max(dp[R][C]))

Submission status: Time Limit Exceeded

Solution code:
import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())

import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# map(int, input().split())
R, C, K = map(int, input().split())
MAXR = R + 5
MAXC = C + 5
A = [[0] * C for _ in range(R)]
dp = [[[0] * 4 for _ in range(MAXC)] for _ in range(MAXR)]
for i in range(K):
    r, c, v = map(int, input().split())
    A[r - 1][c - 1] = v

for i in range(R):
    for j in range(C):
        for k in range(2, -1, -1):
            dp[i][j][k + 1] = max(dp[i][j][k + 1], dp[i][j][k] + A[i][j])
        for k in range(4):
            dp[i + 1][j][0] = max(dp[i + 1][j][0], dp[i][j][k])
            dp[i][j + 1][k] = max(dp[i][j + 1][k], dp[i][j][k])
print(max(dp[R - 1][C - 1]))

Submission status: Time Limit Exceeded

Solution code:
def e_picking_goods():
    R, C, K = [int(i) for i in input().split()]
    Goods = [[0] * (C + 1) for _ in range(R + 1)]
    for _ in range(K):
        r, c, v = [int(i) for i in input().split()]
        Goods[r][c] = v

    # dp[i][j][k]: マス (i, j) まで来たとき、その時点で i 行目のアイテムは k 個回収している
    # 場合の、回収したアイテムの価値の総和の最大値
    dp = [[[0] * 4 for j in range(C + 1)] for i in range(R + 1)]
    for i in range(R + 1):
        for j in range(C + 1):
            for k in range(4):
                # 下へ行く
                if i - 1 >= 0:
                    # 行を変えるので、k は 0 にリセットされる
                    dp[i][j][0] = max(dp[i][j][0], dp[i - 1][j][k])  # (i, j) のアイテムを拾わない
                    dp[i][j][1] = max(dp[i][j][1], dp[i - 1][j][k] + Goods[i][j])  # 拾う

                # 右へ行く
                if j - 1 >= 0:
                    dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k])  # 拾わない
                    if k - 1 >= 0:
                        dp[i][j][k] = max(dp[i][j][k], dp[i][j - 1][k - 1] + Goods[i][j])  # まだ拾えるし、拾う
    return max(dp[R][C][k] for k in range(4))

print(e_picking_goods())

Submission status: Time Limit Exceeded

Solution code:
def resolve():
  R,C,K=map(int,input().split())
  V=[[0]*C for _ in range(R)]
  for i in range(K):
    r,c,v=map(int,input().split())
    V[r-1][c-1]=v
  dp=[[[0]*4 for _ in range(3005)] for _ in range(3005)]
  for i in range(R):
    for j in range(C):
      v=V[i][j]
      for k in range(2,-1,-1):
        dp[i][j][k+1]=max(dp[i][j][k+1],dp[i][j][k]+v)
      for k in range(4):
        dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][k])
        dp[i][j+1][k]=max(dp[i][j+1][k],dp[i][j][k])
  print(max(dp[R-1][C-1]))

if __name__ == '__main__':
    resolve()

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

R, C, K = map(int, input().split())
D = dict()
for _ in range(K):
    r, c, v = map(int, input().split())
    D[(r, c)] = v

dp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]
for r in range(1, R + 1):
    for c in range(1, C + 1):
        m = max(dp[i][r - 1][c] for i in range(4))
        for n in range(4):
            dp[n][r][c] = max(m, dp[n][r][c - 1])
        if (r, c) in D:
            for n in range(3):
                dp[n + 1][r][c] = max(dp[n + 1][r][c],
                                      m + D[(r, c)],
                                      dp[n][r][c - 1] + D[(r, c)])
print(max(dp[i][-1][-1] for i in range(4)))

Submission status: Time Limit Exceeded

Solution code:
R, C, K = map(int, input().split())
D = dict()
for _ in range(K):
    r, c, v = map(int, input().split())
    D[(r, c)] = v

dp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]
for r in range(1, R + 1):
    for c in range(1, C + 1):
        m = max(dp[i][r - 1][c] for i in range(4))
        for n in range(4):
            dp[n][r][c] = max(m, dp[n][r][c - 1])
        if (r, c) in D:
            for n in range(3):
                dp[n + 1][r][c] = max(dp[n + 1][r][c],
                                      m + D[(r, c)],
                                      dp[n][r][c - 1] + D[(r, c)])
print(max(dp[i][-1][-1] for i in range(4)))

Submission status: Time Limit Exceeded

Solution code:
r, c, k = map(int, input().split())
rcv = [list(map(int, input().split())) for i in range(k)]

area = [[0] * (c+1) for i in range(r+1)]
for a, b, v in rcv:
    area[a-1][b-1] = v

# dp[i][j][k]: その行でiまで拾っており、
# j行k列目に到達時点の最大スコア
dp = [[[-1] * (c+1) for i in range(r+1)] for j in range(4)]
dp[0][0][0] = 0

for rr in range(r+1):
    for cc in range(c+1):
        for i in range(4):
            # 取って右
            if i+1<4 and cc<c and area[rr][cc]>0:
                dp[i+1][rr][cc+1] = max(dp[i+1][rr][cc+1],
                                        dp[i][rr][cc]+area[rr][cc])
            # 取って下
            if i+1<4 and rr<r and area[rr][cc]>0:
                dp[0][rr+1][cc] = max(dp[0][rr+1][cc],
                                      dp[i][rr][cc]+area[rr][cc])
            # 取らずに右
            if cc<c:
                dp[i][rr][cc+1] = max(dp[i][rr][cc+1],
                                      dp[i][rr][cc])
            # 取らずに下
            if rr<r:
                dp[0][rr+1][cc] = max(dp[0][rr+1][cc],
                                      dp[i][rr][cc])
# ans: r行c列目の最大値（iは問わず）
ans = max([dp[i][r][c] for i in range(4)])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
R,C,K=map(int,input().split(" "))
V=[[0 for i in range(C+1)]for i in range(R)]

for i in range(K):
    r,c,v=map(int,input().split(" "))
    V[r-1][c-1]=v
dp=[[[0 for i in range(4)]for j in range(C+1)]for k in range(R+1)]
for i in range(R):
    for j in range(C):
        for k in range(3):
            dp[i][j+1][k+1]=max(dp[i][j][k]+V[i][j],dp[i][j][k+1])
        dp[i+1][j][0]=max(dp[i][j][3],dp[i][j][2]+V[i][j],dp[i][j][1]+V[i][j],dp[i][j][0]+V[i][j])

print(max(max(dp[R-1][C]),max(dp[R-1][C-1])))

Submission status: Time Limit Exceeded

Solution code:
R,C,K=map(int,input().split(" "))
V=[[0 for i in range(C+1)]for i in range(R)]

for i in range(K):
    r,c,v=map(int,input().split(" "))
    V[r-1][c-1]=v
dp=[[[0 for i in range(4)]for j in range(C+1)]for k in range(R+1)]
for i in range(R):
    for j in range(C):
        for k in range(3):
            if V[i][j]!=0:
                dp[i][j+1][k+1]=max(dp[i][j][k]+V[i][j],dp[i][j][k+1])
            else:
                dp[i][j+1][k+1]=dp[i][j][k+1]
        dp[i+1][j][0]=max(dp[i][j][3],dp[i][j][2]+V[i][j],dp[i][j][1]+V[i][j],dp[i][j][0]+V[i][j])

print(max(max(dp[R-1][C]),max(dp[R-1][C-1])))

Submission status: Time Limit Exceeded

Solution code:
import sys
import copy
R, C, K = map(int, input().split())
item = [[0] * C for _ in range(R)]  # dp配列と合わせるために, 0行目, 0列目を追加している.
for s in sys.stdin.readlines():
    r, c, v = map(int, s.split())
    r -= 1
    c -= 1
    item[r][c] = v
    
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = [[0] * (C+1) for r in range(R+1)]
dp2 = [[0] * (C+1) for r in range(R+1)]
dp3 = [[0] * (C+1) for r in range(R+1)]
 
for r in range(R):
   for c in range(C):
      dp3[r][c] = max(dp3[r][c], dp2[r][c] + item[r][c])
      dp2[r][c] = max(dp2[r][c], dp1[r][c] + item[r][c])
      dp1[r][c] = max(dp1[r][c], dp0[r][c] + item[r][c])
      dp1[r][c+1] = max(dp1[r][c], dp1[r][c+1])
      dp2[r][c+1] = max(dp2[r][c], dp2[r][c+1])
      dp3[r][c+1] = max(dp3[r][c], dp3[r][c+1])
      dp0[r+1][c] = max(dp0[r+1][c], dp1[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp2[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp3[r][c])
ans = max(dp0[R-1][C-1], dp1[R-1][C-1])
ans = max(ans, dp3[R-1][C-1])
ans = max(ans, dp2[R-1][C-1])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
R,C,K=map(int,input().split(" "))
V=[[0 for i in range(C+1)]for i in range(R)]
for i in range(K):
    r,c,v=map(int,input().split(" "))
    V[r-1][c-1]=v
dp=[[[0 for i in range(4)]for j in range(C+1)]for k in range(R+1)]
for i in range(R):
    for j in range(C):
        for k in range(3):
            if V[i][j]!=0:
                dp[i][j+1][k+1]=max(dp[i][j][k]+V[i][j],dp[i][j][k+1])
            dp[i][j+1][k+1]=max(dp[i][j][k+1],dp[i][j+1][k+1])
        dp[i+1][j][0]=max(dp[i][j][3],dp[i][j][2]+V[i][j],dp[i][j][1]+V[i][j],dp[i][j][0]+V[i][j])

print(max(max(dp[R-1][C]),max(dp[R-1][C-1])))

Submission status: Time Limit Exceeded

Solution code:
import copy
R, C, K = map(int,input().split())
i = [list(map(int,input().split())) for k in range(K)]
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = copy.deepcopy(dp0)
dp2 = copy.deepcopy(dp0)
dp3 = copy.deepcopy(dp0)
item = copy.deepcopy(dp0)
for k in range(K):
   item[i[k][0]-1][i[k][1]-1] = i[k][2]
for r in range(R):
   for c in range(C):
      dp3[r][c] = max(dp3[r][c], dp2[r][c] + item[r][c])
      dp2[r][c] = max(dp2[r][c], dp1[r][c] + item[r][c])
      dp1[r][c] = max(dp1[r][c], dp0[r][c] + item[r][c])
      dp1[r][c+1] = max(dp1[r][c], dp1[r][c+1])
      dp2[r][c+1] = max(dp2[r][c], dp2[r][c+1])
      dp3[r][c+1] = max(dp3[r][c], dp3[r][c+1])
      dp0[r+1][c] = max(dp0[r+1][c], dp1[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp2[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp3[r][c])
ans = max(dp0[R-1][C-1], dp1[R-1][C-1])
ans = max(ans, dp3[R-1][C-1])
ans = max(ans, dp2[R-1][C-1])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import sys
input=sys.stdin.readline

def main():
    r,c,k=map(int,input().split())
    dp=[[[0 for jj in range(c+1)] for ii in range(r+1)] for kk in range(4)]

    g=[[0 for j in range(c)] for i in range(r)]
    for i in range(k):
        rr,cc,v=map(int,input().split())
        rr-=1
        cc-=1
        g[rr][cc]=v
    for i in range(1,r+1):
        for j in range(1,c+1):
            for k in range(4):
                dp[k][i][j]=max(dp[k][i][j],dp[k][i][j-1])#,dp[i][j-1][k])
                dp[0][i][j]=max(dp[0][i][j],dp[k][i-1][j])
                if g[i-1][j-1]>0:
                    if k>0:
                        if dp[k][i][j]<dp[k-1][i][j-1]+g[i-1][j-1]:
                            dp[k][i][j]=dp[k-1][i][j-1]+g[i-1][j-1]
                    if dp[1][i][j]<dp[k][i-1][j]+g[i-1][j-1]:
                        dp[1][i][j]=dp[k][i-1][j]+g[i-1][j-1]
    print(max(dp[0][r][c],dp[1][r][c],dp[2][r][c],dp[3][r][c]))
if __name__=='__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
H, W, K = map(int, input().split())
fld = [[0]*W for _ in range(H)]
for _ in range(K):
    h, w, v = map(int, input().split())
    fld[h-1][w-1] = v

dp = [[[0]*4 for _ in range(W+1)]for _ in range(H+1)]
for i in range(1, H+1):
    for j in range(1, W+1):
        v = fld[i-1][j-1]
        for k in range(4):
            dp[i][j][0] = max(dp[i][j][0], dp[i-1][j][k])
            if 0 < i:
                dp[i][j][1] = max(dp[i][j][1], dp[i-1][j][k]+v)

            dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k])
            if 0 < k-1:
                dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k-1]+v)

print(max(dp[H][W]))

Submission status: Time Limit Exceeded

Solution code:
from numba import jit
@jit
def main():
	r,c,k=map(int,input().split())
	item=[[0]*c for i in range(r)]
	for i in range(k):
		x,y,z=map(int,input().split())
		item[x-1][y-1]=z
	dp=[[[0,0,0,0] for j in range(c)] for i in range(r)]
	if item[0][0]>0:
		dp[0][0]=[0,item[0][0],0,0]
	for i in range(r):
		for j in range(c):
			for l in range(4):
				if l<3:
                	#した行く分にはOK
					if i!=r-1:
						dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][l])
						if item[i+1][j]>0:
							dp[i+1][j][1]=max(dp[i+1][j][0],dp[i][j][l])+item[i+1][j]
					#右は？
					if j!=c-1:
						dp[i][j+1][l]=max(dp[i][j+1][l],dp[i][j][l])
						if item[i][j+1]>0:
							dp[i][j+1][l+1]=max(dp[i][j+1][l+1],dp[i][j][l]+item[i][j+1])
				else:
					#した行く分にはOK
					if i!=r-1:
						dp[i+1][j][0]=max(dp[i+1][j][0],dp[i][j][l])
						if item[i+1][j]>0:
							dp[i+1][j][1]=max(dp[i+1][j][0],dp[i][j][l])+item[i+1][j]
					#右は？
					if j!=c-1:
						dp[i][j+1][l]=max(dp[i][j+1][l],dp[i][j][l])
	print(max(dp[r-1][c-1]))
main()

Submission status: Time Limit Exceeded

Solution code:
import sys
import copy
R, C, K = map(int, input().split())
item = [[0] * (C + 1) for _ in range(R + 1)]  # dp配列と合わせるために, 0行目, 0列目を追加している.
for s in sys.stdin.readlines():
    r, c, v = map(int, s.split())
    r -= 1
    c -= 1
    item[r][c] = v
    
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = [[0] * (C+1) for r in range(R+1)]
dp2 = [[0] * (C+1) for r in range(R+1)]
dp3 = [[0] * (C+1) for r in range(R+1)]

for r in range(R):
   for c in range(C):
      dp3[r][c] = max(dp3[r][c], dp2[r][c] + item[r][c])
      dp2[r][c] = max(dp2[r][c], dp1[r][c] + item[r][c])
      dp1[r][c] = max(dp1[r][c], dp0[r][c] + item[r][c])
      dp1[r][c+1] = max(dp1[r][c], dp1[r][c+1])
      dp2[r][c+1] = max(dp2[r][c], dp2[r][c+1])
      dp3[r][c+1] = max(dp3[r][c], dp3[r][c+1])
      dp0[r+1][c] = max(dp0[r+1][c], dp1[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp2[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp3[r][c])
ans = max(dp0[R-1][C-1], dp1[R-1][C-1])
ans = max(ans, dp3[R-1][C-1])
ans = max(ans, dp2[R-1][C-1])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
import copy
R, C, K = map(int,input().split())
i = [list(map(int,input().split())) for k in range(K)]
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = copy.deepcopy(dp0)
dp2 = copy.deepcopy(dp0)
dp3 = copy.deepcopy(dp0)
item = copy.deepcopy(dp0)
for k in range(K):
   item[i[k][0]-1][i[k][1]-1] = i[k][2]
for r in range(R):
   for c in range(C):
      dp3[r][c] = max(dp3[r][c], dp2[r][c] + item[r][c])
      dp2[r][c] = max(dp2[r][c], dp1[r][c] + item[r][c])
      dp1[r][c] = max(dp1[r][c], dp0[r][c] + item[r][c])
      dp1[r][c+1] = max(dp1[r][c], dp1[r][c+1])
      dp2[r][c+1] = max(dp2[r][c], dp2[r][c+1])
      dp3[r][c+1] = max(dp3[r][c], dp3[r][c+1])
      dp0[r+1][c] = max(dp0[r+1][c], dp1[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp2[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp3[r][c])
ans = max(dp0[R-1][C-1], dp1[R-1][C-1])
ans = max(ans, dp3[R-1][C-1])
ans = max(ans, dp2[R-1][C-1])
print(ans)

Submission status: Time Limit Exceeded

Solution code:
## coding: UTF-8
R,C,K = map(int,input().split())
rcv = []
for i in range(K):
    rcv.append(list(map(int,input().split())))

#print(rcv)

available = [False] * (R*C+1) #アイテムの有無を示す
item = [0] * (R*C+1)
for i in range(K):
    index = (rcv[i][0] - 1) * C + (rcv[i][1] - 1) +1
    available[index] = True
    item[index] = rcv[i][2]
#print(available, item)


def solver(R,C,K,rcv):
    #その場所にいる段階での最大スコアを出力
    #その行で獲得した個数も格納
    #DPの都合上0番目の要素を追加
    #グリッドは1次元で処理(1行目は1~C, 2行目はC+1~2C, ...)
    dp = []
    for i in range(R*C+1):
        dp.append([0] * 4)
    #print(dp)
    for i in range(1, R*C+1):
        #print(item[i])
        if(i == 1):
            #左上なら
            #dp[i][0] = dp[i-1][0] #左から(何も持ってこない)
            if(available[i]):
                #itemがある場合は取得するときと取得しない二通りに分けられる
                dp[i][1] = dp[i-1][0] + item[i]
        elif(i <= C):
            #左上以外の上(左からくる場合に限られる)
            dp[i][0] = dp[i-1][0] #itemを取得しない場合
            if(available[i]):
                dp[i][1] = max(dp[i-1][1], dp[i-1][0] + item[i])
                #if(dp[i-1][1] > 0): #左ですでに一個以上所持している場合にのみ、このマスで二個目ということが可能
                dp[i][2] = max(dp[i-1][2], dp[i-1][1] + item[i])
                #else:
                    #dp[i][2] = 0
                #if(dp[i-1][2] > 0): #左ですでに二個以上所持している場合にのみ、このマスで三個目ということが可能
                dp[i][3] = max(dp[i-1][3], dp[i-1][2] + item[i])
                #else:
                    #dp[i][3] = 0
            else:
                dp[i][1] = dp[i-1][1]
                dp[i][2] = dp[i-1][2]
                dp[i][3] = dp[i-1][3]
        elif(i % C == 1):
            #左上以外の左(上からくる場合に限られる)
            dp[i][0] = max(dp[i-C]) #下に降りてくる場合は、行で取得したアイテム数はリセットされる
            if(available[i]):
                #dp[i][1] = max(dp[i-C]) + item[i]
                dp[i][1] = dp[i][0] + item[i]
        else:
            #左でも上でもない場合
            dp[i][0] = max(dp[i-1][0], max(dp[i-C])) #左からくる場合は0限定だが、上からくる場合は、上の行で何個拾っててもいい
            if(available[i]):
                #dp[i][1] = max(dp[i-1][1], dp[i-1][0] + item[i], max(dp[i-C]) + item[i] ) #左から一個持った状態で来て拾わないor左から何も持たずに来て拾うor上から来て(所持数関係無し)拾う
                dp[i][1] = max(dp[i-1][1], dp[i][0] + item[i])
                #if(dp[i-1][1] > 0): #左ですでに一個以上所持している場合にのみ、このマスで二個目ということが可能
                dp[i][2] = max(dp[i-1][2], dp[i-1][1] + item[i]) #上から来て二個目は不可能
                #else:
                    #dp[i][2] = 0
                #if(dp[i-1][2] > 0):
                dp[i][3] = max(dp[i-1][3], dp[i-1][2] + item[i])
                #else:
                    #dp[i][3] = 0
            else:
                dp[i][1] = dp[i-1][1]
                dp[i][2] = dp[i-1][2]
                dp[i][3] = dp[i-1][3]

         

        #print(i, dp)
    print(max(dp[R*C]))


solver(R,C,K,rcv)

Submission status: Time Limit Exceeded

Solution code:
import copy
R, C, K = map(int,input().split())
i = [list(map(int,input().split())) for k in range(K)]
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = copy.deepcopy(dp0)
dp2 = copy.deepcopy(dp0)
dp3 = copy.deepcopy(dp0)
item = copy.deepcopy(dp0)
for k in range(K):
   item[i[k][0]-1][i[k][1]-1] = i[k][2]
for r in range(R):
   for c in range(C):
      dp3[r][c] = max(dp3[r][c], dp2[r][c] + item[r][c])
      dp2[r][c] = max(dp2[r][c], dp1[r][c] + item[r][c])
      dp1[r][c] = max(dp1[r][c], dp0[r][c] + item[r][c])
      dp1[r][c+1] = max(dp1[r][c], dp1[r][c+1])
      dp2[r][c+1] = max(dp2[r][c], dp2[r][c+1])
      dp3[r][c+1] = max(dp3[r][c], dp3[r][c+1])
      dp0[r+1][c] = max(dp0[r+1][c], dp1[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp2[r][c])
      dp0[r+1][c] = max(dp0[r+1][c], dp3[r][c])
ans = max(dp0[R-1][C-1], dp1[R-1][C-1], dp2[R-1][C-1], dp3[R-1][C-1])
print(ans)