input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
check=dict()
N,b,d=0,[],0
#ttfは235、chaはabc
def dfs_sub(n,ttf,cha):
global check,d
check[0]=min(check[n]+n*d,check[0]) if 0 in check else check[n]+n*d
if n//ttf==0:
check[n//ttf]=min(check[n]+(n%ttf)*d,check[n//ttf]) if n//ttf in check else check[n]+(n%ttf)*d
else:
if n//ttf in... | def f(n):
if (m:=s.get(n,-1))<0:s[n]=m=min([d*n]+[abs(p*k-n)*d+c+f(k)for p,c in zip(a,b)for k in(n//p,0--n//p)])
return m
exec("n,*b,d=map(int,input().split());a=2,3,5;s={0:0,1:d};print(f(n));"*int(eval(input()))) | p02669 |
check=dict()
#ttfは235、chaはabc
def dfs_sub(n,ttf,cha):
global check,d
#-1ずつしていく場合
check[0]=min(check[n]+n*d,check[0])
#最寄りまで-してく場合
x1,x2=n//ttf,n%ttf
if x1 in check:
if check[x1]>check[n]+x2*d+cha:
check[x1]=check[n]+x2*d+cha
dfs(x1)
else:
... | def dfs(n):
global b,check,d
#ttfは235、chaはabc
for ttf,cha in zip([2,3,5],b):
#-1ずつしていく場合
check[0]=min(check[n]+n*d,check[0])
#最寄りまで-してく場合
x1,x2=n//ttf,n%ttf
if x1 in check:
if check[x1]>check[n]+x2*d+cha:
check[x1]=check[n]+x2*d... | p02669 |
from math import ceil,floor,log
from decimal import *
from heapq import *
import sys
input=sys.stdin.readline
T=int(eval(input()))
cases=[list(map(int,input().split())) for _ in range(T)]
getcontext().prec=20
num=0
cnt=0
def main():
for i in cases:
l2=[0]*3
N,l2[0],l2[1],l2[2],D=i
... | from math import ceil,floor,log
#from decimal import Decimal,ROUND_CEILING,ROUND_FLOOR,getcontext
from heapq import *
import sys
input=sys.stdin.readline
T=int(eval(input()))
cases=[list(map(int,input().split())) for _ in range(T)]
#getcontext().prec=20
num=0
cnt=0
def main():
for i in cases:
l2... | p02669 |
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math
setrecursionlimit(10**6)
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.r... | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math
setrecursionlimit(10**6)
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.r... | p03183 |
import sys
n = int(eval(input()))
blocks = []
for line in sys.stdin.readlines():
w, s, v = list(map(int, line.split()))
blocks.append((w + s, w, s, v))
blocks.sort()
dp = [-1] * 20001
dp[0] = 0
for _, w, s, v in blocks:
for i in range(min(s, 20000 - w), -1, -1):
dp[i + w] = max(dp[i +... | import sys
n = int(eval(input()))
blocks = []
for line in sys.stdin.readlines():
w, s, v = list(map(int, line.split()))
blocks.append((w + s, w, s, v))
blocks.sort()
dp = [-1] * 20001
dp[0] = 0
for _, w, s, v in blocks:
for i in range(s, -1, -1):
if dp[i] == -1:
continue
... | p03183 |
n = int(eval(input()))
dp = [0] * (n * 10 ** 4 + 1)
bs = [list(map(int, input().split())) for _ in range(n)]
bs.sort(key=lambda x: x[0] + x[1])
for w, s, v in bs:
for i in range(w + s, w - 1, -1):
dpw = dp[i - w] + v
if dpw > dp[i]:
dp[i] = dpw
print((max(dp)))
| def f(n):
dp = [0] * (n * 10 ** 4 + 1)
bs = [list(map(int, input().split())) for _ in range(n)]
bs.sort(key=lambda x: x[0] + x[1])
for w, s, v in bs:
for i in range(w + s, w - 1, -1):
dpw = dp[i - w] + v
if dpw > dp[i]:
dp[i] = dpw
print((max(... | p03183 |
def f(n):
dp = [0] * (n * 10 ** 4 + 1)
bs = [list(map(int, input().split())) for _ in range(n)]
bs.sort(key=lambda x: x[0] + x[1])
for w, s, v in bs:
for i in range(w + s, w - 1, -1):
dpw = dp[i - w] + v
if dpw > dp[i]:
dp[i] = dpw
print((max(... | def f(n):
mx = 0
dp = [0] * (n * 10 ** 4 + 1)
bs = [list(map(int, input().split())) for _ in range(n)]
bs.sort(key=lambda x: x[0] + x[1])
for w, s, v in bs:
for i in range(w + s, w - 1, -1):
dpw = dp[i - w] + v
if dpw > dp[i]:
dp[i] = dpw
... | p03183 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from functools import cmp_to_key
n=int(eval(input()))
B=[list(map(int,input().split())) for _ in range(n)]
def cmp(a,b):
va=min(a[1],b[1]-a[0])
... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from functools import cmp_to_key
n=int(eval(input()))
B=[list(map(int,input().split())) for _ in range(n)]
def cmp(a,b):
va=min(a[1],b[1]-a[0])
... | p03183 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
from functools import cmp_to_key
n=int(eval(input()))
B=[list(map(int,input().split())) for _ in range(n)]
def cmp(a,b):
va=min(a[1],b[1]-a[0])
... | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n = int(eval(input()))
WSV = [tuple(map(int, input().split())) for _ in range(n)]
WSV.sort(key = lambda tup:tup[0] + tup[1])
# dp[i][w] : i 番目まで... | p03183 |
n=int(eval(input()));
ans=0;
p=[0]*22222;
for w,s,v in sorted([list(map(int,input().split()))for _ in[0]*n],key=lambda a:a[0]+a[1]):
for j in range(s,-1,-1):
p[j+w]=max(p[j+w],p[j]+v);
ans=max(ans,p[j+w]);
print(ans)
| p=[0]*6**6
for w,s,v in sorted([list(map(int,input().split()))for _ in[0]*int(eval(input()))],key=lambda a:a[0]+a[1]):
for j in range(s,-1,-1):p[j+w]=max(p[j+w],p[j]+v)
print((max(p))) | p03183 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
B=sorted([list(map(int,input().split())) for i in range(N)],key=lambda x:x[0]+x[1])
#W+Sの順にソートすると無駄がない。
DP=[0]*(10**4+2)
#重さの合計がWのときの価値。
#W=10**4+1ならそれ以上更新されないので、W>=10**4+1以上のものはそこに置く
for w,s,v in B:
if 10**4+1-w<=s:
if DP[-1]<... | import sys
input = sys.stdin.readline
N=int(eval(input()))
B=sorted([list(map(int,input().split())) for i in range(N)],key=lambda x:x[0]+x[1])
#W+Sの順にソートすると無駄がない。
DP=[0]*(10**4+2)
#重さの合計がWのときの価値。
#W=10**4+1ならそれ以上更新されないので、W>=10**4+1以上のものはそこに置く
for w,s,v in B:
if 10**4+1-w<=s:
x=max(DP[1... | p03183 |
from collections import defaultdict
import sys
input=sys.stdin.readline
r,c,k=list(map(int,input().split()))
l=[0]*((r+1)*(c+1))
for i in range(k):
a1,a2,a3=list(map(int,input().split()))
l[a1*(c+1)+a2]=a3
dp0=[[0 for i in range(c+1)] for j in range(r+1)]
dp1=[[0 for i in range(c+1)] for j in range(r+1)]
... | import sys
input=sys.stdin.readline
r,c,k=list(map(int,input().split()))
l=[0]*((r+1)*(c+1))
for i in range(k):
a1,a2,a3=list(map(int,input().split()))
l[a1*(c+1)+a2]=a3
dp0=[[0 for i in range(c+1)] for j in range(r+1)]
dp1=[[0 for i in range(c+1)] for j in range(r+1)]
dp2=[[0 for i in range(c+1)] for j in... | p02586 |
import sys
mod=10**9+7 ; inf=float("inf")
from math import sqrt, ceil
from collections import deque, Counter, defaultdict #すべてのkeyが用意されてる defaultdict(int)で初期化
# input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from decimal import ROUND_HALF_UP,Decimal #変換後の末尾桁を0や0.01で指定
#Decimal((str... | import sys
R, C, K = list(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 = list(map(int, s.split()))
item[r][c] = v
dp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]
for i in range(R + 1):
... | p02586 |
R, C, K = list(map(int, input().split()))
Items = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
Items[r][c] = v
DP = [[[-float('inf')] * 4 for _ in range(C + 1)] for __ in range(R + 1)]
for y in range(R+1):
for x in range(C+1):
if ... | R, C, K = list(map(int, input().split()))
Items = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
Items[r][c] = v
DP = [[0] * 4 for _ in range(R + 1)]
for x in range(1, C+1):
for y in range(1, R+1):
v = Items[y][x]
if v:
... | p02586 |
import os,io
import sys
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
r,c,k=list(map(int,input().split()))
dp = [[[0 for y in range(c)] for z in range(r)] for P in range(4)]
m=[]
for i in range(r):
m.append([])
for j in range(c):
m[i].append(0)
for i in range(k):
ri,ci,v=list(map(int,in... | import os,io
import sys
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
r,c,k=list(map(int,input().split()))
dp = [0]*(r*c*4)
m=[]
for i in range(r):
m.append([])
for j in range(c):
m[i].append(0)
for i in range(k):
ri,ci,v=list(map(int,input().split()))
m[ri-1][ci-1]=v
dp[0*r*c+0*c+0... | p02586 |
import os,io
import sys
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
r,c,k=list(map(int,input().split()))
dp = [0]*(r*c*4)
m=[]
for i in range(r):
m.append([])
for j in range(c):
m[i].append(0)
for i in range(k):
ri,ci,v=list(map(int,input().split()))
m[ri-1][ci-1]=v
dp[0*r*c+0*c+0... | import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
r,c,k=list(map(int,input().split()))
dp = [0]*(r*c*4)
m=[0]*(r*c)
for i in range(k):
ri,ci,v=list(map(int,input().split()))
m[(ri-1)*c+ci-1]=v
dp[0*r*c+0*c+0]=0
dp[1*r*c+0*c+0]=m[0]
dp[2*r*c+0*c+0]=m[0]
dp[3*r*c+0*c+0]=m[0]
for i in ... | p02586 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
R, C, k = list(map(int, input().split()))
field = [[0] * C for _ in range(R)]
for _ in range(k):
r, c, v = list(map(int, input().split()))
r -= 1; c -= 1
field[r][c] = v
# dp[taken 0 - 2][R][C]
dp = [[-1] * (C + 1) * (R + 1) for _ in... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
R, C, k = list(map(int, input().split()))
field = [[0] * C for _ in range(R)]
for _ in range(k):
r, c, v = list(map(int, input().split()))
r -= 1; c -= 1
field[r][c] = v
# dp[taken 0 - 2][R][C]
dp = [[-1] * (C + 1) * (R + 1) for _ in... | p02586 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
R, C, K = mapint()
dp = [[[0]*4 for _ in range(C)] for _ in range(R)]
from collections import defaultdict
dic = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, ... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
R, C, K = mapint()
last_dp = [[0]*4 for _ in range(C)]
dic = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, v = mapint()
dic[r-1][c-1] = v
for r in rang... | p02586 |
R, C, K = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(K)]
items = [[0] * (C + 1) for _ in range(R + 1)]
for r, c, v in X:
items[r][c] = v
dp = [[[0] * 4 for _ in range(C + 1)] for _ in range(R + 1)]
for i in range(1, R + 1):
for j in range(1, C + 1):
#... |
R, C, K = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(K)]
items = [[0] * (C + 1) for _ in range(R + 1)]
for r, c, v in X:
items[r][c] = v
dp = [[0] * 4 for _ in range(C + 1)]
for i in range(1, R + 1):
# Vertical transition
for j in range(1, C + 1):
... | p02586 |
from sys import stdin
input = stdin.readline
(R,C,K) = list(map(int, input().split()))
rcv = [list(map(int, input().split())) for _ in range(K)]
grids = [[0]*C for _ in range(R)]
for r,c,v in rcv:
grids[r-1][c-1] = v
from collections import defaultdict
dp = defaultdict(int)
for r in range(R):
... | # from sys import stdin
# input = stdin.readline
(R,C,K) = list(map(int, input().split()))
rcv = [list(map(int, input().split())) for _ in range(K)]
grids = [[0]*C for _ in range(R)]
for r,c,v in rcv:
grids[r-1][c-1] = v
dp = [0] * C
for r in range(R):
# print(dp)
ndp = [0] * C
elm... | p02586 |
import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
... | import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return list(map(int, input().split()))
def read_index(): return [int(x) - 1 for x in input().split()]
... | p02586 |
import sys
input = sys.stdin.buffer.readline
def main():
R, C, K = list(map(int, input().split()))
dp = [[[0, None, None, None] for j in range(C + 1)] for i in range(R + 1)]
dp[0][0][0] = 0
G = [[None for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map... | import sys
input = sys.stdin.buffer.readline
R, C, K = list(map(int, input().split()))
G = [[None for j in range(C)] for i in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
dp = [[0, 0, 0, 0] for _ in range(C)]
for i in range(R):
for j in range(C)... | p02586 |
def main():
import sys
my_input = sys.stdin.readline
H, W, K = list(map(int, my_input().split()))
V = [[0] * W for _ in range(H)]
for i in range(K):
h, w, v = list(map(int, my_input().split()))
h, w = h - 1, w - 1
V[h][w] = v
# dp[h][w][x] := h行w列にいて、h行からx個アイテム... | def main():
import sys
my_input = sys.stdin.readline
H, W, K = list(map(int, my_input().split()))
V = [[0] * W for _ in range(H)]
for i in range(K):
h, w, v = list(map(int, my_input().split()))
h, w = h - 1, w - 1
V[h][w] = v
# dp1 ~ 4[h][w][x] := h行w列にいて、h行からn... | p02586 |
R, C, K=list(map(int, input().split()))
math=[[0]*C for _ in range(R)]
for _ in range(K):
r, c, v=list(map(int, input().split()))
math[r-1][c-1]=v
dp=[[[0]*4 for __ in range(C)] for _ in range(R)]
if math[0][0]>0:
dp[0][0][1]=math[0][0]+0
for j in range(1, C):
dp[0][j][0]=dp[0][j-1][0]+0
dp[... | R, C, K=list(map(int, input().split()))
math=[[0]*C for _ in range(R)]
for _ in range(K):
r, c, v=list(map(int, input().split()))
math[r-1][c-1]=v
dp=[[[0]*C for __ in range(R)] for _ in range(4)]
if math[0][0]>0:
dp[1][0][0]=math[0][0]+0
for j in range(1, C):
dp[0][0][j]=dp[0][0][j-1]+0
dp[... | p02586 |
import base64
exec(base64.b64decode(b'aW1wb3J0IHN1YnByb2Nlc3MKaW1wb3J0IHN5cwoKY29kZSA9IHIiIiIjcHJhZ21hIEdDQyBvcHRpbWl6ZSgidW5yb2xsLWxvb3BzIikKCiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDxiaXRzZXQ+CiNpbmNsdWRlIDxjYXNzZXJ0PgojaW5jbHVkZSA8Y2N0eXBlPgojaW5jbHVkZSA8Y2hyb25vPgojaW5jbHVkZSA8Y21hdGg+CiNpbmNsdWRlIDxjb21wbGV4Pgo... | import base64
exec(base64.b64decode(b'aW1wb3J0IHN1YnByb2Nlc3MKaW1wb3J0IHN5cwoKY29kZSA9IHIiIiIjaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8Yml0c2V0PgojaW5jbHVkZSA8Y2Fzc2VydD4KI2luY2x1ZGUgPGNjdHlwZT4KI2luY2x1ZGUgPGNocm9ubz4KI2luY2x1ZGUgPGNtYXRoPgojaW5jbHVkZSA8Y29tcGxleD4KI2luY2x1ZGUgPGNzdHJpbmc+CiNpbmNsdWRlIDxkZXF1ZT4KI2l... | p02586 |
R, C,K = list(map(int, input().split()))
dp = [[[0]*(C+1) for k in range(R+1)] for _ in range(4)]
# dp[r][c][j] :=r index c columns already j cnt
dp[0][0][0] = 0
D = [[0 for i in range(C+1)] for j in range(R+1)]
import random
for i in range(K):
r, c, v = list(map(int,input().split()))
D[r][c] = v
for... | ## 一時間もTLEのために時間を無駄にした 学びもないつまんない問題...
R, C, K = list(map(int, input().split()))
dp = [[[0]*(C+1) for _ in range(R+1)]for __ in range(4)]
# dp[r][c][j] :=r index c columns already j cnt
dp[0][0][0] = 0
D = [[0 for i in range(C+1)] for j in range(R+1)]
for i in range(K):
r, c, v = list(map(int, input().sp... | p02586 |
def main():
R, C, K = list(map(int, input().split()))
a = dict()
for _ in range(K):
r, c, v = list(map(int, input().split()))
a[(r-1, c-1)] = v
dp = [[[0]*4 for _ in range(C+1)] for _ in range(R+1)]
for i in range(R):
for j in range(C):
v = max(dp[i... | def main():
R, C, K = list(map(int, input().split()))
a = dict()
for _ in range(K):
r, c, v = list(map(int, input().split()))
a[(r-1, c-1)] = v
dp = [[[0]*4 for _ in range(C+1)] for _ in range(2)]
for i in range(R):
for j in range(C):
v = max(dp[0][... | p02586 |
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
#read = sys.stdin.buffer.read
def main():
global field
R, C, K = list(map(int, input().split()))
field = []
for _ in range(R):
tmp = [0] * C
field.append(tmp)
... | import sys
import copy
from collections import deque
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
#read = sys.stdin.buffer.read
def main():
global field
R, C, K = list(map(int, input().split()))
field = []
for _ in range(R):
tmp = [0] * C
field.append(tmp)
... | p02586 |
f=lambda:list(map(int,input().split()))
R,C,K=f()
g=[[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r,c,v=f()
g[r][c]=v
dp=[[[0]*4 for _ in range(C+2)] for _ in range(R+2)]
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]... | f=lambda:list(map(int,input().split()))
R,C,K=f()
g=[[0]*(R+1) for _ in range(C+1)]
for _ in range(K):
r,c,v=f()
g[c][r]=v
dp=[[0]*4 for _ in range(R+1)]
for i in range(1,C+1):
for j in range(1,R+1):
t=g[i][j]
if t:
for k in range(3,0,-1):
dp[j][k]=max(dp[j][k],dp[j][k-1]+t)
... | p02586 |
f=lambda:list(map(int,input().split()))
R,C,K=f()
g=[[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r,c,v=f()
g[r][c]=v
dp=[[[0]*(C+2) for _ in range(R+2)] for _ in range(4)]
for i in range(1,R+1):
for j in range(1,C+1):
for k in range(3,-1,-1):
if k: dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][... | f=lambda:list(map(int,input().split()))
R,C,K=f()
g=[[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r,c,v=f()
g[r][c]=v
dp=[[[0]*(C+2) for _ in range(R+2)] for _ in range(4)]
for i in range(1,R+1):
for j in range(1,C+1):
for k in range(3,-1,-1):
if k: dp[k][i][j]=max(dp[k][i][j],dp[k-1][i][... | p02586 |
import sys
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
items = dict()
for _ in range(K):
r, c, v = list(map(int, input().split()))
items[(r-1,c-1)] = v
dp = [0] * 4 * R * C
if (0,0) in items:
dp[1] = items[(0,0)]
def ind(i,j,k):
return 4 * C * i + 4 * j + ... | import sys
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
items = [0] * R * C
for _ in range(K):
r, c, v = list(map(int, input().split()))
items[C * (r-1) + c-1] = v
dp = [0] * 4 * R * C
dp[1] = items[0]
def ind(i,j,k):
return 4 * C * i + 4 * j + k
for row in r... | p02586 |
import bisect
import sys,io
import math
from collections import deque
from heapq import heappush, heappop
input = sys.stdin.buffer.readline
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return l... | import bisect
import sys,io
import math
from collections import deque
from heapq import heappush, heappop
input = sys.stdin.buffer.readline
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return l... | p02586 |
R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
dp=[[[0] * 4 for i in range(C)] for j in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp[0][0][1]=l[0][0]
for x in range(1,R+C-1):
for y in range(R):
i=y
j=x-y
if j<0 or C<=j:
... | R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp=[0]*C
for i in range(R):
ndp=[0]*C
kdp=[0]*4
kdp[0]=dp[0]
kdp[1]=l[i][0]+dp[0]
ndp[0]=kdp[1]
for j in range(1,C):
kdp[0]=max(kdp[0],dp[... | p02586 |
R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp=[0]*C
for i in range(R):
ndp=[0]*C
kdp=[0]*4
kdp[0]=dp[0]
kdp[1]=l[i][0]+dp[0]
ndp[0]=kdp[1]
for j in range(1,C):
kdp[0]=max(kdp[0],dp[... | R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp=[0]*C
for i in range(R):
ndp=[0]*C
kdp=[0]*4
for j in range(0,C):
kdp[0]=max(kdp[0],dp[j])
for k in range(2,-1,-1):
kdp[k+1]=max(kdp... | p02586 |
R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp=[0]*C
for i in range(R):
ndp=[0]*C
kdp=[0]*4
for j in range(0,C):
kdp[0]=max(kdp[0],dp[j])
for k in range(2,-1,-1):
kdp[k+1]=max(kdp... | R,C,K=list(map(int,input().split()))
l=[[0] * C for i in range(R)]
for i in range(K):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
l[a][b]=c
dp=[[0] * C for i in range(R)]
for i in range(R):
kdp=[0]*4
for j in range(C):
if i>0:
kdp[0]=max(kdp[0],dp[i-1][j])
for k in range(2,-1,-... | p02586 |
#!/usr/bin/env python3
import collections
import sys
input=sys.stdin.readline
r,c,k=list(map(int,input().split()))
items=collections.defaultdict(int)
for _ in range(k):
tr,tc,tv=list(map(int,input().split()))
items[(tr,tc)]=tv
dp=[[[0]*4 for _ in range(c+1)] for _ in range(r+1)]
for i in range(1,r... | #!/usr/bin/env python3
import sys
input=sys.stdin.readline
r,c,k=list(map(int,input().split()))
items=[0]*(r*c)
for _ in range(k):
tr,tc,tv=list(map(int,input().split()))
items[c*(tr-1)+tc-1]=tv
dp=[0]*(4*r*c)
for i in range(1,r+1):
for j in range(1,c+1):
tv=items[c*(i-1)+j-1]
... | p02586 |
import sys
input=sys.stdin.readline
def main():
r,c,k=list(map(int,input().split()))
v=dict()
for _ in range(k):
ri,ci,a=list(map(int,input().split()))
ri-=1
ci-=1
v[(ri,ci)]=a
dp=[[[0]*4 for _ in range(c)] for i in range(r)]
#print(dp)
if (0,0) in v:
... | import sys
input=sys.stdin.readline
def main():
r,c,k=map(int,input().split())
v=[[0]*c for _ in range(r)]
for _ in range(k):
ri,ci,a=map(int,input().split())
ri-=1
ci-=1
v[ri][ci]=a
dp=[[[0]*c for _ in range(r)] for i in range(4)]
#print(dp)
if v[0][0... | p02586 |
def main(R,C,K,V):
dp = [[[0,0,0,0] for _ in range(C)] for _ in range(R)]
dp[0][0][1] = V[0][0]
for i in range(R):
for j in range(C):
for n in range(4):
if n!=0:
if i != 0 and n==1:
dp[i][j][n] = max(dp[i-1][j][0],dp[i-1... | def main(R,C,K,V):
dp = [0]*(4*R*C)
dp[1+4*0+4*C*0] = V[0][0]
for k in range(4*R*C):
n = k%4
j = k//4%C
i = k//(4*C)
if n!=0:
if i != 0 and n==1:
dp[k] = max(dp[k-4*C-n:k-4*C-n+4])+V[i][j]
if j != 0:
dp[k] = m... | p02586 |
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(re... | import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(re... | p02586 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02586 |
#!/usr/bin/env python3
r, c, k = list(map(int, input().split()))
items = [[0] * (c+1) for _ in range(r+1)]
for _ in range(k):
R, C, V = list(map(int, input().split()))
items[R][C] = V
dp0 = [[0] * (c+1) for _ in range(r+1)]
dp1 = [[0] * (c+1) for _ in range(r+1)]
dp2 = [[0] * (c+1) for _ in range(r+1)... | #!/usr/bin/env python3
r, c, k = list(map(int, input().split()))
items = [[0] * (c+1) for _ in range(r+1)]
for _ in range(k):
R, C, V = list(map(int, input().split()))
items[R][C] = V
dp1 = [[0] * (c+1) for _ in range(r+1)]
dp2 = [[0] * (c+1) for _ in range(r+1)]
dp3 = [[0] * (c+1) for _ in range(r+1)... | p02586 |
#!/usr/bin/env python3
r, c, k = list(map(int, input().split()))
items = [[0] * (c+1) for _ in range(r+1)]
for _ in range(k):
R, C, V = list(map(int, input().split()))
items[R][C] = V
dp1 = [[0] * (c+1) for _ in range(r+1)]
dp2 = [[0] * (c+1) for _ in range(r+1)]
dp3 = [[0] * (c+1) for _ in range(r+1)... | #!/usr/bin/env python3
r, c, k = list(map(int, input().split()))
items = [[0] * (c+1) for _ in range(r+1)]
for _ in range(k):
R, C, V = list(map(int, input().split()))
items[R][C] = V
dp1 = [[0] * (c+1) for _ in range(r+1)]
dp2 = [[0] * (c+1) for _ in range(r+1)]
dp3 = [[0] * (c+1) for _ in range(r+1)... | p02586 |
R,C,K = list(map(int,input().split()))
goods = [[-1]*(C+1) for _ in range(R+1)]
INF = 10**18
for i in range(K):
ri,ci,vi = list(map(int,input().split()))
goods[ri][ci] = vi
DP = [[[-INF,-INF,-INF,-INF] for _ in range(C+1)] for _ in range(R+1)]
DP[1][1][0] = 0
if goods[1][1] != -1:
DP[1][1][1] = goo... | import sys
input = sys.stdin.buffer.readline
R,C,K = list(map(int,input().split()))
goods = [[-1]*(C+1) for _ in range(R+1)]
INF = 10**16
for i in range(K):
ri,ci,vi = list(map(int,input().split()))
goods[ri][ci] = vi
DP = [[[-INF,-INF,-INF,-INF] for _ in range(C+1)] for _ in range(R+1)]
DP[1][1][0] = ... | p02586 |
import sys
def input():
return sys.stdin.buffer.readline()[:-1]
n, m, q = list(map(int, input().split()))
g = [[0 for _ in range(m)] for _ in range(n)]
for _ in range(q):
r, c, v = list(map(int, input().split()))
g[r-1][c-1] = v
dp = [[[0 for _ in range(4)] for _ in range(m)] for _ in range(n)]
dp[0][0]... | import sys
def input():
return sys.stdin.buffer.readline()[:-1]
n, m, q = list(map(int, input().split()))
g = [[0 for _ in range(m)] for _ in range(n)]
for _ in range(q):
r, c, v = list(map(int, input().split()))
g[r-1][c-1] = v
pre = [0 for _ in range(m)]
dp = [[0 for _ in range(4)] for _ in range(m)]
... | p02586 |
import sys
read = sys.stdin.buffer.read
readlines = sys.stdin.buffer.readlines
input = sys.stdin.buffer.readline
H, W, K = list(map(int, input().split()))
B = {}
for _ in range(K):
r, c, v = list(map(int, input().split()))
B[(r-1,c-1)] = v
dp = [[0]*(W+1) for _ in range(4)]
for i in range(H):
... | import sys
input = sys.stdin.buffer.readline
H, W, K = list(map(int, input().split()))
B = {}
for _ in range(K):
r, c, v = list(map(int, input().split()))
B[(r, c)] = v
dp = [[0]*(W+1) for _ in range(4)]
for i in range(1, H+1):
for j in range(1, W+1):
if (i, j) in B:
v = B... | p02586 |
# Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
R,C,K = list(map(int,input().split()))
DP = []
Gift = []
for i in range(R):
DP.append([])
Gift.append([])
for _ in range(C):
DP[i].append([0,0,0,0])
Gift[i].append(0)
... | # Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
R,C,K = list(map(int,input().split()))
DP = []
Gift = []
for i in range(R):
DP.append([])
Gift.append([])
for _ in range(C):
DP[i].append([0,0,0,0])
Gift[i].append(0)
... | p02586 |
# Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
R,C,K = list(map(int,input().split()))
DP = []
Gift = []
for i in range(R):
DP.append([])
Gift.append([])
for _ in range(C):
DP[i].append([0,0,0,0])
Gift[i].append(0)
... | # Fast IO (only use in integer input)
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
R,C,K = list(map(int,input().split()))
Gift = []
for i in range(R):
Gift.append([])
for _ in range(C):
Gift[i].append(0)
for _ in range(K):
r,c,v = list(map(int,input().split())... | p02586 |
# -*- coding: utf-8 -*-
R,C,K = list(map(int, input().split()))
items = [[0 for _ in range(C+1)] for _ in range(R+1)]
for i in range(K):
r,c,v = list(map(int, input().split()))
items[r][c] = v
DP_prev = [0 for _ in range(C+1)]
for r in range(1,R+1):
DP = [[0 for _ in range(C+1)],[0 for _ in range(... | # -*- coding: utf-8 -*-
R,C,K = list(map(int, input().split()))
items = [[0 for _ in range(C+1)] for _ in range(R+1)]
for i in range(K):
r,c,v = list(map(int, input().split()))
items[r][c] = v
DP_prev = [0 for _ in range(C+1)]
for r in range(1,R+1):
DP1 = [0 for _ in range(C+1)]
DP2 = [0 for _ in... | p02586 |
import sys
input = sys.stdin.readline
r,c,K=list(map(int, input().split()))
grid=[[0]*(c+1) for _ in range(r+1)]
for i in range(K):
ri,ci,vi=list(map(int, input().split()))
grid[ri][ci]=vi
dp=[[[0]*4 for _ in range(c+1)] for _ in range(r+1)]
for i in range(1,r+1):
for j in range(1,c+1):
... | R,C,K = list(map(int,input().split()))
grid=[[0]*C for _ in range(R)]
for i in range(K):
x,y,v = list(map(int,input().split()))
grid[x-1][y-1] = v
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1)]
for i in range(R):
for j in range(... | p02586 |
R,C,K = list(map(int,input().split()))
grid=[[0]*C for _ in range(R)]
for i in range(K):
x,y,v = list(map(int,input().split()))
grid[x-1][y-1] = v
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1)]
for i in range(R):
for j in range(... | R,C,K = list(map(int,input().split()))
grid=[[0]*C for _ in range(R)]
for i in range(K):
x,y,v = list(map(int,input().split()))
grid[x-1][y-1] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1)]... | p02586 |
import sys
def input(): return sys.stdin.readline().rstrip()
R, C, k = (int(x) for x in input().split())
V = [[0] * (C + 5) for _ in range(R + 5)]
for _ in range(k):
r, c, v = (int(x) for x in input().split())
V[r][c] = v
# dp[i][j][3]
dp = [[[0] * (C+5) for _ in range(R + 5)] for _ in range(4)]
fo... | import sys
def input(): return sys.stdin.readline().rstrip()
R, C, k = (int(x) for x in input().split())
V = [[0] * (C + 5) for _ in range(R + 5)]
for _ in range(k):
r, c, v = (int(x) for x in input().split())
V[r][c] = v
# dp[3][i][j]
dp = [[[0] * (C + 5) for _ in range(R + 5)] for _ in range(4)]
... | p02586 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | p02586 |
import sys
input = sys.stdin.readline
def solve():
INF = float('inf')
def max2(x, y): return x if x >= y else y
R, C, K = list(map(int, input().split()))
Vss = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
Vss[r][c] = v
... | import sys
input = sys.stdin.readline
def solve():
INF = float('inf')
def max2(x, y): return x if x >= y else y
R, C, K = list(map(int, input().split()))
Vss = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
Vss[r][c] = v
... | p02586 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutati... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutati... | p02586 |
def run():
# sys.stdin.readline()
import sys
input = sys.stdin.readline
r,c,k = list(map(int,input().split()))
t = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
a,b,z = list(map(int,input().split()))
t[a-1][b-1] = z
dp = [[[0 for i in range(c)]for i in... | def run():
# sys.stdin.readline()
import sys
input = sys.stdin.readline
r,c,k = list(map(int,input().split()))
t = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
a,b,z = list(map(int,input().split()))
t[a-1][b-1] = z
t = tuple(t)
dp = [[[0 for i in... | p02586 |
from sys import stdin
readline = stdin.readline
R, C, K = list(map(int, readline().split()))
goods = [[0] * C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, readline().split()))
goods[r - 1][c - 1] = v
dp = [[[0] * 4 for _ in range(C + 1)] for _ in range(R + 1)]
for i in range(R):
... | from sys import stdin
readline = stdin.readline
R, C, K = list(map(int, readline().split()))
goods = [[0] * C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, readline().split()))
goods[r - 1][c - 1] = v
n = [0] * (C + 1)
for i in range(R):
c = [0] * 4
c[0] = n[0]
for j... | p02586 |
from sys import stdin
readline = stdin.readline
R, C, K = list(map(int, readline().split()))
goods = [[0] * C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, readline().split()))
goods[r - 1][c - 1] = v
n = [0] * (C + 1)
for i in range(R):
c = [0] * 4
c[0] = n[0]
for j... | from sys import stdin
readline = stdin.readline
R, C, K = list(map(int, readline().split()))
goods = [[0] * C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, readline().split()))
goods[r - 1][c - 1] = v
dp = [0] * (C + 1)
for i in range(R):
cur = [0] * 4
cur[0] = dp[0]
... | p02586 |
import sys
input = sys.stdin.buffer.readline
from collections import defaultdict
r,c,k = list(map(int,input().split()))
K = defaultdict(int)
for _ in range(k):
x,y,z= [int(i) for i in input().split()]
K[(x,y)] = z
dp = [[0]*(c+1) for _ in range(4)]
for i in range(1, r+1):
for j in range(1, ... | import sys
input = sys.stdin.buffer.readline
H, W, K = list(map(int, input().split()))
B = {}
for _ in range(K):
r, c, v = list(map(int, input().split()))
B[(r, c)] = v
dp = [[0]*(W+1) for _ in range(4)]
for i in range(1, H+1):
for j in range(1, W+1):
if (i, j) in B:
v = B... | p02586 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p02586 |
import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(inp... | import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(inp... | p02586 |
def max2(x,y):
return x if x > y else y
R, C, K = list(map(int, input().split()))
V = [[0]*R for _ in range(C)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c-1][r-1] = v
dp = [[0]*4 for _ in range(R)]
for j in range(R):
if V[0][j] != 0:
dp[j][1] = max2(dp[j - 1][... | R, L, K = list(map(int, input().split()))
V = [[0]*R for _ in range(L)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c-1][r-1] = v
A, B, C, D = [[0]*(R+1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j-1], B[j-1], C[j-1], D[j-1])
v = V[i][j... | p02586 |
def max2(x,y):
return x if x > y else y
R, L, K = list(map(int, input().split()))
V = [[0]*R for _ in range(L)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c-1][r-1] = v
A, B, C, D = [[0]*(R+1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j... | import sys
input = sys.stdin.readline
R, L, K = list(map(int, input().split()))
V = [[0]*R for _ in range(L)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c-1][r-1] = v
A, B, C, D = [[0]*(R+1) for _ in range(4)]
for i in range(L):
for j in range(R):
A[j] = max(A[j-1],B[j-... | p02586 |
r,c,k = list(map(int,input().split()))
l = [[0]*c for i in range(r)]
for i in range(k):
x,y,v = list(map(int,input().split()))
l[x-1][y-1] = v
dp = [[[0]*4 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
for j in range(c):
if l[i][j] > 0:
v = l[i][j]
... | import sys
input = sys.stdin.readline
r,c,k = list(map(int,input().split()))
l = [[0]*c for i in range(r)]
for i in range(k):
x,y,v = list(map(int,input().split()))
l[x-1][y-1] = v
dp = [[[0]*4 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
for j in range(c):
M = max(dp... | p02586 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
def main():
R, C, K = list(map(int, input().split()))
D = [[*list(map(int, input().split()))] for _ in [None] * K]
D = {(r - 1, c - 1) : v for r, c, v in D}
dp = [[[-1] * 4 for _ in [None] * C] for _ in [None] * R]
dp[0][0][0] ... | import sys
def solve():
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
item = [[0 for _ in range(C)] for r in range(R)]
for _ in range(K):
r, c, k = list(map(int, input().split()))
item[r-1][c-1] = k
DP = [[[-1 for _ in range(C)] for r in range(R... | p02586 |
#!/usr/bin/env python3
def main():
(R, C, K), *D = [[*list(map(int,o.split()))] for o in open(0)]
D = {(r - 1, c - 1) : v for r, c, v in D}
dp = [[[-1] * C for _ in [None] * R] for _ in [None] * 4]
dp[0][0][0] = 0
for r in range(R):
for c in range(C):
v = D.get((r, c)... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
def main():
R, C, K = list(map(int, input().split()))
D = {}
for _ in [None] * K:
r, c, v = list(map(int, input().split()))
D[(r - 1, c - 1)] = v
dp = [[[-1] * C for _ in [None] * R] for _ in [None] * 4]
dp[... | p02586 |
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 10**9+7
R,C,K = list(map(int,input().split()))
item = [[0]*C for _ in range(R... | import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 10**9+7
R,C,K = list(map(int,input().split()))
item = [[0]*C for _ in range(R... | p02586 |
def main():
import sys
from copy import deepcopy
input = sys.stdin.readline
R, C, K = [int(x) for x in input().strip().split()]
G = [[0] * (C+1) for r in range(R+1)]
for k in range(K):
r, c, v = [int(x) for x in input().strip().split()]
G[r][c] = v
# for r in range(R... | def main():
import sys
from copy import deepcopy
input = sys.stdin.readline
R, C, K = [int(x) for x in input().strip().split()]
G = [[0] * (C+1) for r in range(R+1)]
for k in range(K):
r, c, v = [int(x) for x in input().strip().split()]
G[r][c] = v
# for r in range(R... | p02586 |
R,C,K = list(map(int,input().split()))
board = [[0 for _ in range(C)] for __ in range(R)]
for _ in range(K):
r,c,v = list(map(int,input().split()))
board[r-1][c-1] = v
dp = [[[0 for _ in range(C)] for __ in range(R)] for ___ in range(4)]
ans = 0
for i in range(R):
for j in range(C):
dp[1][i][j] = m... | R,C,K = list(map(int,input().split()))
board = [[0 for _ in range(C)] for __ in range(R)]
for _ in range(K):
r,c,v = list(map(int,input().split()))
board[r-1][c-1] = v
dp0 = [[0]*C for _ in range(R)]
dp1 = [[0]*C for _ in range(R)]
dp2 = [[0]*C for _ in range(R)]
dp3 = [[0]*C for _ in range(R)]
ans = 0... | p02586 |
R,C,K = list(map(int,input().split()))
board = [[0 for _ in range(C)] for __ in range(R)]
for _ in range(K):
r,c,v = list(map(int,input().split()))
board[r-1][c-1] = v
dp0 = [[0]*C for _ in range(R)]
dp1 = [[0]*C for _ in range(R)]
dp2 = [[0]*C for _ in range(R)]
dp3 = [[0]*C for _ in range(R)]
ans = 0... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
R,C,K = list(map(int,readline().split()))
board = [[0]*C for _ in range(R)]
for _ in range(K):
r,c,v = list(map(int,readline().split()))
board[r-1][c-1] = v
dp0 = [[0]*C for _ in range(R)]
dp1 = [[0]*C for _ in range(R)]
dp2 = [[0]*C fo... | p02586 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | p02586 |
R,C,K=list(map(int,input().split()))
value=[[0]*(C+1) for i in range(R+1)]
for i in range(K):
r,c,v=list(map(int,input().split()))
value[r][c]=v
DP0=[[0]*(C+1) for i in range(R+1)]
DP1=[[0]*(C+1) for i in range(R+1)]
DP2=[[0]*(C+1) for i in range(R+1)]
DP3=[[0]*(C+1) for i in range(R+1)]
for i in range(1,R... | R,C,K=list(map(int,input().split()))
value=[[0]*(C+1) for i in range(R+1)]
for i in range(K):
r,c,v=list(map(int,input().split()))
value[r][c]=v
DP0=[[0]*(C+1) for i in range(R+1)]
DP1=[[0]*(C+1) for i in range(R+1)]
DP2=[[0]*(C+1) for i in range(R+1)]
DP3=[[0]*(C+1) for i in range(R+1)]
for i in range(1,R... | p02586 |
r,c,k=list(map(int,input().split()))
P=[[0 for i in range(c+1)] for q in range(r+1)]
for i in range(k):
nr,nc,nv=list(map(int,input().split()))
#nr,nc,nv=map(int,inp[i].split())
#T[nr].append((nc,nv))
P[nr][nc]=nv
dp=[[[0,0,0,0] for i in range(c+1)] for q in range(r+1)]
for i in range(1,r+... | r,c,k=list(map(int,input().split()))
P=[[0 for i in range(c+1)] for q in range(r+1)]
for i in range(k):
nr,nc,nv=list(map(int,input().split()))
#nr,nc,nv=map(int,inp[i].split())
#T[nr].append((nc,nv))
P[nr][nc]=nv
dp=[[[0,0,0,0] for i in range(c+1)] for q in range(r+1)]
for i in range(1,r+... | p02586 |
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input... | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input... | p02586 |
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input... | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input... | p02586 |
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | #!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify
import itertools
import math, fractions
import sys, copy
def L(): return sys.stdin.readline... | p02586 |
import sys
input=sys.stdin.readline
R,C,K=list(map(int,input().split()))
item={}
for i in range(K):
r,c,v=list(map(int,input().split()))
item[r-1,c-1]=0
item[r-1,c-1]=v
dp=[[0 for i in range(3)] for j in range(C)]
if (R-1,C-1) in item:
dp[C-1][0]=item[R-1,C-1]
dp[C-1][1]=item[R-1,... | import sys
input=sys.stdin.readline
R,C,K=list(map(int,input().split()))
item=[[0 for i in range(C)] for j in range(R)]
for i in range(K):
r,c,v=list(map(int,input().split()))
item[r-1][c-1]=v
dp=[[0 for i in range(3)] for j in range(C)]
dp[C-1][0]=item[R-1][C-1]
dp[C-1][1]=item[R-1][C-1]
dp[C-1... | p02586 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p02586 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p02586 |
import sys
input = sys.stdin.readline
def main():
r,c,k = list(map(int, input().split()))
rcv = [ [0]*c for _ in range(r) ]
for _ in range(k):
ri,ci,vi = list(map(int, input().split()))
rcv[ri-1][ci-1] = vi
# dp[0] = [ [0]*c for _ in range(r) ]
# dp1 = [ [0]*c for _ in... | r,c,k = list(map(int, input().split()))
rckl = [ [0]*c for _ in range(r) ]
for _ in range(k):
r_,c_,v_ = list(map(int, input().split()))
rckl[r_-1][c_-1] = v_
dp0 = [ [0]*c for _ in range(r) ]
dp1 = [ [0]*c for _ in range(r) ]
dp2 = [ [0]*c for _ in range(r) ]
dp3 = [ [0]*c for _ in range(r) ]
... | p02586 |
import sys
input = lambda: sys.stdin.readline().rstrip()
r, c, k = list(map(int, input().split()))
dp = [[[0 for _ in range(3)] for _ in range(c + 5)] for _ in range(r + 5)]
pt = [[0 for _ in range(c + 5)] for _ in range(r + 5)]
for i in range(k):
r1, c1, v = list(map(int, input().split()))
dp[r1][c1][... | import sys
# import time
input = lambda: sys.stdin.readline().rstrip()
r, c, k = list(map(int, input().split()))
# dp = [[[0] * 3 for _ in range(c + 5)] for _ in range(r + 5)]
pt = [[0 for _ in range(c + 5)] for _ in range(r + 5)]
for i in range(k):
r1, c1, v = list(map(int, input().split()))
# dp[r1]... | p02586 |
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
R, C, K = list(map(int, readline().split()))
data = [[0]*(C+1) for _ in range(R+1)]
for i in range(K):
r,c,v = list(map(int,readline().split()))
data[r][c] = ... | # -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
R, C, K = list(map(int, readline().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for i in range(K):
r,c,v = list(map(int,readline().split()))
V[r][c] = v
d... | p02586 |
R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
# print(*V,sep='\n',end='\n\n')
dp = [[[0]*(3+1) for _ in range(C+1)] for _ in range(R+1)]
# for r in dp:
# for c in r:
# print('[',... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
pre = [[0]*(3+1) for _ in range(C+1)]
for i in range(R+1):
now = [[0]*(3+1) for _ in range(C+1)]
for j in range(C+1):
for k in range... | p02586 |
R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | p02586 |
R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
dp0 = [[0]*(C+1) for _ in range(R+1)]
dp1 = [[0]*(C+1) for _ in range(R+1)]
dp2 = [[0]*(C+1) for _ in range(R+1)]
dp3 = [[0]*(C+1) for _ in range(R+1... | p02586 |
R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
pre0 = [0]*(C+1)
pre1 = [0]*(C+1)
pre2 = [0]*(C+1)
pre3 = [0]*(C+1)
for i in range(R+1):
now0 = [0]*(C+1)
now1 = [0]*(C+1)
now2 = [0]... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
max_p = [0]*(C+1)
for i in range(R+1):
now0 = [0]*(C+1)
now1 = [0]*(C+1)
now2 = [0]*(C+1)
now3 = [0]*(C+1)
for j in range(C+1)... | p02586 |
R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
max_p = [0]*(C+1)
for i in range(R+1):
now0 = [0]*(C+1)
now1 = [0]*(C+1)
now2 = [0]*(C+1)
now3 = [0]*(C+1)
for j in range(C+1)... | R, C, K = list(map(int, input().split()))
V = [[0]*(C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[r][c] = v
max_p = [0]*(C+1)
for i in range(R+1):
now0, now1, now2, now3 = [[0]*(C+1) for _ in range(4)]
for j in range(C+1):
v = V[i][j]
... | p02586 |
def main():
r, c, k = list(map(int, input().split()))
d = [[0]*c for _ in [0]*r]
for _ in range(k):
t1, t2, t3 = list(map(int, input().split()))
d[t1-1][t2-1] = t3
dp = [[[0]*4 for _ in [0]*c] for _ in [0]*r]
dp[0][0][1] = d[0][0]
for x in range(r):
for y in rang... | def main():
r, c, k = list(map(int, input().split()))
d = dict()
for _ in range(k):
t1, t2, t3 = list(map(int, input().split()))
d[(t1-1, t2-1)] = t3
dp = [[0]*4 for _ in [0]*c]
if (0, 0) in d:
dp[0][1] = d[(0, 0)]
for x in range(r):
dp2 = [[0]*4 for _ i... | p02586 |
def main():
r, c, k = list(map(int, input().split()))
d = dict()
for _ in range(k):
t1, t2, t3 = list(map(int, input().split()))
d[(t1-1, t2-1)] = t3
dp = [[0]*4 for _ in [0]*c]
if (0, 0) in d:
dp[0][1] = d[(0, 0)]
for x in range(r):
dp2 = [[0]*4 for _ i... | def main():
r, c, k = list(map(int, input().split()))
d = [[0]*c for _ in [0]*r]
for _ in range(k):
t1, t2, t3 = list(map(int, input().split()))
d[t1-1][t2-1] = t3
dp = [[0]*4 for _ in [0]*c]
dp[0][1] = d[0][0]
for x in range(r):
dp2 = [[0]*4 for _ in [0]*c]
... | p02586 |
from sys import stdin
input = stdin.readline
def main():
R, C, K = list(map(int, input().split()))
items = [[0 for _ in range(C)] for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
items[r - 1][c - 1] = v
dp = [[[0 for _ in range(C)] for _ in range(R)... | from sys import stdin
input = stdin.readline
def main():
R, C, K = list(map(int, input().split()))
items = [[0 for _ in range(C)] for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
items[r - 1][c - 1] = v
dp = [[[0 for _ in range(C)] for _ in range(R)... | p02586 |
f,g,h=range,max,input
R,C,K=list(map(int,h().split()))
G=[[0]*-~C for i in f(R+1)]
for i in'_'*K:r,c,v=list(map(int,h().split()));G[r][c]=v
F=[[[0]*-~C for i in f(R+1)]for i in f(4)]
for r in f(1,R+1):
for x in f(1,4):
for c in f(1,C+1):F[x][r][c]=g(F[x-1][r][c],F[x-1][r][c-1]+G[r][c],F[x][r][c-1],(x<2)*(G[r]... | f,g,h=range,max,input
R,C,K=list(map(int,h().split()))
G=[[0]*-~C for i in f(R+1)]
for i in'_'*K:r,c,v=list(map(int,h().split()));G[r][c]=v
F=[[[0]*-~C for i in f(R+1)]for i in f(4)]
for r in f(1,R+1):
for x in f(1,4):
for c in f(1,C+1):F[x][r][c]=g(F[x-1][r][c],F[x-1][r][c-1]+G[r][c],F[x][r][c-1],(x<2)*(G[r]... | p02586 |
f,h=range,input
R,C,K=list(map(int,h().split()))
G=[-~C*[0]for i in f(R+1)]
for i in'_'*K:r,c,v=list(map(int,h().split()));G[r][c]=v
F=[[-~C*[0]for i in f(R+1)]for i in f(4)]
for r in f(1,R+1):
for x in f(1,4):
for c in f(1,C+1):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c],F[x][r... | f,h=range,input
R,C,K=list(map(int,h().split()))
l=lambda:[-~C*[0]for i in f(R+1)]
G=l()
for i in'_'*K:r,c,v=list(map(int,h().split()));G[r][c]=v
F=[l()for i in f(4)]
for r in f(1,R+1):
for x in f(1,4):
for c in f(1,C+1):F[x][r][c]=max(F[x-1][r][c],max(F[x-1][r][c-1],(x<2)*F[3][r-1][c])+G[r][c],F[x][r][c-1])... | p02586 |
H,W,k = list(map(int, input().split()))
# アイテムが何処に何個あるか
fs = [[0]*(W+1) for i in range(H+1)]
for i in range(k):
h, w, v = list(map(int, input().split()))
h -= 1
w -= 1
fs[h][w] = v
mvs = [(0,1),(1,0)]
dp = [[[-1<<50 for i in range(W+1)] for j in range(H+1)] for k in range(4)]
# dp[n][i][j] n... | H, W, k = list(map(int, input().split()))
"""
dp[k][i][j]
i行目、j番目まで来た時に、k個アイテムをとったときの価値の最大値
"""
fs = [[0]*(W+1) for i in range(H+1)]
dp = [[[-1]*(W+1) for i in range(H+1)] for j in range(4)]
# 価値を受け取る
for i in range(k):
h, w, v = list(map(int, input().split()))
fs[h-1][w-1] += v
# initialize
dp[... | p02586 |
def main():
import sys
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
G = [[0] * C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
r -= 1
c -= 1
G[r][c] = v
dp = [[[0] * 4 for _ in range(C + 1)]... | def main():
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
G = [[0] * W for _ in range(H)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
dp = [[[0] * 4 for _ in range(W + 1)] for _ in range(H + 1)]
... | p02586 |
def main():
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
G = [[0] * W for _ in range(H)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
dp = [[[0] * 4 for _ in range(W + 1)] for _ in range(H + 1)]
... | def main():
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
G = [[0] * W for _ in range(H)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
pdp = [[0] * 4 for _ in range(W)]
for r in range(H):
... | p02586 |
def main():
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
G = [[0] * W for _ in range(H)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
pdp = [[0] * 4 for _ in range(W)]
for r in range(H):
... | # https://atcoder.jp/contests/abc175/submissions/15965930
def main():
import sys
input = sys.stdin.readline
H, W, K = list(map(int, input().split()))
G = [[0] * W for _ in range(H)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
... | p02586 |
R,C,K=list(map(int, input().split()))
M=[[0 for i in range(C)]for i in range(R)]
for i in range(K):
r,c,v=list(map(int, input().split()))
r-=1
c-=1
M[r][c]=v
dp0=[[0 for j in range(C)] for i in range(R)]
dp1=[[0 for j in range(C)] for i in range(R)]
dp2=[[0 for j in range(C)] for i in range(R)]
dp3=[[... | R,C,K=list(map(int, input().split()))
M=[[0 for i in range(C)]for i in range(R)]
for i in range(K):
r,c,v=list(map(int, input().split()))
r-=1
c-=1
M[r][c]=v
dp0=[[0 for j in range(C)] for i in range(R)]
dp1=[[0 for j in range(C)] for i in range(R)]
dp2=[[0 for j in range(C)] for i in range(R)]
dp3=[[... | p02586 |
def resolve():
R, C, K = list(map(int, input().split()))
G = [[0] * (C) for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r - 1][c - 1] = v
dp = [[[0] * 4 for _ in range(C+1)] for _ in range(R+1)]
for i in range(R):
for j in range... |
def resolve():
R, C, K = list(map(int, input().split()))
G = [[0] * (C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r][c] = v
DP1 = [0 for _ in range(C + 1)] # c列目までとったとき、最新の行で1個以下とったという条件のもとの最大
DP2 = [0 for _ in range(C + 1)] # ... | p02586 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
def resolve():
R, C, K = list(map(int, inpS().split()))
G = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int,... |
def resolve():
R, C, K = list(map(int, input().split()))
G = [[0] * (C + 1) for _ in range(R + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
G[r][c] = v
dp = [[[0] * (C + 1) for _ in range(R + 1)] for _ in range(4)]
for i in range(R + 1):
for j ... | p02586 |
r,c,k=list(map(int,input().split()))
fuck=[list(map(int,input().split())) for _ in range(k)]
rck=[[0]*c for _ in range(r)]
for [rr,cc,kk] in fuck:
rck[rr-1][cc-1]=kk
#dp[y][x][cnt]
dp=[[[0]*4 for _ in range(c)] for _ in range(r)]
#print(dp)
for y in range(r):
for x in range(c):
#1行目
... | def pri(x):
for item in x:
print(item)
r,c,k=list(map(int,input().split()))
fuck=[list(map(int,input().split())) for _ in range(k)]
rck=[[0]*(c+1) for _ in range(r+1)]
for [rr,cc,kk] in fuck:
rck[rr][cc]=kk
#pri(rck)
#dp[y][x][cnt]
dp=[[0]*4 for _ in range(c+1)]
#print(dp)
for y in... | p02586 |
import sys
import math
from collections import defaultdict, deque
from copy import deepcopy
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return list(map(int, input().split()))
def MF(): return list(map... | import sys
import math
from collections import defaultdict, deque
from copy import deepcopy
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return list(map(int, input().split()))
def MF(): return list(map... | p02586 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.