input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def abc079_d():
inp = iter(map(int, read().split()))
H, W = next(inp), next(inp)
adj_mtx = [[next(inp) for _ in range(10)] for _ in range(10)]
grid = [[next(inp) for _ in range(W... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def abc079_d():
inp = iter(map(int, read().split()))
H, W = next(inp), next(inp)
adj_mtx = [[next(inp) for _ in range(10)] for _ in range(10)]
grid = [[next(inp) for _ in range(W... | p03546 |
def warshall_floyd(graph):
num_v = len(graph)
for k in range(num_v):
for i in range(num_v):
for j in range(num_v):
graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])
return graph
h, w = list(map(int, input().split()))
route = []
for i in range(10):
... | def warshall_floyd(graph):
num_v = len(graph)
for k in range(num_v):
for i in range(num_v):
for j in range(num_v):
graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])
return graph
H, W = list(map(int, input().split()))
items = []
for i in range(10):
... | p03546 |
from collections import deque
h, w = [int(x) for x in input().split()]
c = [[int(x) for x in input().split()] for line in range(10)]
a = [[int(x) for x in input().split()] for line in range(h)]
for t in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
... | h, w = [int(x) for x in input().split()]
c = [[int(x) for x in input().split()] for l in range(10)]
a = [[int(x) for x in input().split()] for l in range(h)]
for t in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[... | p03546 |
from collections import defaultdict
from itertools import product
H, W = list(map(int, input().split()))
c = [[int(x) for x in input().split()] for _ in range(10)]
A = defaultdict(int)
for _ in range(H):
for x in input().split():
x = int(x)
if x != -1 and x != 1:
A[x] += 1
... | from collections import defaultdict
from itertools import product
H, W = list(map(int, input().split()))
c = [[int(x) for x in input().split()] for _ in range(10)]
A = defaultdict(int)
for _ in range(H):
for x in input().split():
x = int(x)
if x != -1 and x != 1:
A[x] += 1
... | p03546 |
# h*wのマスにかかれているそれぞれの数字の位置は関係ないしどうでもいい
# それぞれの数がどれだけあるかに興味がある
# iから1に至る最小値を全探索 間に合うのか？ まあいけるやろ
h, w = list(map(int, input().split()))
table = []
for _ in range(10):
table.append(list(map(int, input().split())))
wall = {}
for _ in range(h):
x = list(map(int, input().split()))
for v in x:
... | # ワーシャルフロイドで解くバージョン
h, w = list(map(int, input().split()))
INF = 10 ** 10
table = [[INF] * 10 for _ in range(10)]
for i in range(10):
column = list(map(int, input().split()))
for j in range(10):
if i == j:
continue
table[i][j] = column[j]
wall = {}
for _ in range(h):
... | p03546 |
#!/usr/bin/env python3
import sys
def solve(H: int, W: int, c: "List[List[int]]", A: "List[List[int]]"):
#print(*c, sep='\n')
for _ in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
c[i][j] = min(c[i][j], c[i][k]+c[k][j]... | #!/usr/bin/env python3
import sys
def solve(H: int, W: int, c: "List[List[int]]", A: "List[List[int]]"):
#print(*c, sep='\n')
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k]+c[k][j])
#print(*c, sep='\n')
cost = 0... | p03546 |
import heapq
H, W = list(map(int, input().split()))
edges = [[] for _ in range(10)]
for i in range(10):
e_list = list(map(int, input().split()))
for j in range(10):
if j == i:
continue
edges[i].append([j, e_list[j]])
A = []
for i in range(H):
A.append(list(map(int, inp... | import heapq
H, W = list(map(int, input().split()))
edges = [[] for _ in range(10)]
for i in range(10):
e_list = list(map(int, input().split()))
for j in range(10):
if j == i:
continue
edges[i].append([j, e_list[j]])
A = []
for i in range(H):
A.append(list(map(int, inp... | p03546 |
H,W=list(map(int,input().split()))
C=[]
for i in range(10):
c=list(map(int,input().split()))
C.append(c)
decide=set()
INF=10**9
cost=[INF]*10
def check(cost):
for i in cost:
if i==INF:
return True
return False
while(check(cost)):
l=-1
m=INF
for j in range(... | H,W=list(map(int,input().split()))
d=[]
for i in range(10):
l=list(map(int,input().split()))
d.append(l)
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j]=min(d[i][j],d[i][k]+d[k][j])
ans=0
for i in range(H):
l=list(map(int,input().split()))
for j in l:
if j==-1:
... | p03546 |
# coding: utf-8
import queue
INF = 10000000
q = queue.PriorityQueue()
#初期化
G = []
kabe = []
H, W = list(map(int, input().split()))
#入力
for i in range(10):
G.append(list(map(int, input().split())))
for i in range(H):
kabe.append(list(map(int, input().split())))
lenList = [INF for i in rang... | # coding: utf-8
import queue
INF = 10000000
#初期化
G = []
kabe = []
H, W = list(map(int, input().split()))
#入力
for i in range(10):
G.append(list(map(int, input().split())))
for i in range(H):
kabe.append(list(map(int, input().split())))
lenList = [INF for i in range(10)]
q = queue.PriorityQ... | p03546 |
import sys
input = sys.stdin.readline
from collections import Counter
from itertools import chain
def readlines(n):
for _ in range(n):
yield list(map(int, input().split()))
def main():
h, w = list(map(int, input().split()))
C = [[int(c) for c in input().split()] for _ in range(10)]
... | import sys
input = sys.stdin.readline
def readlines(n):
for _ in range(n):
yield list(map(int, input().split()))
def main():
h, w = list(map(int, input().split()))
C = list(readlines(10))
for k in range(10):
for i in range(10):
for j in range(10):
... | p03546 |
import math
st=input().split()
H=int(st[0]);W=int(st[1])
c=[[0 for i in range(10)] for i in range(10)]
A=[[0 for i in range(W)]for i in range(H)]
for i in range(10):
st=input().split()
for j in range(10):
c[i][j]=int(st[j])
for i in range(H):
st=input().split()
for j in range(W):
... | H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(10)]
A=[list(map(int,input().split())) for i in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
if c[i][j]>c[i][k]+c[k][j]:
c[i][j]=c[i][k]+c[k][j]
ans=0
for i in range(H):
for j in ... | p03546 |
def warshall_floyd(cost):
# cost[i][j] : iからjへの最短距離
for k in range(10):
for i in range(10):
for j in range(10):
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
return cost
h, w = list(map(int, input().split()))
cost = [list(map(int, input().split())) for... | def main():
h, w = list(map(int, input().split()))
c = [[int(x) for x in input().split()] for _ in range(10)]
a = [[int(x) for x in input().split()] for _ in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] ... | p03546 |
def main():
h, w = list(map(int, input().split()))
c = [[int(x) for x in input().split()] for _ in range(10)]
a = [[int(x) for x in input().split()] for _ in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] ... | def main():
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
a = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[... | p03546 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p03546 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03546 |
import sys
def main():
input = sys.stdin.readline
H, W = list(map(int, input().split()))
C = [[int(c) for c in input().split()] for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
dp = [[10**4] * 10 for _ in range(10)]
for i in range(10):
for j in rang... | import sys
def warshall_floyd(d):
n = len(d)
for i in range(n):
for j in range(n):
for k in range(n):
d[j][k] = min(d[j][k], d[j][i] + d[i][k])
return d
def main():
input = sys.stdin.readline
H, W = list(map(int, input().split()))
C = [[int(c)... | p03546 |
H,W=list(map(int,input().split()))
A = [list(map(int, input().split())) for _ in range(10)]
for a in range(10):
for b in range(10):
for c in range(10):
A[b][c]=min(A[b][c],A[b][a]+A[a][c])
ans=0
D=[]
for j in range(H):
C=list(map(int,input().split()))
D.append(C)
... | H,W=list(map(int,input().split()))
list1=[]
for i in range(10):
A=list(map(int,input().split()))
list1.append(A)
for c in range(10):
for a in range(10):
for b in range(10):
if list1[a][b]>list1[a][c]+list1[c][b]:
list1[a][b]=list1[a][c]+list1[c][b]
... | p03546 |
# -*- coding: utf-8 -*-
import sys
import heapq
H,W=list(map(int,input().split()))
#隣接リスト
c=[[] for i in range(10)]
for i in range(10):
a=list(map(int,input().split()))
for j in range(10):
c[i].append(a[j])
#print c
A=[]
for i in range(H):
A.append(list(map(int, input().split())))
#print A
... | # -*- coding: utf-8 -*-
import sys
import heapq
H,W=list(map(int,input().split()))
#隣接リスト
c=[[] for i in range(10)]
for i in range(10):
a=list(map(int,input().split()))
for j in range(10):
c[i].append(a[j])
#print c
A=[]
for i in range(H):
A.append(list(map(int, input().split())))
#print A
... | p03546 |
import heapq
def dijkstra(s):
hq = [(0, s)]
heapq.heapify(hq) # リストを優先度付きキューに変換
cost = [float('inf')] * 10 # 行ったことのないところはinf
cost[s] = 0 # 開始地点は0
while hq:
c, v = heapq.heappop(hq)
if c > cost[v]: # コストが現在のコストよりも高ければスルー
continue
for d, u in e[v]:
... | def floyd_warshall(dist):
v = len(dist)
for k in range(v):
for i in range(v):
for j in range(v):
dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j])
h,w = list(map(int,input().split()))
c = [list(map(int,input().split())) for _ in range(10)]
floyd_warshall(c)
A = [l... | p03546 |
import copy
def main():
H,W = list(map(int, input().split()))
c = [[int(i) for i in input().split()] for i in range(10)]
a = [[int(i) for i in input().split()] for i in range(H)]
#d = copy.deepcopy(c)
# ワーシャルフロイド法
for k in range(10):
for i in range(10):
for j in ... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
H,W = list(map(int, readline().split()))
C = [[int(i) for i in readline().split()] for _ in range(10)]
A = [[int(i) for i in readline().split()] for _ in range(H)]
# 頂点kを経由する場合としない場合を比較... | p03546 |
def JOI14_B():
N = I()
A = [I()for _ in range(N)]
A.extend(A)
dp = [[0]*(N*2+1) for _ in range(N*2+1)]
for j in range(N):
for i in range(N*2-j):
if (N-j)%2==1:
dp[i][i+j] = max(dp[i+1][i+j]+A[i],dp[i][i+j-1]+A[i+j])
else:
if... | def examA():
O = SI()
E = SI()
ans = ""
for i in range(len(O)+len(E)):
if i%2==0:
ans += O[i//2]
else:
ans += E[i//2]
print(ans)
return
def examB():
A = LI()
A.sort()
ans = (A[2] - A[0]) // 2 + (A[2] - A[1]) // 2
if (A[2]-A... | p03546 |
INFTY = 10**4
H,W = list(map(int,input().split()))
C = [list(map(int,input().split())) for _ in range(10)]
A = [list(map(int,input().split())) for _ in range(H)]
d = [[INFTY for _ in range(10)] for _ in range(10)]
for i in range(10):
for j in range(10):
d[i][j] = C[i][j]
for k in range(10):
f... | INFTY = 10**5
H,W = list(map(int,input().split()))
C = [list(map(int,input().split())) for _ in range(10)]
A = [list(map(int,input().split())) for _ in range(H)]
dist = [[INFTY for _ in range(10)] for _ in range(10)]
for i in range(10):
dist[i][i] = 0
for i in range(10):
for j in range(10):
dis... | p03546 |
INFTY = 10**4+10
H,W = list(map(int,input().split()))
C = [list(map(int,input().split())) for _ in range(10)]
cost = [[INFTY for _ in range(10)] for _ in range(10)]
for i in range(10):
for j in range(10):
cost[i][j] = C[i][j]
for k in range(10):
for i in range(10):
for j in range(10):
... | H,W = list(map(int,input().split()))
C = [list(map(int,input().split())) for _ in range(10)]
A = [list(map(int,input().split())) for _ in range(H)]
dist = [[0 for _ in range(10)] for _ in range(10)]
for i in range(10):
for j in range(10):
dist[i][j] = C[i][j]
for k in range(10):
for i in range(1... | p03546 |
from heapq import heappush, heappop
def dijkstra(s):
'''
始点sから各頂点への最短距離を求める
'''
d = [float("inf")] * 10
d[s] = 0
used = [False] * 10
used[s] = True
edgelist = []
for e in edge[s]:
heappush(edgelist, e)
while edgelist:
cost, v = heappop(edgelis... | def warshall_floyd():
'''
すべての頂点間の最短距離を求める
'''
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
h, w = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
a = [list... | p03546 |
inf = 1000
h,w = list(map(int,input().split()))
dp = []
for i in range(10):
c = list(map(int,input().split()))
dp.append(c)
for k in range(10):
for i in range(10):
for j in range(10):
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j])
ans = 0
A = [list(map(int, input().split()))... | h,w = list(map(int,input().split()))
C = []
for i in range(10):
C.append(list(map(int,input().split())))
def warshall_floyd(d):
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
trans_map = warsh... | p03546 |
h,w = list(map(int,input().split()))
c = [[int(i) for i in input().split()] for _ in range(10)]
a = [[int(i) for i in input().split()] for _ in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j],c[i][k]+c[k][j])
ans = 0
for i in range(h):
... | h,w = list(map(int,input().split()))
c = [[int(i) for i in input().split()] for _ in range(10)]
a = [[int(i) for i in input().split()] for _ in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
mp = [c[i][1] for i ... | p03546 |
import heapq
def dijkstra_heap(s,C):
#始点sから各頂点への最短距離
d = [float("inf")] * 10
used = [False] * 10
d[s] = 0
used[s] = True
edgelist = []
#edgelist : (sからの暫定(未確定)最短距離,頂点)のリスト
#edge[s] : sから出る枝の(重み,終点)の配列
for i,w in enumerate(C[s]):
heapq.heappush(edgelist,[w,i]) #sの隣の点は枝の重さがそのまま暫定最短距離となる
... | #Warshall Floyd
H, W = list(map(int, input().split()))
def solve():
d = []
for i in range(10): #ひとまず枝があるペアは枝の長さをセット
d.append(list(map(int, input().split())))
A=[0]*H
for i in range(H):
A[i] = list(map(int, input().split()))
#三重ループ
for k in range(10):
for ... | p03546 |
import heapq
H, W = list(map(int, input().split()))
graph = []
wall = []
for _ in range(10):
graph.append(list(map(int, input().split())))
for _ in range(H):
wall += list(map(int, input().split()))
def dijkstra(s):
INF = 10**5
hq = [(0, s)]
heapq.heapify(hq)
cost = [INF] * 10
cost[s] ... | H, W = list(map(int, input().split()))
C = []
wall = []
for _ in range(10):
C.append(list(map(int, input().split())))
for _ in range(H):
wall += list(map(int, input().split()))
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k]+C[k][j])
ans = 0
... | p03546 |
h,w = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(10)]
a = [list(map(int,input().split())) for i in range(h)]
ans = 0
for rep in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
if l[i][j] > l[i][k]+l[k][j]:
... | h,w = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(10)]
a = [list(map(int,input().split())) for i in range(h)]
ans = 0
for k in range(10):
for i in range(10):
for j in range(10):
if l[i][j] > l[i][k]+l[k][j]:
l[i][j] = l[i][k]+l[k][j]
... | p03546 |
magialist=[]
datalist=[]
h,w=list(map(int,input().split()))
for i in range(10):
add=list(map(int,input().split()))
magialist.append(add)
for j in range(h):
add1=list(map(int,input().split()))
datalist.extend(add1)
storelist=[[[[] for i in range(10)] for i in range(10)] for i in range(10)]
... | h,w=list(map(int,input().split()))
d=[list(map(int,input().split())) for _ in range(10)]
e=[list(map(int,input().split())) for _ in range(h)]
def warshall_floyd(d,n):
#d[i][j]=i番目の頂点からj番目の頂点までの最短距離
for k in range(n+1):
for i in range(n+1):
for j in range(n+1):
d[i][j]... | p03546 |
from sys import stdin
import math
import bisect
from collections import defaultdict
def IL():return list(map(int, stdin.readline().split()))
def ItoSList(): return list(map(int,list(stdin.readline())))
def IL_reverse():return list(map(int, stdin.readline().split())).reverse()
def Int_all():return list(map(int,... | from heapq import heappush, heappop
def dijkstra(adjList, s):
num = len(adjList)
dist = [float("INF") for i in range(10)]
queue = []
heappush(queue,(0,s))
dist[s] = 0
while queue != []:
v_cost, v = heappop(queue)
if dist[v] < v_cost:
continue
... | p03546 |
import queue
from heapq import heappush, heappop
class Graph:
INF = float('inf')
def __init__(self,v_num,is_directed = False):
self.is_directed = is_directed
self.v_num = v_num
self.E = []
self.v_s_list = [[] for i in range(self.v_num)]
def appe... | H,W = list(map(int,input().split()))
e_list = [[] for i in range(10)]
for i in range(10):
c = list(map(int,input().split()))
for j in range(10):
if i!=j:
e_list[i].append([j,c[j]])
A = [list(map(int,input().split())) for i in range(H)]
#dijkstra
#you need to prepare e_list = [... | p03546 |
import heapq
h, w = list(map(int, input().split()))
graph = [list(map(int, input().split())) for _ in range(10)]
trans_graph = list(zip(*graph))
next_nodes = []
for idx, d in enumerate(trans_graph[1]):
next_nodes.append((d, idx))
heapq.heapify(next_nodes)
INF = 10**9
decided = [0]*10
decided[1] = 1
... | import heapq
h, w = list(map(int, input().split()))
graph = [list(map(int, input().split())) for _ in range(10)]
trans_graph = list(zip(*graph))
next_nodes = []
for idx, d in enumerate(trans_graph[1]):
next_nodes.append((d, idx))
heapq.heapify(next_nodes)
INF = 10**9
decided = [0]*10
decided[1] = 1
d... | p03546 |
# coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float('inf')] * 10
def bellman_ford(s):
d[s] = 0
for i in range(10):
for j in range(10):
for k in range(... | # coding: utf-8
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
d = [float('inf')] * 10
d[1] = 0
for i in range(10):
for j in range(10):
for k in range(10):
if d[j] != float('... | p03546 |
import copy
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
# cost = [[-1]*10 for i in range(10)]
# for j in range(10):
# cost[j] = [[c[i][j], i] for i in range(10)]
cost = [-1]*10
cost[1] = 0
dp = [[-... | import copy
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
# cost = [[-1]*10 for i in range(10)]
# for j in range(10):
# cost[j] = [[c[i][j], i] for i in range(10)]
cost = [-1]*10
cost[1] = 0
dp = [[-... | p03546 |
h,w = list(map(int,input().split()))
d = [list(map(int,input().split())) for i in range(10)]
for t in range(10):
for i in range(10):
for j in range(10):
for k in range(10):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
arr = [list(map(int,input().split())) for i in range(h)]
print(sum(sum(d[a][1] if a>=... | h,w = list(map(int,input().split()))
d = [list(map(int,input().split())) for i in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
arr = [list(map(int,input().split())) for i in range(h)]
print(sum(sum(d[a][1] if a>=0 else 0 for a in aa)... | p03546 |
def calc_mp(C, candidates, n, ans):
for i in range(len(candidates)):
candidates2 = [c for c in candidates]
c = candidates[i]
del candidates2[i]
a = C[n][c]
if c != 1:
a += calc_mp(C, candidates2, c, ans)
ans = min(a, ans)
return ans
def mai... | def calc_mp(C, d):
for k in range(10):
for i in range(10):
for j in range(10):
if k == 0:
d[i][j][k] = min(C[i][j], C[i][k] + C[k][j])
else:
d[i][j][k] = min(d[i][j][k-1], d[i][k][k-1] + d[k][j][k-1])
def main():
... | p03546 |
h, w = list(map(int, input().split()))
d = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(h)]
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j] = ... | H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
def warshall_floyd(d):
#d[i][j]: iからjへの最短距離
for k in range(10):
for i in range(10):
for j in range(10):
d[i][j] = ... | p03546 |
#!/usr/bin/env python3
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans =... | #!/usr/bin/env python3
import itertools
H, W = list(map(int, input().split()))
c = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] +... | p03546 |
H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for _ in range(10)]
A = [list(map(int, input().split())) for _ in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for i in range(H):
... | H, W = list(map(int, input().split()))
C = [list(map(int, input().split())) for i in range(10)]
A = [list(map(int, input().split())) for i in range(H)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j] = min(C[i][j], C[i][k] + C[k][j])
ans = 0
for i in range(H):
... | p03546 |
# coding: utf-8
# Your code here!
H,W = [int(i) for i in input().split()]
c=[[int(i) for i in input().split()] for _ in range(10)]
A=[[int(i) for i in input().split()] for _ in range(H)]
dist = c
n=10
#n: 頂点数
for k in range(n):
for i in range(n):
for j in range(n):
dist[i][j] = m... | # coding: utf-8
# Your code here!
H,W = [int(i) for i in input().split()]
c=[[int(i) for i in input().split()] for _ in range(10)]
A=[[int(i) for i in input().split()] for _ in range(H)]
dist = c
n=10
#n: 頂点数
for k,dk in enumerate(dist):
for di in dist:
for j in range(n):
if di[j... | p03546 |
import collections
import heapq
h, w = list(map(int, input().split()))
cs = [list(map(int, input().split())) for _ in range(10)]
counter = collections.Counter()
for _ in range(h):
for x in map(int, input().split()):
if x != -1:
counter[x] += 1
dists = [float('inf') for i in range(10... | import collections
h, w = list(map(int, input().split()))
cs = [list(map(int, input().split())) for _ in range(10)]
counter = collections.Counter()
for _ in range(h):
for x in map(int, input().split()):
if x != -1:
counter[x] += 1
for k in range(10):
for i in range(10):
... | p03546 |
h,w=list(map(int,input().split()))
tra=[list(map(int,input().split())) for i in range(10)]
ll=[[tra[i][j] for j in range(10)] for i in range(10)]
for i in range(10**3-1):
for i in range(10):
for j in range(10):
if i!=j:
ll[i][j]=min(ll[i][j],min(ll[i][o]+tra[o][j] for o in... | class WarshallFloyd:
#O(V^3)で任意２頂点の最短距離
def __init__(self,n,_first_index=0):
self.v = n
self._first_idx=_first_index
self.d = [[float("INF")]*(n) for _ in range(n)]
for i in range(n):
self.d[i][i] = 0
def path(self,x,y,c):
if x == y:
... | p03546 |
h,w=list(map(int,input().split()))
C=[list(map(int,input().split())) for i in range(10)]
A=[list(map(int,input().split())) for j in range(h)]
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j]=min(C[i][j],C[i][k]+C[k][j])
cost=[C[i][1] for i in range(10)]
cnt=0
for i in... | h,w=list(map(int,input().split()))
C=[list(map(int,input().split())) for i in range(10)]
A=[list(map(int,input().split())) for j in range(h)]
#warshall_floyd法:最短経路を全探索で求める
for k in range(10):
for i in range(10):
for j in range(10):
C[i][j]=min(C[i][j],C[i][k]+C[k][j])
cost=[C[i][1] for... | p03546 |
import sys
input = sys.stdin.readline
INF = float("inf")
def f(c, pos, unused, sum_c):
if pos == 1:
return sum_c
ret = INF
l = unused[:]
l.remove(pos)
for next_n in l:
res = f(c, next_n, l, sum_c + c[pos][next_n])
if res < ret:
ret = res
ret... | import sys
input = sys.stdin.readline
INF = float("inf")
def warshall_floyd(n, d):
for k in range(n):
for i in range(n):
d_ik = d[i][k]
if d_ik == INF:
continue
for j in range(n):
if d[i][j] > d_ik + d[k][j]:
... | p03546 |
import sys
input = sys.stdin.readline
INF = float("inf")
def warshall_floyd(n, d):
for k in range(n):
for i in range(n):
d_ik = d[i][k]
if d_ik == INF:
continue
for j in range(n):
if d[i][j] > d_ik + d[k][j]:
... | import sys
input = sys.stdin.readline
INF = float("inf")
def warshall_floyd(n, d):
for k in range(n):
for i in range(n):
d_ik = d[i][k]
# if d_ik == INF:
# continue
for j in range(n):
if d[i][j] > d_ik + d[k][j]:
... | p03546 |
H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
for x in input().split():
x = int(x)
if x != -1:
ans += c[x][1]
print(an... | H,W=list(map(int,input().split()))
c=[list(map(int,input().split())) for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
c[i][j] = min(c[i][j], c[i][k] + c[k][j])
ans = 0
for _ in range(H):
ans += sum([c[x][1] for x in map(int,input().split()) if x != -1])
print(ans)
| p03546 |
H,W=list(map(int,input().split()))
co=[]
c=[0]*10
for i in range(10):
temp=list(map(int,input().split()))
co.append(temp)
f=True
while f:
f=False
for i in range(10):
for j in range(10):
temp=[]
for k in range(10):
if co[i][k]<co[i][j] and ... | H,W=list(map(int,input().split()))
co=[]
c=[0]*10
for i in range(10):
temp=list(map(int,input().split()))
co.append(temp)
for k in range(10):
for i in range(10):
for j in range(10):
temp=[]
if co[i][j] > co[i][k] + co[k][j]:
co[i][j] = co[i][k] ... | p03546 |
def d_wall(H, W, C, A):
cost=C
for k in range(10):
for i in range(10):
for j in range(10):
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
ans = 0
for i in range(H):
for j in range(W):
if A[i][j] != -1:
ans += cost[A... | def d_wall(H, W, C, A):
# cost[i][j]には最終的に数字iからjに移行するための最小コストが格納される
cost = [x[:] for x in C]
# ワーシャルフロイド法で最小コストを計算
for k in range(10):
for i in range(10):
for j in range(10):
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j])
ans = 0
# 壁の各数字ごとにコス... | p03546 |
H, W = list(map(int, input().split()))
change_costs = [list(map(int, input().split())) for _ in range(10)]
# change_costsは9*9のコスト
for k in range(10):
for i in range(10):
for j in range(10):
# print(k, i, j)
change_costs[i][j] = min(change_costs[i][j], change_costs[i][k] ... | H, W = list(map(int, input().split()))
costs = [list(map(int, input().split())) for _ in range(10)]
nums = [0 for _ in range(10)]
for k in range(10):
for i in range(10):
for j in range(10):
costs[i][j] = min(costs[i][j], costs[i][k] + costs[k][j])
ans = 0
for i in range(H):
fo... | p03546 |
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
H, W = list(map(int, readline().split()))
C = [list(map(int, readline().split())) for _ in range(10)]
A = li... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
H, W = list(map(int, readline().split()))
C = [list(map(int, readline().split())) for _ in range(10)]
A = list(map(int, read().split()))
... | p03546 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
# vy += x_num
init_adj_table[vx].append(vy)
return init_adj_ta... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(... | p02378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
from collections import deque
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
# vy += x_num
init_adj_table[vx].appen... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(... | p02378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].append(vy)
return init_adj_table
def graph_dfs(... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].add(vy)
return init_adj_table
def graph_dfs(cur... | p02378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].add(vy)
return init_adj_table
def graph_dfs(cur... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].add(vy)
return init_adj_table
def graph_dfs(cur... | p02378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def generate_adj_table(_edges):
for edge in _edges:
vx, vy = list(map(int, edge))
init_adj_table[vx].add(vy)
return init_adj_table
def graph_dfs(cur... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def graph_dfs(current, matching, visited):
for target in range(y_num):
if (not visited[target]) and (target in adj_table[current]):
visited[target] = True
... | p02378 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def dfs(current, matching, visited):
for target in range(y_num):
if not visited[target] and target in adj_table[current]:
visited[target] = True
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 4 6
0 0
0 2
0 3
1 1
2 1
2 3
output:
3
"""
import sys
def dfs(current, matching, visited):
for target in range(y_num):
if not visited[target] and target in adj_table[current]:
visited[target] = True
... | p02378 |
import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | p02378 |
import sys
from queue import deque
sys.setrecursionlimit(200000)
def hierarchize(source):
global hierarchy
hierarchy = [-1] * n
queue = deque([(0, source)])
while queue:
h, v = queue.popleft()
if hierarchy[v] != -1:
continue
hierarchy[v] = h
... | def dfs(s):
return _dfs(s, set())
def _dfs(v, visited):
for u in edges[v]:
if u in visited:
continue
visited.add(u)
if matched[u] == -1 or _dfs(matched[u], visited):
matched[u] = v
return True
return False
xn, yn, e = list(map(in... | p02378 |
f=0
while 1:
n=eval(input())
if n==0: break
if f>0: print()
N=[""]*n
C=[0]*n
for i in range(n):
s=input()
p=s.index(" ")
N[i]=s[:p]
a,b,c=list(map(int,s[p+1:].split(" ")))
C[i]=(i,a*3+c)
C=sorted(C,key=lambda x:(-x[1],x[0]))
for e in C: print("".join([N[e[0]],",",str(e[... | f=0
while 1:
n=eval(input())
if n==0: break
if f>0: print()
C=[()]*n
for i in range(n):
s=input()
p=s.index(" ")
a,b,c=list(map(int,s[p+1:].split(" ")))
C[i]=(i,a*3+c,s[:p])
C=sorted(C,key=lambda x:(-x[1],x[0]))
for e in C: print(e[2]+","+str(e[1]))
f=1 | p00124 |
f=0
while 1:
n=eval(input())
if n==0: break
C=[()]*n
for i in range(n):
s=input()
p=s.index(" ")
a,b,c=list(map(int,s[p+1:].split(" ")))
C[i]=(i,a*3+c,s[:p])
C=sorted(C,key=lambda x:(-x[1]))
if f>0: print()
for e in C: print(e[2]+","+str(e[1]))
f=1 | f=0
while 1:
n=eval(input())
if n==0: break
C=[()]*n
for i in range(n):
s=input().split(" ")
C[i]=(i,int(s[1])*3+int(s[3]),s[0])
C=sorted(C,key=lambda x:(-x[1]))
if f>0: print()
for e in C: print(e[2]+","+str(e[1]))
f=1 | p00124 |
import random,time
H=int(eval(input()))
#P=[i for i in range(2**(H-1))]
#random.shuffle(P)
P=list([int(x)-1 for x in input().split()])
mod=10**9+7
inv=pow(2,mod-2,mod)
L=2**(H-1)
base_t=[1 for i in range(1+1<<H)]
base_t[0]=0
for i in range(2,1+1<<H):
base_t[i]=i*base_t[i>>1]
base_t[i]%=mod
... | #import random,time
H=int(eval(input()))
#P=[i for i in range(2**(H-1))]
#random.shuffle(P)
P=list([int(x)-1 for x in input().split()])
mod=10**9+7
inv=pow(2,mod-2,mod)
L=2**(H-1)
base_t=[1 for i in range(1+1<<H)]
base_t[0]=0
for i in range(2,1+1<<H):
base_t[i]=i*base_t[i>>1]
base_t[i]%=mod
... | p02591 |
c=1
while 1:
W=int(eval(input()))
if W==0:break
n=int(eval(input()))
dp=[0]*(W+1)
for i in range(n):
v,w = list(map(int, input().split(',')))
for j in range(W,w-1,-1):
dp[j]=max(dp[j-w]+v,dp[j])
for i in range(W+1):
if dp[W]==dp[i]:break
print(... | c=1
while 1:
W=int(eval(input()))
if W==0:break
dp=[0]*(W+1)
for i in range(int(eval(input()))):
v,w=list(map(int, input().split(',')))
for j in range(W,w-1,-1):
if dp[j]<dp[j-w]+v:dp[j]=dp[j-w]+v
for i in range(W+1):
if dp[W]==dp[i]:break
print(('C... | p00042 |
c=0
for W in iter(input,'0'):
c+=1
W=int(W)
dp=[0]*-~W
for _ in[0]*int(eval(input())):
v,w=list(map(int,input().split(',')))
for i in range(W,w-1,-1):
if dp[i]<dp[i-w]+v:dp[i]=dp[i-w]+v
for i in range(W+1):
if dp[W]==dp[i]:print(f'Case {c}:\n{dp[W]}\n{i}');break
| c=0
for W in iter(input,'0'):
c+=1
W=int(W)
dp=[0]*-~W
for _ in[0]*int(eval(input())):
v,w=list(map(int,input().split(',')))
for i in range(W,w-1,-1):
if dp[i]<dp[i-w]+v:dp[i]=dp[i-w]+v
print(f'Case {c}:\n{dp[W]}\n{dp.index(dp[W])}')
| p00042 |
c=0
for W in iter(input,'0'):
c+=1
W=int(W)
d=[0]*-~W
for _ in[0]*int(eval(input())):
v,w=list(map(int,input().split(',')))
for i in range(W,w-1,-1):
if d[i]<d[i-w]+v:d[i]=d[i-w]+v
print(f'Case {c}:\n{d[W]}\n{d.index(d[W])}')
| def f():
c=0
for W in iter(input,'0'):
c+=1
W=int(W)
d=[0]*-~W
for _ in[0]*int(eval(input())):
v,w=list(map(int,input().split(',')))
for i in range(W,w-1,-1):
if d[i]<d[i-w]+v:d[i]=d[i-w]+v
print(f'Case {c}:\n{d[W]}\n{d.index(d[W])}')
if'__main__'==__name__:f()
| p00042 |
case = 0
while True:
case += 1
W = int(eval(input()))
if (W == 0):
break
N = int(eval(input()))
vl = [0]
wl = [0]
for i in range(N):
(v,w) = tuple(map(int,input().split(",")))
vl.append(v)
wl.append(w)
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(1,N+... | """
0-1ナップザック
dp[i][j]...i個目までの宝で重さjの時の価値の最大
wi = wlst[i]...i個目の重さ
vi = vlst[i]...i個目の価値
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - wi] + vi) (wi <= j)
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (wi > j)
"""
def main():
case = 0
while True:
w = int(eval(... | p00042 |
"""
0-1ナップザック
dp[i][j]...i個目までの宝で重さjの時の価値の最大
wi = wlst[i]...i個目の重さ
vi = vlst[i]...i個目の価値
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - wi] + vi) (wi <= j)
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (wi > j)
"""
def main():
case = 0
while True:
w = int(eval(... | """
0-1ナップザック
wi = wlst[i]...i個目の重さ
vi = vlst[i]...i個目の価値
2次元
dp[i][j]...i個目までの宝で重さjの時の価値の最大
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - wi] + vi) (wi <= j)
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (wi > j)
or
dp[j]...重さjの時の価値の最大
temp...1つ前のdp
dp[j] = max(dp[... | p00042 |
"""
0-1ナップザック
wi = wlst[i]...i個目の重さ
vi = vlst[i]...i個目の価値
2次元
dp[i][j]...i個目までの宝で重さjの時の価値の最大
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - wi] + vi) (wi <= j)
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (wi > j)
or
dp[j]...重さjの時の価値の最大
temp...1つ前のdp
dp[j] = max(dp[... | """
0-1ナップザック
wi...i個目の重さ
vi...i個目の価値
2次元
dp[i][j]...i個目までの宝で重さjの時の価値の最大
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - wi] + vi) (wi <= j)
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (wi > j)
1次元
dp[j]...重さjの時の価値の最大
dp[j] = max(dp[j], dp[j - wi] + vi) (wi <= j <... | p00042 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from itertools import *
from sys import *
def solve(n,w):
lp,lw = [],[]
for i in range(n):
s = list(map(int, input().split(",")))
lp.append(s[0])
lw.append(s[1])
mp = mw = 0
for e in product([0,1],repeat=n):
cw = sum([ lw[i] for i in ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
from itertools import *
from sys import *
def solve(n,w):
lp,lw = [],[]
for i in range(n):
s = list(map(int, input().split(",")))
lp.append(s[0])
lw.append(s[1])
c = [-1]*(w+1)
c[0] = 0
for i in range(n):
for j in reversed(range(w)... | p00042 |
cnt=0
while True:
cnt+=1
W=int(eval(input()))
if W==0:
break
n=int(eval(input()))
dp=[0]*(W+1)
for i in range(n):
v,w=list(map(int,input().split(',')))
for j in range(W,w-1,-1):
dp[j]=max(dp[j],dp[j-w]+v)
wgt=0
for i in range(W+1):
... | cnt=0
while True:
cnt+=1
W=int(eval(input()))
if W==0:
break
n=int(eval(input()))
dp=[0]*(W+1)
for i in range(n):
v,w=list(map(int,input().split(',')))
for j in range(W,w-1,-1):
dp[j]=max(dp[j],dp[j-w]+v)
wgt=0
md=max(dp)
for i in ran... | p00042 |
class Knapack(object):
def __init__(self, data, limit):
self.limit = limit
data_size = len(data)
self.C = [[0]*(limit+1) for _ in range(data_size+1)]
self.data = data[:]
def solve(self):
for i in range(1, len(self.data)+1):
i_value = self.data[i-1][0... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0042
??\?£?
"""
class Knapack(object):
def __init__(self, data, limit):
self.limit = limit
data_size = len(data)
self.C = [[0]*(limit+1) for _ in range(data_size+1)]
self.data = data[:]... | p00042 |
# AOJ 0042 A Thief
# Python3 2018.6.22 bal4u
MAX = 1003
for cno in range(1, 100):
lim = int(input())
if lim == 0: break
print("Case ", cno, ":", sep='')
N = int(input())
vw = [(0, 0)]
for i in range(N):
v, w = list(map(int, input().split(',')))
vw.append((v, w))
V = [[0 for j in range(MAX)]... | # AOJ 0042 A Thief
# Python3 2018.6.22 bal4u
MAX = 1003
for cno in range(1, 100):
lim = int(input())
if lim == 0: break
print("Case ", cno, ":", sep='')
N = int(input())
V = [[0 for j in range(MAX)] for i in range(2)]
W = [[0 for j in range(MAX)] for i in range(2)]
k1, k2 = 0, 1
for i in range(... | p00042 |
c =0
while True:
W = eval(input())
if W==0: break
dt = [0]*1001
c +=1
N = eval(input())
m = 0
n = 0
for i in range(N):
p,w = eval(input())
for w0 in range(W+1)[::-1]:
p0 = dt[w0]
if w0==0 or p0!=0:
w1 = w0+w
... | def f():
p,w = eval(input())
for w0 in R[w:]:
w1,p1 = w0+w,dt[w0]+p
if dt[w1]<p1: dt[w1]=p1
return
c = 0
while 1:
W = eval(input())
if W==0: break
R = list(range(W+1))[::-1]
dt = [0]*1001
c += 1
N = eval(input())
for i in range(N): f()
m = max... | p00042 |
n, d = list(map(int, input().split()))
xy = []
for i in range(n):
a, b = list(map(int, input().split()))
xy.append([a, b])
count = [xi**2 + yi**2 <= d**2 for xi, yi in xy]
print((sum(count))) | n, d = list(map(int, input().split()))
xy = 0
for i in range(n):
xi, yi = list(map(int, input().split()))
xy += xi**2 + yi**2 <= d**2
print(xy) | p02595 |
from math import sqrt
def main():
N, D = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
if sqrt(P[i][0]**2 + P[i][1]**2) <= D:
ans += 1
print(ans)
main() | def main():
from math import sqrt
N, D = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
if sqrt(P[i][0]**2 + P[i][1]**2) <= D:
ans += 1
print(ans)
main() | p02595 |
def main():
from math import sqrt
N, D = list(map(int, input().split()))
P = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N):
if sqrt(P[i][0]**2 + P[i][1]**2) <= D:
ans += 1
print(ans)
main() | def main():
N, D = list(map(int, input().split()))
ans = 0
for i in range(N):
x, y = list(map(int, input().split()))
if x**2 + y**2 <= D**2:
ans += 1
print(ans)
main() | p02595 |
n,d = list(map(int, input().split()))
dotCount = 0
for i in range(n):
#print(i)
x,y = list(map(int, input().split()))
if d*d >= x*x + y*y:
dotCount += 1
print(dotCount)
| n,d = list(map(int, input().split()))
dotCount = 0
square_d = d*d
for i in range(n):
#print(i)
x,y = list(map(int, input().split()))
if square_d >= x*x + y*y:
dotCount += 1
print(dotCount)
| p02595 |
n,d = list(map(int, input().split()))
dotCount = 0
square_d = d*d
for i in range(n):
#print(i)
x,y = list(map(int, input().split()))
if square_d >= x**2 + y**2:
dotCount += 1
print(dotCount)
| coordinate_number,distance = list(map(int, input().split()))
within_distance = 0
square_distance = distance*distance
for i in range(coordinate_number):
x,y = list(map(int, input().split()))
if square_distance >= x*x + y*y:
within_distance += 1
print(within_distance)
| p02595 |
# B - Distance
from math import sqrt
def main():
N, D, *XY = list(map(int, open(0).read().split()))
res = sum(sqrt(x ** 2 + y ** 2) <= D for x, y in zip(*[iter(XY)] * 2))
print(res)
if __name__ == "__main__":
main()
| # B - Distance
def main():
N, D, *XY = list(map(int, open(0).read().split()))
res = sum(x ** 2 + y ** 2 <= D ** 2 for x, y in zip(*[iter(XY)] * 2))
print(res)
if __name__ == "__main__":
main()
| p02595 |
import math
n,d = list(map(int,input().split()))
cnt = 0
for i in range(n):
x,y= list(map(int,input().split()))
if math.sqrt(x**2+y**2) <= d:
cnt += 1
print(cnt) | n,d = list(map(int,input().split()))
cnt = 0
for i in range(n):
x,y = list(map(int,input().split()))
if (x**2 + y**2)**0.5 <= d:
cnt += 1
print(cnt)
| p02595 |
n,d = list(map(int, input().split()))
c=0
for i in range(n):
x,y = list(map(int, input().split()))
if x ** 2 + y ** 2<= d ** 2:
c += 1
print(c) | n,d = list(map(int, input().split()))
c=0
for i in range(n):
x,y = list(map(int, input().split()))
if x * x + y * y <= d * d:
c += 1
print(c) | p02595 |
def resolve():
N, D = list(map(int, input().split()))
P = [list(map(int, input().split())) for x in range(N)]
cnt = 0
for p in P:
d = (p[0] ** 2 + p[1] ** 2) ** 0.5
if d <= D:
cnt += 1
print(cnt)
resolve() | def resolve():
N, D = list(map(int, input().split()))
cnt = 0
for n in range(N):
x, y = list(map(int, input().split()))
d = (x ** 2 + y ** 2) ** 0.5
if d <= D:
cnt += 1
print(cnt)
resolve() | p02595 |
n, d = list(map(int,input().split()))
ans =0
for i in range(n):
x, y = list(map(int,input().split()))
if pow((x**2+y**2),0.5)<=d:
ans += 1
print(ans) | import sys
N, D = list(map(int, input().split()))
cnt = 0
for s in sys.stdin.readlines():
x, y = list(map(int, s.split()))
d = pow(x, 2) + pow(y, 2)
cnt += (d <= pow(D, 2))
print(cnt) | p02595 |
N,D=list(map(int,input().split()))
a=0
d=D**2
for i in range(N):
x,y=list(map(int,input().split()))
if x**2+y**2<=d:
a+=1
print(a)
| import sys
def input():
return sys.stdin.readline()[:-1]
N,D=list(map(int,input().split()))
a=0
d=D**2
for i in range(N):
x,y=list(map(int,input().split()))
if x**2+y**2<=d:
a+=1
print(a)
| p02595 |
import math
N,D =[int(x) for x in input().split()]
X = []
Y = []
for i in range(N):
x,y = [int(x) for x in input().split()]
X.append(x)
Y.append(y)
ans = 0
for i in range(N):
r = math.sqrt(X[i] ** 2 + Y[i] ** 2)
if r <= D:
ans += 1
print(ans) | N,D =[int(x) for x in input().split()]
ans = 0
for i in range(N):
x,y = [int(x) for x in input().split()]
if x * x + y * y <= D * D:
ans += 1
print(ans) | p02595 |
n,d=list(map(int,input().split()))
print((sum(eval("(("+input().replace(" ",")**2+(")+")**2)**0.5<=d") for _ in range(n)))) | n,d=list(map(int,input().split()))
print((sum(eval("(("+input().replace(" ",")**2+(")+")**2)")**0.5<=d for _ in range(n)))) | p02595 |
N, D = list(map(int, input().split()))
count = 0
for i in range(N):
a, b = list(map(int, input().split()))
if (a**2 + b**2) <= D**2:
count += 1
print(count)
| N, D = list(map(int, input().split()))
count = 0
for i in range(N):
a, b = list(map(int, input().split()))
if (a*a + b*b) <= D*D:
count += 1
print(count)
| p02595 |
import math
N, D = list(map(int, input().split()))
X_Y = []
for i in range(N):
X_Y.append(list(map(int, input().split())))
ans = 0
for n in range(N):
x, y = X_Y[n]
if(math.sqrt(x**2 + y**2) <= D): ans += 1
print(ans) | N, D = list(map(int, input().split()))
X_Y = []
for i in range(N):
X_Y.append(list(map(int, input().split())))
ans = 0
for n in range(N):
x, y = X_Y[n]
# ルートを計算すると計算誤差が生じるので、距離の2乗を比較する
if(x**2 + y**2 <= D*D): ans += 1
print(ans) | p02595 |
N, D = list(map(int, input().split()))
ans = 0
for i in range(N):
x, y = list(map(int, input().split()))
dist = pow((x * x + y * y), 0.5)
# print(dist)
if dist <= D:
ans += 1
print(ans)
| N, D = list(map(int, input().split()))
ans = 0
for i in range(N):
x, y = list(map(int, input().split()))
# dist = pow((x * x + y * y), 0.5)
dist = (x * x + y * y)
# print(dist)
if dist <= D*D:
ans += 1
print(ans)
| p02595 |
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
import math
n,d = list(map(int, input().split()))
ans = 0
for i in range(n):
x, y = list(map(int, input().spli... | #k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
n, d = list(map(int, input().split()))
ans = 0
for i in range(n):
x, y = list(map(int, input().split()))
i... | p02595 |
n, d=list(map(int, input().split()))
cnt=0
for i in range(n):
x, y=list(map(int, input().split()))
tmp=(x**2 +y**2)**0.5
if tmp<=d:
cnt+=1
print(cnt) | n, d=list(map(int, input().split()))
cnt=0
for i in range(n):
x, y=list(map(int, input().split()))
tmp=x**2 + y**2
if tmp<=d**2:
cnt+=1
print(cnt) | p02595 |
N, D = [int(v) for v in input().split()]
ans = 0
for _ in range(N):
x, y = [int(v) for v in input().split()]
if (x**2 + y**2) ** 0.5 <= D:
ans += 1
print(ans) | N, D = [int(v) for v in input().split()]
D = D*D
ans = 0
for _ in range(N):
x, y = [int(v) for v in input().split()]
if (x**2 + y**2) <= D:
ans += 1
print(ans) | p02595 |
from decimal import Decimal
n, d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(Decimal, input().split()))
if (x**2 + y**2).sqrt() <= d:
res += 1
print(res)
| n, d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if (x**2 + y**2)**0.5 <= d:
res += 1
print(res)
| p02595 |
n, d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if (x**2 + y**2)**0.5 <= d:
res += 1
print(res)
| n, d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if x**2 + y**2 <= d**2:
res += 1
print(res) | p02595 |
N, D = list(map(int, input().split()))
P = [tuple(map(int, input().split())) for i in range(N)]
ans = 0
for p, q in P:
if p * p + q * q <= D * D:
ans += 1
print(ans)
| N, D = list(map(int, input().split()))
P = [tuple(map(int, input().split())) for i in range(N)]
print((sum([p * p + q * q <= D * D for p, q in P])))
| p02595 |
# Author: Amey Bhavsar
# ID: bhavsar
# IDE: Geany/Ubuntu
# Platform: AtCoder Beginner Contest 174
from math import sqrt, floor, pi, cos, sin, log, log2
# n=map(int,input().split())
n,m=list(map(int,input().split()))
ans = 0
for i in range(n):
x,y=list(map(int,input().split()))
if (sqrt(x*x + y*y)... | n, d = list(map(int, input().split()))
d *= d
cnt = 0
for i in range(n):
x,y=list(map(int,input().split()))
if (x*x + y*y <= d): cnt+=1
print(cnt)
| p02595 |
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力を取得
N, D = list(map(int, input().split()))
X, Y = [], []
for n in range(N):
X_n, Y_n = list(map(int, input().split()))
X.append(X_n)
Y.append(Y_n)
# 求解処理
def get_distance(p: int, q: int) -> float:
return math.sqrt(math.pow(p, 2)... | # -*- coding: utf-8 -*-
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力
"""
N, D = list(map(int, input().split()))
X, Y = [], []
for n in range(N):
X_n, Y_n = list(map(int, input().split()))
X.append(X_n)
Y.append(Y_n)
re... | p02595 |
import math
a,b = list(map(int,input().split()))
s = 0
l = [ list(map(int,input().split(" "))) for i in range(a)]
for i in range(a):
if math.sqrt(l[i][0]**2+l[i][1]**2)<=b:
s = s+1
print(s)
| e=0
a,b=list(map(int,input().split()))
l = [ list(map(int,input().split(" "))) for i in range(a)]
for i in range(a):
if l[i][0]**2+l[i][1]**2<=b**2:
e=e+1
print(e) | p02595 |
n, d = list(map(int, input().split()))
x, y = list(zip(*[list(map(int, input().split())) for i in range(n)]))
ans = 0
for i in range(n):
if (x[i]**2 + y[i]**2)**0.5 <= d:
ans += 1
print(ans) | n, d = list(map(int, input().split()))
x, y = list(zip(*[list(map(int, input().split())) for i in range(n)]))
ans = 0
for i in range(n):
if x[i]**2 + y[i]**2 <= d**2:
ans += 1
print(ans) | p02595 |
def main():
n,d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if (x**2+y**2)**.5 <= d:
res += 1
print(res)
main() | import sys
input = sys.stdin.readline
def main():
n,d = list(map(int, input().split()))
res = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if (x**2+y**2)**.5 <= d:
res += 1
print(res)
main() | p02595 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.