input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | 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 |
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
R,C,K=list(map(int, sys.stdin.readline().split()))
value=defaultdict(lambda: 0)
value=[ [0 for _ in range(C+1)] for __ in range(R+1) ]
for _ in range(K):
r,c,v=list(map(int, sys.stdin.readline().split()))
value[r][c]=v
dp0=[0]*(... | # -*- coding: utf-8 -*-
import sys
from collections import defaultdict
R,C,K=list(map(int, sys.stdin.readline().split()))
value=defaultdict(lambda: 0)
value=[ [0 for _ in range(C+1)] for __ in range(R+1) ]
for _ in range(K):
r,c,v=list(map(int, sys.stdin.readline().split()))
value[r][c]=v
dp0=[0]*(... | p02586 |
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]*4 for _ in range(W+1)]
for i in range(1, H+1):
for j in range(1, W+1):
if (i, j) in B:
v = B[(... | R, C, K = list(map(int, input().split()))
# = int(input())
p = []
for k in range(K):
p.append(list(map(int, input().split())))
maps = [[0 for _ in range(C)] for _ in range(R)]
for k in range(K):
maps[p[k][0]-1][p[k][1]-1] += p[k][2]
point = [[[0, 0, 0] for _ in range(C)] for _ in range(R)]
point[0][0... | p02586 |
R, C, K = list(map(int, input().split()))
# = int(input())
p = []
for k in range(K):
p.append(list(map(int, input().split())))
maps = [[0 for _ in range(C)] for _ in range(R)]
for k in range(K):
maps[p[k][0]-1][p[k][1]-1] += p[k][2]
point = [[[0, 0, 0] for _ in range(C)] for _ in range(R)]
point[0][0... | R, C, K = list(map(int, input().split()))
# = int(input())
p = []
for k in range(K):
p.append(list(map(int, input().split())))
maps = [[0 for _ in range(C)] for _ in range(R)]
for k in range(K):
maps[p[k][0]-1][p[k][1]-1] += p[k][2]
point1 = [[0 for _ in range(C)] for _ in range(R)]
point2 = [[0 for _ ... | p02586 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, ... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(m... | p02586 |
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.... | import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.... | p02586 |
import copy
R, C, K = list(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]
fo... | import sys
import copy
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()))
r -= 1
c -= 1
item[r][c] = v
dp0 = [[0] * (C+1) for r in range(R+1)]
dp1 = [... | p02586 |
import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0
rows, cols, k = inp[ii:ii+3]; ii += 3
items = [[] for _ in range(rows+1)]
best = [0]*(cols+1)
for _ in range(k):
r, c, v = inp[ii:ii+3]; ii += 3
items[r].append([c, v])
for i in range(rows+1):
items[i].sort()
ans = 0
for r in range(1,... | import sys
inp = [int(x) for x in sys.stdin.read().split()]; ii = 0
shift = int(10**9 + 1)
rows, cols, k = inp[ii:ii+3]; ii += 3
items = [[] for _ in range(rows+1)]
best = [0]*(cols+1)
for _ in range(k):
r, c, v = inp[ii:ii+3]; ii += 3
items[r].append(c*shift+v)
for i in range(rows+1):
items[i].sort()
a... | p02586 |
import sys
input = sys.stdin.buffer.readline
def main():
R, C, K = list(map(int, input().split()))
State = [[0]*R for _ in range(C)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
State[c-1][r-1] += v
dp = [[0]*4 for _ in range((C+1)*(R+1))]
for r in rang... | import sys
input = sys.stdin.buffer.readline
def main():
R, C, K = list(map(int, input().split()))
State = [[0]*R for _ in range(C)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
State[c-1][r-1] += v
dp = [[0]*4 for _ in range(C+1)]
for r in range(R):
... | p02586 |
import sys
input = sys.stdin.readline
def solve():
R, C, K = list(map(int, input().split()))
item = [[0]*C for _ in range(R)]
for i in range(K):
r,c,v = list(map(int, input().split()))
item[r-1][c-1] = v
dp = [[0]*4 for _ in range((R+1)*5000)]
for i in range(1,R+1):
for j in range(1,C+1)... | import sys
input = sys.stdin.readline
def solve():
R, C, K = list(map(int, input().split()))
item = [[0]*C for _ in range(R)]
for i in range(K):
r,c,v = list(map(int, input().split()))
item[r-1][c-1] = v
dp = [[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]
for i in range(1,R+1):
for ... | p02586 |
import sys
input = sys.stdin.readline
R,C,K=list(map(int,input().split()))
itemMap = [[0]*(C+1) for _ in range(R+1)]
dp =[[[0]*(4) for _ in range(C+1)] for _ in range(R+1)]
for _ in range(K):
r,c,v=list(map(int,input().split()))
itemMap[r-1][c-1]=v
for ir in range(R):
for ic in range(C):
... | import sys
input = sys.stdin.readline
R,C,K=list(map(int,input().split()))
itemMap = [[0]*(C+1) for _ in range(R+1)]
dp =[[[0]*(C+1) for _ in range(R+1)] for _ in range(4)]
for _ in range(K):
r,c,v=list(map(int,input().split()))
itemMap[r-1][c-1]=v
for ir in range(R):
for ic in range(C):
... | p02586 |
import sys
input = sys.stdin.readline
def main(R,C,K,rcv):
inf=float('inf')
dp0=[[-inf,-inf,-inf,0] for _ in range(C)]
item=[[0]*C for _ in range(R)]
for r,c,v in rcv:
item[r-1][c-1]=v
# dp0[c][j]:c列目の時点で残りちょうどj個取れる時の最大値
for i in range(R):
# i+1行目に対する操作
# 初期化
for j in range(C):
... | import sys
input = sys.stdin.readline
def main(R,C,K,rcv):
inf=float('inf')
dp0=[[-inf,-inf,-inf,0] for _ in range(C)]
item=[[0]*C for _ in range(R)]
for r,c,v in rcv:
item[r-1][c-1]=v
# dp0[c][j]:c列目の時点で残りちょうどj個取れる時の最大値
for i in range(R):
# i+1行目に対する操作
# 遷移
for j in range(C):
... | p02586 |
import sys
input = sys.stdin.readline
def main(R,C,K,rcv):
inf=float('inf')
dp0=[[-inf,-inf,-inf,0] for _ in range(C)]
item=[[0]*C for _ in range(R)]
for r,c,v in rcv:
item[r-1][c-1]=v
# dp0[c][j]:c列目の時点で残りちょうどj個取れる時の最大値
for i in range(R):
# i+1行目に対する操作
# 遷移
for j in range(C):
... | R,C,K=list(map(int,input().split()))
rcv=[list(map(int,input().split())) for _ in range(K)]
mat=[[0]*C for _ in range(R)]
for r,c,v in rcv:
mat[r-1][c-1]=v
dp=[0]*C
for i in range(R):
ndp=[0]*C
wdp=[0]*4
for j in range(C):
wdp[0]=max(wdp[0],dp[j])
if mat[i][j]>0:
v=mat[i][j]
wdp... | p02586 |
import sys
input = sys.stdin.buffer.readline
R, C, K = list(map(int,input().split()))
RC = [[0] * (C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int,input().split()))
RC[r-1][c-1] = v
dp = [[[0] * 4 for _ in range(C+1)] for _ in range(R+1)]
dp[0][0][1] = RC[0][0]
for r in ra... | import sys
input = sys.stdin.buffer.readline
R, C, K = list(map(int,input().split()))
RC = [[0] * (C+1) for _ in range(R+1)]
for _ in range(K):
r, c, v = list(map(int,input().split()))
RC[r-1][c-1] = v
dp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]
dp[1][0][0] = RC[0][0]
for r in ... | p02586 |
R, C, K = list(map(int, input().split()))
item = [[0] * C for i in range(R)]
for i in range(K):
r, c, v = list(map(int, input().split()))
item[r - 1][c - 1] = v
dp = [[[0] * 4 for j in range(C)] for i in range(R)]
#print(dp, item)
for i in range(R):
for j in range(C):
for k in range(4):
... | R,C,K = list(map(int,input().split()))
J=[0] * K
for i in range(K):
J[i] = list(map(int,input().split()))
#DP0 = [[0]*(C+2) for i in range(R+2)]
DP1 = [[0]*(C+2) for i in range(R+2)]
DP2 = [[0]*(C+2) for i in range(R+2)]
DP3 = [[0]*(C+2) for i in range(R+2)]
MAP = [[0]*C for i in range(R)]
for x,y,v in... | p02586 |
import sys
input = sys.stdin.readline
def main():
h, w, k = list(map(int, input().split()))
U = h*w
G = [0]*U
for _ in range(k):
r, c, v = list(map(int, input().split()))
r -= 1
c -= 1
G[r*w+c] = v
dp = [[0]*4 for _ in range(U)]
dp[0][0] = 0
dp[0][1] = G[0]
for i in range... | 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()))
r -= 1
c -= 1
G[r][c] = v
dp = [[[0]*w for i in range(h)] for j in range(4)]
dp[0][0][0] = 0
dp[1][0][0] = G[0][0]
for i in ran... | p02586 |
H, W, K = list(map(int, input().split()))
A = [[0] * W for _ in range(H)]
for i in range(K):
y, x, v = list(map(int, input().split()))
A[y - 1][x - 1] = v
dp = [[0] * 4 for i in range(W)]
pre = []
dp[0][1] = A[0][0]
for i in range(H):
for j in range(W):
for k in range(4):
if i... | H, W, K = list(map(int, input().split()))
A = [[0] * W for _ in range(H)]
for i in range(K):
y, x, v = list(map(int, input().split()))
A[y - 1][x - 1] = v
dp = [[0] * 4 for i in range(W)]
pre = []
dp[0][1] = A[0][0]
for i in range(H):
for j in range(W):
if i:
dp[j][0] = max(dp... | p02586 |
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
RCV = [tuple(map(int,input().split())) for i in range(K)]
goods = [dict() for _ in range(R)]
for r,c,v in RCV:
r,c = r-1,c-1
goods[r][c] = v
dp = [[[0]*4 for _ in range(C)] for _ in range(R)]
if 0 in goods[0]:
dp[0][0... | import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
RCV = [tuple(map(int,input().split())) for i in range(K)]
goods = [dict() for _ in range(R)]
for r,c,v in RCV:
r,c = r-1,c-1
goods[r][c] = v
dp0 = [[0]*4 for _ in range(C)]
dp1 = [[0]*4 for _ in range(C)]
if 0 in goods[0]... | p02586 |
r,c,k = list(map(int,input().split()))
dp = [[[0 for _ in range(4)] for _ in range(c+1)] for _ in range(r+1)]
g = [[0]*(c+1) for _ in range(r+1)]
for _ in range(k):
a,b,v = list(map(int,input().split()))
g[a][b] = v
for i in range(r+1):
for j in range(c+1):
for m in range(4):
... | 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()))
dp = [[[0 for _ in range(4)] for _ in range(c+1)] for _ in range(r+1)]
g = [[0]*(c+1) for _ in range(r+1)]
for _ in range(k):
a,b,v = list(map(int,input().split()))
g[a][b] = v
for i in range(r+1):
for j in range(c+1):
for k in range(4):
... | r,c,k = list(map(int,input().split()))
dp = [[[0]*(c+1) for _ in range(r+1)] for _ in range(4)]
g = [[0]*(c+1) for _ in range(r+1)]
for _ in range(k):
a,b,v = list(map(int,input().split()))
g[a][b] = v
for i in range(r+1):
for j in range(c+1):
for m in range(4):
tmp =dp[m][i]... | p02586 |
r,c,k = list(map(int, input().split()))
rcv = [list(map(int, input().split())) for i in range(k)]
d = dict()
for rr,cc,vv in rcv:
d[(rr-1,cc-1)] = vv
DP_now = [[0]*4 for i in range(c)]
DP_prev = [[0]*4 for i in range(c)]
for i in range(r):
for j in range(c):
if (i,j) in d:
v = ... | r,c,k = list(map(int, input().split()))
rcv = [list(map(int, input().split())) for i in range(k)]
d = dict()
for rr,cc,vv in rcv:
d[(rr-1,cc-1)] = vv
DP_now = [[0]*4 for i in range(c)]
DP_prev = [[0]*4 for i in range(c)]
for i in range(r):
for j in range(c):
max_top = max(DP_prev[j]) if i!=... | p02586 |
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... | import sys
input=sys.stdin.readline
def main():
r,c,k=map(int,input().split())
v=[0] * (c * r)
for _ in range(k):
ri,ci,a=map(int,input().split())
v[(ri-1)*c + (ci-1)]=a
dp= [0] * (c * r * 4)
#print(dp)
x = c * r
if v[0]>0: dp[x] = v[0]
for i in range(r):
... | p02586 |
import sys
input=sys.stdin.readline
def main():
r,c,k=map(int,input().split())
v=[0] * (c * r)
for _ in range(k):
ri,ci,a=map(int,input().split())
v[(ri-1)*c + (ci-1)]=a
dp= [0] * (c * r * 4)
#print(dp)
x = c * r
if v[0]>0: dp[x] = v[0]
for i in range(r):
... | import sys
input=sys.stdin.readline
def main():
r,c,k=map(int,input().split())
v=[0] * (c * r)
for _ in range(k):
ri,ci,a=map(int,input().split())
v[(ri-1)*c + (ci-1)]=a
dp= [0] * (c * r * 4)
#print(dp)
x = c * r
if v[0]>0: dp[x] = v[0]
for i in range(... | p02586 |
import sys
input=sys.stdin.readline
class list2D:
def __init__(self, H, W, num):
self.__H = H
self.__W = W
self.__dat = [num] * (H * W)
def __getitem__(self, a):
return self.__dat[a[0]*self.__W+a[1]]
def __setitem__(self, a, b):
self.__dat[a[0]*self.__... | import sys
input=sys.stdin.readline
class list2D:
def __init__(self, H, W, num):
self.__H = H
self.__W = W
self.__dat = [num] * (H * W)
def __getitem__(self, a):
return self.__dat[a[0]*self.__W+a[1]]
def __setitem__(self, a, b):
self.__dat[a[0]*self.__... | p02586 |
import sys
input=sys.stdin.readline
class list2D:
def __init__(self, H, W, num):
self.__H = H
self.__W = W
self.__dat = [num] * (H * W)
def __getitem__(self, a):
return self.__dat[a[0]*self.__W+a[1]]
def __setitem__(self, a, b):
self.__dat[a[0]*self.__... | import sys
inp = [int(x) for x in sys.stdin.read().split()]
ii = 0
r, c, k = inp[ii:ii+3]
ii += 3
v=[0] * (c * r)
for _ in range(k):
ri,ci,a = inp[ii:ii+3]
ii += 3
v[(ri-1)*c + (ci-1)]=a
dp= [0] * (c * r * 4)
x = c * r
if v[0]>0: dp[x] = v[0]
for i in range(r):
for j in range(c):
... | p02586 |
R,C,K = list(map(int, input().split()))
d = [[0 for _ in range(C+1)] for _ in range(R+1)]
dp = [[[0 for _ in range(4)] for _ in range(C+1)] for _ in range(R+1)]
for i in range(K):
r, c, v = list(map(int, input().split()))
d[r-1][c-1] = v
for i in range(R):
for j in range(C):
# kが大きい方からやら... | R,C,K = list(map(int, input().split()))
d = [[0 for _ in range(C+1)] for _ in range(R+1)]
dp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]
for i in range(K):
r, c, v = list(map(int, input().split()))
d[r-1][c-1] = v
for i in range(R):
for j in range(C):
# kが大きい方からやら... | p02586 |
def main():
import sys
input=sys.stdin.readline
h,w,k=list(map(int,input().split()))
H=list(range(h))
W=list(range(w))
dp=[[[0]*4 for j in W] for i in H]
for _ in range(k):
r,c,v=list(map(int,input().split()))
dp[r-1][c-1][0]=v
if dp[0][0][0]!=0:
dp[0][0][1]=dp[0][0][0]
dp[0]... | def main():
import sys
input=sys.stdin.readline
h,w,k=list(map(int,input().split()))
H=list(range(h))
W=list(range(w))
dp=[[[0]*w for j in H] for i in range(4)]
for _ in range(k):
r,c,v=list(map(int,input().split()))
dp[0][r-1][c-1]=v
if dp[0][0][0]!=0:
dp[1][0][0]=dp[0][0][0]
... | 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
X = [[[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):
X[i][j][0] = max(X[i-... | 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
X = [[[0] * 4 for _ in range(C + 1)] for _ in range(R + 1)]
for i in range(1, R + 1):
Xi = X[i]
Xi1 = X[i-1]
Vi = V[i]
for j in... | 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
X = [[[0] * 4 for _ in range(C + 1)] for _ in range(R + 1)]
for i in range(1, R + 1):
Xi = X[i]
Xi1 = X[i-1]
Vi = V[i]
for j in... | R, C, K = list(map(int, input().split()))
V = [[0] * (R + 1) for _ in range(C + 1)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
V[c][r] = v
X = [[0] * 4 for _ in range(R + 1)]
for i in range(1, C + 1):
Vi = V[i]
for j in range(1, R + 1):
v = Vi[j]
Xj = X[j]
... | p02586 |
import sys
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
values = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
values[r-1][c-1] = v
dp = [[[0]*4 for _ in range(C)] for _ in range(R+1)] # [r, c, とったアイテム]のvの最大値
for r in range(R-1, -1, ... | import sys
input = sys.stdin.readline
R, C, K = list(map(int, input().split()))
values = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, v = list(map(int, input().split()))
values[r-1][c-1] = v
dp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]
for r in range(R-1, -1, -1):
... | p02586 |
import sys
import math
import collections
import bisect
import itertools
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na = lambda... | import sys
import math
import collections
import bisect
import itertools
# import numpy as np
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na = lambda... | p02586 |
import sys
input = lambda: sys.stdin.readline().rstrip()
inpl = lambda: list(map(int,input().split()))
R, C, K = inpl()
val = [[0]*(C+1) for r in range(R+1)]
for _ in range(K):
r, c, v = inpl()
val[r][c] = v
score = [[[0]*4 for c in range(C+1)] for r in range(R+1)]
for r in range(1,R+1):
for c i... | import sys
input = lambda: sys.stdin.readline().rstrip()
inpl = lambda: list(map(int,input().split()))
R, C, K = inpl()
N = 3
val = [[0]*(C+1) for r in range(R+1)]
for _ in range(K):
r, c, v = inpl()
val[r][c] = v
score = [[[0]*(N+1) for c in range(C+1)] for r in range(R+1)]
for r in range(1,R+1):
... | p02586 |
import sys
input=sys.stdin.readline
R,C,K=list(map(int,input().split()))
rcv=[tuple(map(int,input().split())) for _ in range(K)]
MAP=[[0 for _ in range(C+2)] for _ in range(R+2)]
DP=[[[0 for _ in range(3)] for _ in range(C+2)] for _ in range(R+2)]
for r,c,v in rcv:
MAP[r-1][c-1]=v
for i in range(R):
... | import sys
input = sys.stdin.readline
R,C,K=list(map(int,input().split()))
J=[tuple(map(int,input().split())) for i in range(K)]
#DP0=[[0]*(C+2) for i in range(R+2)]
DP1=[[0]*(C+2) for i in range(R+2)]
DP2=[[0]*(C+2) for i in range(R+2)]
DP3=[[0]*(C+2) for i in range(R+2)]
MAP=[[0]*C for i in range(R)]
... | p02586 |
R,C,K = list(map(int, input().split()))
a = [[0] * (C+1) for i in range(R+1)]
dp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]
for i in range(K):
r,c,v = list(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[k+1][i][j] = ... | R,C,K = list(map(int, input().split()))
a = [[0] * (C+1) for i in range(R+1)]
dp = [[[0] * (C+1) for i in range(R+1)] for j in range(4)]
for i in range(K):
r,c,v = list(map(int, input().split()))
r -= 1
c -= 1
a[r][c] = v
for i in range(R):
for j in range(C):
for k in range(2,-1,-1):
... | p02586 |
from copy import deepcopy
def getval():
r,c,k = list(map(int,input().split()))
item = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
ri,ci,vi = list(map(int,input().split()))
item[ri-1][ci-1] = vi
return r,c,k,item
def main(r,c,k,item):
#DP containing the i... | from copy import deepcopy
def getval():
r,c,k = list(map(int,input().split()))
item = [[0 for i in range(c)] for i in range(r)]
for i in range(k):
ri,ci,vi = list(map(int,input().split()))
item[ri-1][ci-1] = vi
return r,c,k,item
def main(r,c,k,item):
#DP containing the i... | p02586 |
# pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
from collections import defaultdict
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = defaultdict(int)
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[... | # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr-1, cc-1)] = vv
dp = [[[0]*4 for c in range(C... | p02586 |
# pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr-1, cc-1)] = vv
dp = [[[0]*4 for c in range(C... | # pypy
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
R, C, K = list(map(int, readline().split()))
rcv = list(map(int, read().split()))
rc2v = {}
for rr, cc, vv in zip(rcv[::3], rcv[1::3], rcv[2::3]):
rc2v[(rr, cc)] = vv
dp = [[0]*4 for c in range(C+1)]
... | p02586 |
import sys
input=sys.stdin.readline
H,W,K=list(map(int,input().split()))
G=[[0]*W for i in range(H)]
for i in range(K):
r,c,v=list(map(int,input().split()))
r,c=r-1,c-1
G[r][c]=v
dp=[[[-1,-1,-1,-1] for i in range(W)] for i in range(H)]
dp[0][0][0]=0
if G[0][0]!=0:
dp[0][0][1]=G[0][0]
... | import sys
input=sys.stdin.readline
H,W,K=list(map(int,input().split()))
G=[[0]*W for i in range(H)]
for i in range(K):
r,c,v=list(map(int,input().split()))
r,c=r-1,c-1
G[r][c]=v
dp0=[[-1 for i in range(W)] for i in range(H)]
dp1=[[-1 for i in range(W)] for i in range(H)]
dp2=[[-1 for i in r... | p02586 |
"""
dp[i][j] => i行目j列目がゴールの場合の最大値
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*(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]*4 for _ in ra... | """
dp[i][j] => i行目j列目がゴールの場合の最大値
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*(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]*4 for _ in ran... | p02586 |
"""
dp[i][j][k] => i行目、j列のマスまで見る。k個取る時の最高値。
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*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]*4 for _... | """
dp[i][j][k] => i行目、j列のマスまで見る。k個取る時の最高値。
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*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]*4 for _ ... | p02586 |
"""
dp[i][j][k] => i行目j列到達時点での最大価値。i行目において拾えるアイテムの数はK個。
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*C for _ in range(R)]
for _ in range(K):
r,c,v = list(map(int,input().split()))
items[r-1][c-1] = v
dp = [... | """
dp[i][j][k] => i行目j列到達時点での最大価値。i行目において拾えるアイテムの数はK個。
"""
def main():
import sys
input = sys.stdin.readline
R,C,K = list(map(int,input().split()))
items = [[0]*C for _ in range(R)]
for _ in range(K):
r,c,v = list(map(int,input().split()))
items[r-1][c-1] = v
dp = [... | p02586 |
R,C,K = list(map(int,input().split()))
V = [[0 for c in range(C+1)] for r in range(R+1)]
r_list = [False for r in range(R+1)]
c_list = [False for c in range(C+1)]
for i in range(K):
r,c,v = list(map(int,input().split()))
V[r][c] = v
r_list[r] = True
c_list[c] = True
r_map = {}
cnt = 0
for i in range(... | R,C,K = list(map(int,input().split()))
V = [[0 for c in range(C+1)] for r in range(R+1)]
for i in range(K):
r,c,v = list(map(int,input().split()))
V[r][c] = v
dp = [[0 for i in range(4)] for j in range(C+1)]
for r in range(1, R+1):
for c in range(1, C+1):
v = V[r][c]
under_val = max(dp[c])
dp[c][0]... | p02586 |
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 個回収している
# 場合の、回収したアイテムの価値の総和の最大値... | def e_picking_goods():
# 参考: https://atcoder.jp/contests/abc175/submissions/16044254
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
# editorial に対し、行の情報を... | p02586 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = dict()
for r, c, v in zip(*[iter(RCV)] * 3):
item[(r - 1, ... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = [[0] * C for _ in range(R)]
for r, c, v in zip(*[iter(RCV)] * 3):
... | p02586 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = [[0] * C for _ in range(R)]
for r, c, v in zip(*[iter(RCV)] * 3):
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = [[0] * C for _ in range(R)]
for r, c, v in zip(*[iter(RCV)] * 3):
... | p02586 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = [[0] * C for _ in range(R)]
for r, c, v in zip(*[iter(RCV)] * 3):
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
R, C, K, *RCV = list(map(int, read().split()))
item = [[0] * C for _ in range(R)]
for r, c, v in zip(*[iter(RCV)] * 3):
... | p02586 |
import sys
from collections import defaultdict
input=sys.stdin.readline
d=defaultdict(int)
R,C,k=list(map(int,input().split()))
for i in range(k):
r,c,v=list(map(int,input().split()))
d[(r-1)*C+c-1]=v
dp=[[[0,0,0,0] for j in range(C+1)] for i in range(R+1)]
for i in range(1,R+1):
for j in range(1,C+1):
... | import sys
input=sys.stdin.readline
R,C,k=list(map(int,input().split()))
A=[[0]*C for i in range(R)]
for i in range(k):
r,c,v=list(map(int,input().split()))
A[r-1][c-1]=v
dp=[[[0,0,0,0] for j in range(C+1)] for i in range(R+1)]
for i in range(1,R+1):
for j in range(1,C+1):
V=A[i-1][j-1]
dp[i][j... | p02586 |
import sys
input=sys.stdin.readline
R,C,k=list(map(int,input().split()))
A=[[0]*C for i in range(R)]
for i in range(k):
r,c,v=list(map(int,input().split()))
A[r-1][c-1]=v
dp=[[[0,0,0,0] for j in range(C+1)] for i in range(R+1)]
for i in range(1,R+1):
for j in range(1,C+1):
V=A[i-1][j-1]
dp[i][j... | import sys
input=sys.stdin.readline
R,C,k=list(map(int,input().split()))
A=[[0]*C for i in range(R)]
for i in range(k):
r,c,v=list(map(int,input().split()))
A[r-1][c-1]=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 ran... | p02586 |
import sys
input=lambda: sys.stdin.readline().rstrip()
import collections
D=collections.defaultdict(int)
r,c,k=list(map(int,input().split()))
for _ in range(k):
ri,ci,v=list(map(int,input().split()))
ri-=1
ci-=1
D[ri*10**5+ci]=v
DP=[[[0]*4 for _ in range(c+1)] for i in range(r+1)]
for i in range(r+1):
... | import sys
input=lambda: sys.stdin.readline().rstrip()
import collections
D=collections.defaultdict(int)
r,c,k=list(map(int,input().split()))
for _ in range(k):
ri,ci,v=list(map(int,input().split()))
ri-=1
ci-=1
D[ri*10**5+ci]=v
DP0=[[0]*(c+1) for i in range(r+1)]
DP1=[[0]*(c+1) for i in range(r+1)]
D... | p02586 |
import sys
input=lambda: sys.stdin.readline().rstrip()
import collections
D=collections.defaultdict(int)
r,c,k=list(map(int,input().split()))
for _ in range(k):
ri,ci,v=list(map(int,input().split()))
ri-=1
ci-=1
D[ri*10**5+ci]=v
DP0=[[0]*(c+1) for i in range(r+1)]
DP1=[[0]*(c+1) for i in range(r+1)]
D... | import sys
input=lambda: sys.stdin.readline().rstrip()
r,c,k=list(map(int,input().split()))
D=[[0]*c for _ in range(r)]
for _ in range(k):
ri,ci,v=list(map(int,input().split()))
ri-=1
ci-=1
D[ri][ci]=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 ra... | p02586 |
import sys
input = sys.stdin.buffer.readline
r, c, k = list(map(int, input().split()))
graph = [[0] * (c) for _ in range(r)]
for _ in range(k):
d, e, f = list(map(int, input().split()))
graph[d - 1][e - 1] = f
# dijkstra
infi = 10 ** 10
money = [[[-infi] * (4) for _ in range(c)] for _ in ra... | import sys
input = sys.stdin.buffer.readline
r, c, k = list(map(int, input().split()))
graph = [[0] * (c) for _ in range(r)]
for _ in range(k):
d, e, f = list(map(int, input().split()))
graph[d - 1][e - 1] = f
infi = 10 ** 10
money = [[[-infi] * (c) for _ in range(r)] for _ in range(4)]
mon... | p02586 |
while 1:
n=eval(input())
if n==0:break
p=list(map(int,input().split()))
sp=p[0]
ans=[]
for i in range(n-1):
if p[i]+1!=p[i+1]:
if sp!=p[i]:
ans.append(str(sp)+"-"+str(p[i]))
else:
ans.append(str(sp))
sp=p[i+1]
else:
if sp!=p[-1]:
ans.append(str(sp)+"-"+str(p[-1]))
else:
... | while 1:
n=eval(input())
if n==0:break
p=list(map(int,input().split()))+["end"]
sp=p[0]
ans=[]
for i in range(n):
if p[i]+1!=p[i+1]:
if sp!=p[i]:
ans.append(str(sp)+"-"+str(p[i]))
else:
ans.append(str(sp))
sp=p[i+1]
print(" ".join(ans)) | p00637 |
#!/usr/bin/env python3
import sys
MOD = 998244353 # type: int
def comb(n, k):
if k > n:
return 0
k = min(k, n - k)
ret = 1
for i in range(k):
ret *= n - i
ret //= i + 1
return ret
def solve(S: str):
n = len(S)
b_total = 0
b_counts = []
f... | #!/usr/bin/env python3
import sys
MOD = 998244353 # type: int
def comb(n, k):
if k > n:
return 0
k = min(k, n - k)
ret = 1
for i in range(k):
ret *= n - i
ret //= i + 1
return ret
def solve(S: str):
n = len(S)
b_total = 0
b_counts = []
f... | p03134 |
def f(n):
for k, c in list(dic.items()):
a, b = k
if a == n:
if not b in cost or c < cost[b]:
cost[b] = c
elif b == n:
if not a in cost or c < cost[a]:
cost[a] = c
for k, c in sorted(list(cost.items()), key=lambda x: x[1]):... | def f(n, ans):
for k, c in list(dic.items()):
a, b = k
if a == n:
if not b in cost or c < cost[b]:
cost[b] = c
elif b == n:
if not a in cost or c < cost[a]:
cost[a] = c
for k, c in sorted(list(cost.items()), key=lambda x: x... | p00180 |
def f(s, cost, route, ans):
route.append(s)
ans += cost[s]
del cost[s]
for k, c in list(data.items()):
a, b = k
if s == a:
if not b in route:
if not b in cost or c < cost[b]:
cost[b] = c
elif s == b:
if not a ... | def f(s, cost, route, ans):
route.append(s)
ans += cost[s]
del cost[s]
for k, c in list(data.items()):
if s in k:
a, b = k
b = b if s == a else a
if not b in route:
if not b in cost or c < cost[b]:
cost[b] = c
... | p00180 |
m=list(map(int, input().split()))
m.sort()
print(' '.join(map(str, m))) | a=list(map(int,input().split()));a.sort();print(a[0],a[1],a[2]) | p02393 |
#!/usr/bin/env python
# coding: utf-8
def main():
values = [int(x) for x in input().split(" ")]
if values[0] > values[1]:
values[0], values[1] = values[1], values[0]
if values[1] > values[2]:
values[1], values[2] = values[2], values[1]
if values[0] > values[1]:
values[0], values[1] = values[1], val... | if __name__ == '__main__':
a, b, c = list(map(int, input().split()))
if a < b:
if b < c:
print(a, b, c)
elif a < c:
print(a, c, b)
else:
print(c, a, b)
else:
if a < c:
print(b, a, c)
elif b < c:
... | p02393 |
print((" ".join(map(str,sorted([int(i) for i in input().split(" ")]))))) | # encoding:utf-8
input = list(map(int, input().split()))
input.sort()
print((" ".join(map(str, input)))) | p02393 |
#coding:utf-8
import sys
abc=sys.stdin.readline()
nums=abc.split( ' ' )
for i in range( len( nums) ):
nums[i] = int( nums[i] )
nums.sort()
print(( "{} {} {}".format( nums[0], nums[1], nums[2] ) )) | import sys
nums = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
nums = sorted( nums )
print(( "{:d} {:d} {:d}".format( nums[0], nums[1], nums[2] ) )) | p02393 |
x=input().split()
y=list(map(int,x))
a=y[0]
b=y[1]
c=y[2]
d=sorted([a,b,c])
print(("{0} {1} {2}".format(d[0],d[1],d[2]))) | a,b,c=list(map(int,input().split()))
d=[a,b,c]
d.sort()
print(("{0} {1} {2}".format(d[0],d[1],d[2]))) | p02393 |
nums = input().split()
nums = list(map(int, nums))
nums.sort()
print((' '.join(list(map(str, nums))))) | a = sorted(list(map(int, input().split())))
print((' '.join(map(str, a))))
| p02393 |
xs=list(map(int,input().split()))
print((' '.join(map(str, sorted(xs))))) | input_list = list(map(int, input().split()))
print((' '.join(map(str, sorted(input_list)))))
| p02393 |
a,b,c=list(map(int,input().split()))
if(a>b):
tmp=a
a=b
b=tmp
if(b>c):
tmp=b
b=c
c=tmp
if(a>b):
tmp=a
a=b
b=tmp
print(a,b,c) | a,b,c=list(map(int,input().split()))
if(a>b):
tmp=a
a=b
b=tmp
if(b>c):
tmp=b
b=c
c=tmp
if(a>b):
tmp=b
b=a
a=tmp
print(str(a)+" "+str(b)+" "+str(c)) | p02393 |
a = list(map(int, input().split()))
for i in range(len(a)):
j = len(a) - 1
while i < j:
if a[j] < a[j-1]:
t = a[j]
a[j] = a[j-1]
a[j-1] = t
j -= 1
for i in range(len(a)):
if i == len(a) - 1:
print(a[i])
else:
print(a[i], ... | n = [int(i) for i in input().split()]
n = sorted(n)
for i in range(3):
if i == 2:
print(n[i])
else:
print(n[i], end = " ")
| p02393 |
s = input()
nlist = list(map(int, s.split()))
a, b, c= nlist
if a<b:
if b<c:
print('%d %d %d' %(a, b, c))
elif c<a:
print('%d %d %d' %(c, a, b))
else:
print('%d %d %d' %(a, c, b))
else:
if a<c:
print('%d %d %d' %(b, a, c))
elif c<b:
pri... | s = input()
nlist = list(map(int, s.split()))
a, b, c= nlist
#print nlist.sort()
ls = sorted(nlist)
print('%d %d %d' %(ls[0], ls[1], ls[2])) | p02393 |
from collections import deque
n= int(eval(input()))
tab = [[0 for _ in range(n)] for _ in range(n)]
branchdict = {}
for i in range(n-1):
a,b,c= list(map(int,input().split()))
tab[a-1][b-1] = c
tab[b-1][a-1] = c
branchdict[a-1] = branchdict.get(a-1,[]) + [b-1]
branchdict[b-1] = branchdict.ge... | import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
n= int(eval(input()))
bd = [[] for _ in range(n)]
for i in range(n-1):
a,b,c= list(map(int,input().split()))
bd[a-1].append((b-1,c))
bd[b-1].append((a-1,c))
q,k= list(map(int,input().split()))
cost = [0] * n
def dfs(curnode,p... | p03634 |
N = int(eval(input()))
E = [set() for _ in range(N)]
C = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
E[a-1].add(b-1)
E[b-1].add(a-1)
C[a-1][b-1] = c
C[b-1][a-1] = c
Q,K = list(map(int,input().split()))
K -= 1
Query = []
for i in range(Q):
... | import sys
sys.setrecursionlimit(10 ** 6)
N = int(eval(input()))
E = [set() for _ in range(N)]
C = {}
for i in range(N-1):
a,b,c = list(map(int,input().split()))
E[a-1].add(b-1)
E[b-1].add(a-1)
C[min(a-1,b-1)*N+max(a-1,b-1)] = c
Q,K = list(map(int,input().split()))
K -= 1
Query = []
for i in ... | p03634 |
n=int(eval(input()))
INF=9999999999
d=[INF for _ in range(n)]
dist=[[INF for _ in range(n)] for _ in range(n)]
linked=[[] for _ in range(n)]
for i in range(n):
dist[i][i]=0
for i in range(n-1):
a,b,c=list(map(int,input().split()))
dist[a-1][b-1]=c
dist[b-1][a-1]=c
linked[a-1].append(b... | import sys
sys.setrecursionlimit(10**6)
n=int(eval(input()))
INF=9999999999
d=[INF for _ in range(n)]
g=[[] for _ in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
g[a-1].append([b-1,c])
g[b-1].append([a-1,c])
def dfs(v,p,dv):
d[v]=dv
for gi,c in g[v]:
... | p03634 |
import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
n=int(eval(input()))
tree=[[] for i in range(n+1)]
for i in range(n-1):
a,b,c=mp()
... | import sys
from collections import Counter
from collections import deque
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
n=int(eval(input()))
tree=[[] for i in range(n+1)]
for i in range(n-1):
a,b,c=mp()
... | p03634 |
import sys
sys.setrecursionlimit(10**8)
N = int(eval(input()))
a = [[] for i in range(N)]
for i in range(N-1):
A, B, C = list(map(int, input().split()))
a[A-1].append([B-1, C])
a[B-1].append([A-1, C])
dist = [-1]*N
Q, K = list(map(int, input().split()))
dist[K-1] = 0
def dfs(now):
for i, dis_e in ... | import sys
sys.setrecursionlimit(10**8)
N = int(input())
a = [[] for i in range(N)]
for i in range(N-1):
A, B, C = map(int, input().split())
a[A-1].append([B-1, C])
a[B-1].append([A-1, C])
dist = [-1]*N
Q, K = map(int, input().split())
dist[K-1] = 0
def dfs(now):
for i, dis_e in a[now]:
if di... | p03634 |
N = int(eval(input()))
INF = float("inf")
es = [[INF for _ in range(N)] for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int, input().split()))
a,b = a-1, b-1
es[a][b] = c
es[b][a] = c
Q, K = list(map(int, input().split()))
xy = []
for i in range(Q):
x,y = list(map(int, input().... | N = int(eval(input()))
INF = float("inf")
es = [[] for _ in range(N)]
for i in range(N-1):
a,b,c = list(map(int, input().split()))
a,b = a-1, b-1
es[a].append((b,c))
es[b].append((a,c))
Q, K = list(map(int, input().split()))
xy = []
for i in range(Q):
x,y = list(map(int, input().split()... | p03634 |
n = int(eval(input()))
path = [[0 for i in range(n)] for j in range(n)]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
path[min(a-1, b-1)][max(a-1, b-1)] = c
q, k = list(map(int, input().split()))
distance = [None] * n
distance[k-1] = 0
queue = [k-1]
while(len(queue)):
p = qu... | n = int(eval(input()))
path = [[] for i in range(n)]
for i in range(n-1):
a, b, c = list(map(int, input().split()))
path[a-1].append((b-1, c))
path[b-1].append((a-1, c))
q, k = list(map(int, input().split()))
distance = [None] * n
distance[k-1] = 0
queue = [k-1]
while(len(queue)):
p = q... | p03634 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
query = [[0]*N for _ in range(N)]
for _ in range(N-1):
a, b, c = mapint()
query[a-1][b-1] = c
query[b-1][a-1] = c
Q, K = mapint()... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
query = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = mapint()
query[a-1].append((b-1, c))
query[b-1].append((a-1, c))
Q,... | p03634 |
import sys
TO_K = []
TREE = []
DISTANCE = []
def dfs(child, parent):
TO_K[child] = TO_K[parent] + DISTANCE[parent][child]
for i_gch in TREE[child]:
if i_gch == parent:
continue
dfs(i_gch, child)
return
def main():
n = int(eval(input()))
abc = [[in... | import sys
sys.setrecursionlimit(10**9)
TO_K = []
TREE = []
DISTANCE = []
def dfs(child, parent):
for i_node in TREE[parent]:
if i_node[0] == child:
TO_K[child] = TO_K[parent] + i_node[1]
for i_gch in TREE[child]:
if i_gch[0] == parent:
TO_K[child] = TO_K... | p03634 |
import sys
from collections import defaultdict
sys.setrecursionlimit(1000000)
N = int(eval(input()))
edges = [list(map(int, input().split())) for _ in range(N - 1)]
Q, K = list(map(int, input().split()))
graph = defaultdict(set)
for v, w, c in edges:
graph[v].add((w, c))
graph[w].add((v, c))
INF... | from collections import defaultdict
from heapq import heappop, heappush
N = int(eval(input()))
edges = [list(map(int, input().split())) for _ in range(N - 1)]
Q, K = list(map(int, input().split()))
graph = defaultdict(set)
for v, w, c in edges:
graph[v].add((w, c))
graph[w].add((v, c))
dp = [-1] ... | p03634 |
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.de... | #!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.de... | p03634 |
from heapq import heappush,heappop
N = int(eval(input()))
table=[[]for i in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
table[a-1].append([b-1,c])
table[b-1].append([a-1,c])
Q,K=list(map(int,input().split()))
Que=[[int(i) for i in input().split()] for i in range(Q)]
inf=10**... | import sys
input = sys.stdin.readline
from heapq import heappop,heappush
N=int(eval(input()))
table=[[] for i in range(N)]
for i in range(N-1):
a,b,c=list(map(int,input().split()))
a,b=a-1,b-1
table[a].append((b,c))
table[b].append((a,c))
Q,K=list(map(int,input().split()))
query=[[int(i)-1 fo... | p03634 |
import heapq
N = int(eval(input()))
G = [[] for i in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
G[a].append([b, c])
G[b].append([a, c])
Q, K = list(map(int, input().split()))
K -= 1
def dijkstra(x):
d = [float('inf')] * N
d[x]... | import sys
sys.setrecursionlimit(10 ** 9)
N = int(eval(input()))
G = [[] for i in range(N)]
for i in range(N - 1):
a, b, c = list(map(int, input().split()))
a, b = a - 1, b - 1
G[a].append([b, c])
G[b].append([a, c])
Q, K = list(map(int, input().split()))
K -= 1
dist = [-1] * N
dist[K] = 0... | p03634 |
import sys
input=sys.stdin.readline
# 頂点 s からの最短距離を求める (存在しないときはinf)
# n: 頂点数, edge[i]: 頂点 i からの [cost, dst] の list (heapq のため cost が先)
# O(|E|log|V|)
import heapq
def dijkstra(s,n,edge):
d = [float("inf")] * n # s からの距離
d[s] = 0
q = [] # 頂点への距離を管理する。ヒープにする
for e in edge[s]:
heapq.h... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(3*10**5) # 大丈夫か？
N = int(eval(input()))
edge = [[] for i in range(N)]
# edge[i] : 頂点 i から出る経路の [距離,行先] の隣接リスト
for _ in range(N-1):
a,b,c = list(map(int, input().split()))
edge[a-1].append([c,b-1])
edge[b-1].append([c,a-1])
D = [-1]*N # ... | p03634 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()
N = I()
G = {}
for i in range(1,N+1):
G[i] = []
for i in range(N-1):
a,b,c = list(map(int,S().split()))
G[a].append((b,c))
G[b].append((a,c))
Q,K = list(map(int,S().split()))
f... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()
N = I()
G = [[] for i in range(N+1)]
for i in range(N-1):
a,b,c = list(map(int,S().split()))
G[a].append((b,c))
G[b].append((a,c))
Q,K = list(map(int,S().split()))
from collections... | p03634 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()
N = I()
G = [[] for i in range(N+1)]
for i in range(N-1):
a,b,c = list(map(int,S().split()))
G[a].append((b,c))
G[b].append((a,c))
Q,K = list(map(int,S().split()))
from collections... | def main():
import sys
def I():
return int(sys.stdin.readline().rstrip())
def S():
return sys.stdin.readline().rstrip()
N = I()
G = [[] for i in range(N + 1)]
for i in range(N - 1):
a, b, c = list(map(int, S().split()))
G[a].append((b, c))
... | p03634 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
g = []
for i in range(n+1): g.append([])
for i in range(n-1):
a, b, c = na()
g[a].append((b,c))
g[b].append((a,c))
q,k = na()
def dfs(cur,... | import sys
sys.setrecursionlimit(1000001)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
n = ni()
g = []
for i in range(n+1): g.append([])
for i in range(n-1):
a, b, c = na()
g[a].append((b,c))
g[b].append((a,c))... | p03634 |
from collections import deque
n=int(eval(input()))
l=[0]*n
d={}
for i in range(n-1):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
if a in d:
d[a].add((b,c))
else:
d[a]={(b,c)}
if b in d:
d[b].add((a,c))
else:
d[b]={(a,c)}
q,k=list(map(int,inp... | from collections import deque
def main():
n=int(eval(input()))
l=[0]*n
d={}
for i in range(n-1):
a,b,c=list(map(int,input().split()))
a-=1
b-=1
if a in d:
d[a].add((b,c))
else:
d[a]={(b,c)}
if b in d:
d[b... | p03634 |
def main():
from collections import defaultdict
import sys
sys.setrecursionlimit(1000000)
n, *rem = list(map(int, open(0).read().split()))
t = 3 * (n - 1)
abc = rem[:t]
q, k = rem[t], rem[t + 1]
xy = rem[t + 2:]
m = [[] for _ in range(n + 1)]
dist = defaultdict(dict)
... | def main():
from collections import defaultdict
import sys
sys.setrecursionlimit(1000000)
n, *rem = list(map(int, open(0).read().split()))
t = 3 * (n - 1)
abc = rem[:t]
q, k = rem[t], rem[t + 1]
xy = rem[t + 2:]
dist = defaultdict(dict)
for a, b, c in zip(*[iter(abc)]... | p03634 |
# !入力
# グラフの構築
# クエリの入力
# Kからの各点のの距離をdfs
# クエリの処理
from collections import deque
n=int(eval(input()))
edge=[[]for _ in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
edge[a-1].append((b-1,c))
edge[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
dist=[0]*n
seen=[False]*n
... | # !入力
# グラフの構築
# クエリの入力
# Kからの各点のの距離をdfs
# クエリの処理
from collections import deque
n=int(eval(input()))
edge=[[]for _ in range(n)]
for i in range(n-1):
a,b,c=list(map(int,input().split()))
edge[a-1].append((b-1,c))
edge[b-1].append((a-1,c))
q,k=list(map(int,input().split()))
dist=[0]*n
seen=[False]*n
... | p03634 |
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial
sys.setrecursionlimit(200000)
input = sys.stdin.readline
N, = list(map(int, input().split()))
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()]... | import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial
sys.setrecursionlimit(200000)
input = sys.stdin.readline
N, = list(map(int, input().split()))
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()]... | p03634 |
from collections import defaultdict
from heapq import heappop, heappush
class Graph:
def __init__(self):
self.graph = defaultdict(list)
self.vertices = set()
self.edges = []
def add_edge(self, a, b, weight=1):
self.graph[a].append((b, weight))
self.verti... | from collections import deque
N = int(eval(input()))
D = [[] for _ in range(N)]
for _ in range(N-1):
a, b, c = list(map(int, input().split()))
a, b = a-1, b-1
D[a].append((b, c))
D[b].append((a, c))
cnt, K = list(map(int, input().split()))
K -= 1
Q = deque([(K, 0)])
Dist = [0]*N
check = [0... | p03634 |
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
from collections import defaultdict, deque, Counter
from sys import exit
import... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import d... | p03634 |
from queue import Queue
INF=float('inf')
n=int(eval(input()))
g=[[] for _ in range(n)]
for _ in range(n-1):
u,v,w=list(map(int,input().split()))
g[u-1].append((v-1,w))
g[v-1].append((u-1,w))
q,k=list(map(int,input().split()))
ds=[INF]*n
que=Queue()
que.put((k-1,0))
while not que.empty():
... | from queue import Queue
INF=float('inf')
n=int(eval(input()))
g=[[] for _ in range(n)]
for _ in range(n-1):
u,v,w=list(map(int,input().split()))
g[u-1].append((v-1,w))
g[v-1].append((u-1,w))
q,k=list(map(int,input().split()))
ds=[INF]*n
ds[k-1]=0
que=Queue()
que.put((k-1,0))
while not que... | p03634 |
from queue import Queue
INF=float('inf')
n=int(eval(input()))
g=[[] for _ in range(n)]
for _ in range(n-1):
u,v,w=list(map(int,input().split()))
g[u-1].append((v-1,w))
g[v-1].append((u-1,w))
q,k=list(map(int,input().split()))
ds=[INF]*n
ds[k-1]=0
que=Queue()
que.put((k-1,0))
while not que... | from collections import deque
INF=float('inf')
n=int(eval(input()))
g=[[] for _ in range(n)]
for _ in range(n-1):
u,v,w=list(map(int,input().split()))
g[u-1].append((v-1,w))
g[v-1].append((u-1,w))
q,k=list(map(int,input().split()))
ds=[INF]*n
ds[k-1]=0
que=deque()
que.append((k-1,0))
whil... | p03634 |
import sys;sys.setrecursionlimit(int(1e7))
class edge():
def __init__(self,_to,_cost):
self.to = _to;
self.cost = _cost;
N = int(eval(input()))
tree = [[] for i in range(N+1)]
for i in range(N-1):
a,b,c = list(map(int,input().split()))
a = a - 1
b = b - 1
tree[a].app... | import sys;sys.setrecursionlimit(int(1e7))
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
depth = [None]*(N+1)
ABC = [ tuple(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for _ in range(Q)]
for abc in ABC:
tree[abc[0... | p03634 |
import sys;sys.setrecursionlimit(int(1e7))
N = int(eval(input()))
ABC = [list(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in range(Q)]
tree = [[] for _ in range(N+1)]
depth = [None]*(N+1)
for abc in ABC:
tree[abc[0]].appe... | import sys;sys.setrecursionlimit(int(1e7))
N = int(eval(input()))
ABC = [tuple(map(int,input().split())) for _ in range(N-1)]
Q,K = list(map(int,input().split()))
XY = [tuple(map(int,input().split())) for _ in range(Q)]
tree = [[] for _ in range(N+1)]
depth = [None]*(N+1)
for abc in ABC:
tree[abc[0]].ap... | p03634 |
import sys;sys.setrecursionlimit(int(1e7))
from collections import deque
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int,input().split()))
tree[a].append((b,c))
tree[b].append((a,c))
Qn,K = list(map(int,input().split()))
XY = [tuple(map(int,inp... | import sys;sys.setrecursionlimit(int(1e7))
from sys import stdin
from collections import deque
input = stdin.readline
N = int(eval(input()))
tree = [[] for _ in range(N+1)]
for _ in range(N-1):
a, b, c = list(map(int,input().split()))
tree[a].append((b,c))
tree[b].append((a,c))
Qn,K = list(map... | p03634 |
N=int(eval(input()))
from collections import defaultdict
from collections import deque
branch=defaultdict(set)
for i in range(N-1):
a,b,c=list(map(int,input().split()))
branch[a]|={(b,c),}
branch[b]|={(a,c),}
Q,K=list(map(int,input().split()))
dist=[float('inf')]*(N+1)
dist[K]=0
check=deque([K])
... | N=int(eval(input()))
from collections import defaultdict
branch=defaultdict(dict)
for i in range(N-1):
a,b,c=list(map(int,input().split()))
branch[a-1][b-1]=c
branch[b-1][a-1]=c
Q,K=list(map(int,input().split()))
dist=[float('inf') for i in range(N)]
K-=1
dist[K]=0
check={K}
while len(check)>0:
... | p03634 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
g = [[] for _ in range(N+1)]
dist = [[-1]*(N+1) for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
g[a].append([b, c])
g[b].append([a, c])
Q, K = list(map(int, input().split()))
cost = [-1] * (N... | import sys
input = sys.stdin.readline
N = int(eval(input()))
g = [[] for _ in range(N+1)]
for i in range(N-1):
a, b, c = list(map(int, input().split()))
g[a].append([b, c])
g[b].append([a, c])
Q, K = list(map(int, input().split()))
cost = [-1] * (N+1)
cost[K] = 0
temp = [K]
while tem... | p03634 |
import heapq
def dijkstra_heap(s):
d = [float("inf")] * n
used = [True] * n
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:
con... | import heapq
def dijkstra_heap(s):
d = [float("inf")] * n
used = [True] * n #True: not used
d[s] = 0
used[s] = False
edgelist = []
for e in edge[s]:
heapq.heappush(edgelist,e)
while len(edgelist):
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:
... | p03634 |
n = int(eval(input()))
g = {}
for i in range(1,n+1):
g[i] = []
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
g[a].append([b,c])
g[b].append([a,c])
Q,k = list(map(int,input().split()))
q = [list(map(int,input().split())) for _ in range(Q)]
from collections import deque
queue = de... | n = int(eval(input()))
g = {}
from collections import deque
for i in range(1,n+1):
g[i] = deque([])
for _ in range(n-1):
a,b,c = list(map(int,input().split()))
g[a].appendleft([b,c])
g[b].appendleft([a,c])
Q,k = list(map(int,input().split()))
q = [list(map(int,input().split())) for _ in range(... | p03634 |
import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * n # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
continue
for d, u in e[v]:
tmp = d + cost[v]
if tmp < cost[u]:
... | import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * n # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
continue
for d, u in e[v]:
tmp = d + cost[v]
if tmp < cost[u]:
... | p03634 |
#!/usr/bin/env python3
#ABC70 D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from... | #!/usr/bin/env python3
#ABC70 D
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from... | p03634 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.