s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s424698103 | p02241 | u424209323 | 1455029755 | Python | Python | py | Runtime Error | 0 | 0 | 386 | n = int(raw_input())
A = []
p = range(1, n)
a = [[0 for i in range(n)]for j in range(n)]
for i in range(n):
a[i] = map(int, raw_input().split() )
l = 0
while p != []:
a_min = 10000
for i in A:
for j in p:
if 0 <= a[i][j] < a_min:
a_min = a[i][j]
add_A = j
A.append(add_A)
p.remove(add_A)
l += a_min
print l |
s461009668 | p02241 | u233232390 | 1455029826 | Python | Python | py | Runtime Error | 0 | 0 | 402 | def prim(cost):
res = 0
V = len(cost)
mincost = [float("inf")] * V
used = [False] * V
mincost[0] = 0
while True:
v = -1
for u in range(V):
if not used[u] and \
(v == -1 or mincost[u] < mincost[v]):
v = u
if v == -1: break
used[v] = True
res += mincost[v]
for u in range(V):
if cost[v][u] == -1: continue
mincost[u] = min(mincost[u], cost[v][u])
return res |
s178810495 | p02241 | u233232390 | 1455029870 | Python | Python | py | Runtime Error | 0 | 0 | 396 | def prim(cost):
res = 0
V = len(cost)
mincost = [float("inf")] * V
used = [False] * V
mincost[0] = 0
while True:
v = -1
for u in range(V):
if not used[u] and \
(v == -1 or mincost[u] < mincost[v]):
v = u
if v == -1: break
used[v] = True
res += mincost[v]
for u in range(V):
if cost[v][u] == -1: continue
mincost[u] = min(mincost[u], cost[v][u])
return res |
s204591955 | p02241 | u177808190 | 1455029893 | Python | Python | py | Runtime Error | 0 | 0 | 959 | MAX = 100
INF = 1000000
WHITE = 0
GRAY = 1
BLACK = 2
n = int(raw_input())
def prim():
for i in range(n):
d[i] = INF
p[i] = -1
Color[i] = WHITE
d[0] = 0
while True:
minv = INF
u = -1
for i in range(n):
if minv > d[i] and Color[i] != BLACK:
u = i
minv = d[i]
if u == -1:
break
Color[u] = BLACK
for v in range(n):
if Color[v] != BLACK and M[u][v] != INF:
if d[v] > M[u][v]:
d[v] = M[u][v]
p[v] = u
Color[v] = GRAY
sum = 0
for i in range(n):
if p[i] != -1:
sum += M[i][p[i]]
return sum
for i in range(n):
a = map(int, raw_input().split())
for j in range(n):
e = a[j]
if e == -1:
M[i][j] = INF
else:
M[i][j] = e
print prim() |
s860276831 | p02241 | u233232390 | 1455029898 | Python | Python | py | Runtime Error | 0 | 0 | 395 | def prim(cost):
res = 0
V = len(cost)
mincost = [float("inf")] * V
used = [False] * V
mincost[0] = 0
while True:
v = -1
for u in range(V):
if not used[u] and \
(v == -1 or mincost[u] < mincost[v]):
v = u
if v == -1: break
used[v] = True
res += mincost[v]
for u in range(V):
if cost[v][u] == -1: continue
mincost[u] = min(mincost[u], cost[v][u])
return res |
s428420664 | p02241 | u253463900 | 1455031311 | Python | Python3 | py | Runtime Error | 0 | 0 | 1106 | class Node(object):
def __init__(self, V):
self.V = V
self.d = float('inf')
self.p = -1
self.state = -1
# -1 -> undiscovered
# 1 -> finished
# 0 -> found(not finished)
M = [float('inf')] * 5
for i in range(5):
M[i] = [float('inf')] * 5
n = int(input())
nodes = [0] * 100
for i in range(n):
V = [int(x) for x in input().split()]
for (j,m) in enumerate(V):
M[i][j] = m if not m == -1 else float('inf')
nodes[i] = Node([])
nodes[0].d = 0
while True:
mincost = float('inf')
u = -1
for i in range(n):
node = nodes[i]
if (mincost > node.d) and (node.state != 1):
u = i
mincost = node.d
if u == -1:
break
nodes[u].state = 1
for v in range(n):
node = nodes[v]
if (node.state != 1) and (M[u][v] != float('inf')):
if node.d > M[u][v]:
node.d = M[u][v]
node.p = u
node.state = 0
sum = 0
for i in range(n):
if nodes[i].p != -1:
sum += M[i][nodes[i].p]
print(sum) |
s374766446 | p02241 | u613805578 | 1455033015 | Python | Python | py | Runtime Error | 0 | 0 | 763 | n = input()
INF = 10000000
color = [0 for i in xrange(n)]
M = [[INF for i in xrange(n)] for i in xrange(n)]
d = [INF for i in xrange(n)]
p = [-1 for i in xrange(n)]
def m_s_t():
d[0] = 0
while True:
cost = INF
for i in xrange(n):
if color[i] != 2 and d[i] < cost:
cost = d[i]
u = i
if cost == INF:
break
color[u] = 2
for v in xrange(n):
if color[v] != 2 and M[u][v] != INF and M[u][v] < d[v]:
d[v] = M[u][v]
p[v] = u
color[v] = 1
sum = 0
for i in xrange(n):
if p[i] != -1:
sum += M[i][p[i]]
return sum
for i in xrange(n):
G = map(int, raw_input().split())
for j in range(n):
if G[j] != -1:
M[i][j] = G[j]
print m_s_t() |
s678205585 | p02241 | u613805578 | 1455033140 | Python | Python | py | Runtime Error | 0 | 0 | 735 | n = input()
INF = 10000000
color = [0 for i in xrange(n)]
M = [[INF for i in xrange(n)] for i in xrange(n)]
d = [INF for i in xrange(n)]
p = [-1 for i in xrange(n)]
def m_s_t():
d[0] = 0
while True:
cost = INF
for i in xrange(n):
if color[i] != 2 and d[i] < cost:
cost = d[i]
u = i
if cost == INF:
break
color[u] = 2
for v in xrange(n):
if color[v] != 2 and M[u][v] != INF and M[u][v] < d[v]:
d[v] = M[u][v]
p[v] = u
color[v] = 1
sum = 0
for i in xrange(n):
if p[i] != -1:
sum += M[i][p[i]]
return sum
for i in xrange(n):
G = map(int, raw_input().split())
for j in range(n):
if G[j] != -1:
M[i][j] = G[j]
print m_s_t() |
s200150197 | p02241 | u112247126 | 1488596655 | Python | Python3 | py | Runtime Error | 0 | 0 | 937 | def prim():
distance[0] = 0
parent[0] = -1
while True:
mincost = float('inf')
for i in range(n):
if color[i] != 'black' and distance[i] < mincost:
mincost = distance[i]
u = i
if mincost == float('inf'):
break
color[u] = 'black'
for v in range(n):
if color[v] != 'black' and adjMat[u][v] != float('inf'):
if adjMat[u][v] < distance[v]:
distance[v] = adjMat[u][v]
parent[v] = u
color[v] = 'gray'
n = int(input())
color = ['white'] * n
parent = [-1] * n
distance = [float('inf')] * n
adjMat = [[0] * n for _ in range(n)]
for i in range(n):
adjRow = list(map(int, input().split()))
for v in adjRow:
if v == -1:
adjMat[i][v] = float('inf')
else:
adjMat[i][v] = v
prim()
print(sum(distance)) |
s160043084 | p02241 | u498222532 | 1493029667 | Python | Python3 | py | Runtime Error | 0 | 0 | 1067 | def prim(n, M):
color = [0 for _ in range(n)]
d = [5000 for _ in range(n)]
p = [-1 for _ in range(n)]
d[0] = 0
while True:
mincost = 100000
u = -1
for i, dt in enumerate(d):
if dt < mincost and color[i] != 1:
mincost = dt
u = i
# ??´??°???????????£?????´???
if mincost == 100000:
break
color[u] = 1
for v in range(n):
# ????????????, ?????????????¨???????????????¨??????
if M[u][v] != 5000 and color[v] != 1:
if M[u][v] < d[v]:
d[v] = M[u][v]
p[v] = u
all_sum = 0
for i, p_dt in enumerate(p):
if p_dt != -1:
all_sum += M[i][p_dt]
return all_sum
def main():
n = int(input())
M = []
for _ in range(n):
dt = input().split(' ')
M.append([5000 if int(d) == -1 else int(d) for d in dt])
print(M)
answer = prim(n, M)
print(answer)
if __name__ == '__main__':
main() |
s075038588 | p02241 | u498222532 | 1493029832 | Python | Python3 | py | Runtime Error | 0 | 0 | 1053 | def prim(n, M):
color = [0 for _ in range(n)]
d = [5000 for _ in range(n)]
p = [-1 for _ in range(n)]
d[0] = 0
while True:
mincost = 100000
u = -1
for i, dt in enumerate(d):
if dt < mincost and color[i] != 1:
mincost = dt
u = i
# ??´??°???????????£?????´???
if mincost == 100000:
break
color[u] = 1
for v in range(n):
# ????????????, ?????????????¨???????????????¨??????
if M[u][v] != 5000 and color[v] != 1:
if M[u][v] < d[v]:
d[v] = M[u][v]
p[v] = u
all_sum = 0
for i, p_dt in enumerate(p):
if p_dt != -1:
all_sum += M[i][p_dt]
return all_sum
def main():
n = int(input())
M = []
for _ in range(n):
dt = input().split(' ')
M.append([5000 if int(d) == -1 else int(d) for d in dt])
answer = prim(n, M)
print(answer)
if __name__ == '__main__':
main() |
s016793242 | p02241 | u370086573 | 1497676989 | Python | Python3 | py | Runtime Error | 0 | 0 | 768 | INF = 9999
def prim(M):
n = len(M)
color = [0] * n
d = [INF] * n
d[0] = 0
while True:
minv = INF
u = -1
for i in range(n):
# Black:2
if minv > d[i] and color[i] != 2:
u = i
minv = d[i]
if u == -1: break
color[u] = 2
for v in range(n):
if color[v] != 2 and M[u][v] != INF:
if d[v] > M[u][v]:
d[v] = M[u][v]
return sum(d)
if __name__ == '__main__':
n = int(input())
A = []
for i in range(n):
for j in range(n):
src = input()
dst = src.replace('-1', 'INF')
ai = list(map(int, dst.split()))
A.append(ai)
print(prim(A)) |
s129810638 | p02241 | u110280195 | 1498495237 | Python | Python3 | py | Runtime Error | 0 | 0 | 912 | n = int(input())
A = [[int(i) for i in input().split(" ")] for j in range(n)]
dp1={}
for i in range(n):
for j in range(n):
if A[i][j] != -1 :
dp1[(i,j)] = A[i][j]
key = []
value = []
for i,j in sorted(dp1.items(), key=lambda x:x[1]):
key.append(i)
value.append(j)
c_v = []
N = len(key)
len_c_v = 0
ans = 0
itr = 0
while itr != N:
if len_c_v == n:
break
i = key[itr][0]
j = key[itr][1]
if (i in c_v) == False and (j in c_v) == False:
c_v.append(i)
c_v.append(j)
ans += value[itr]
len_c_v += 2
itr += 1
elif (i in c_v) == False:
c_v.append(i)
ans += value[itr]
itr += 1
len_c_v += 1
elif (j in c_v) == False:
c_v.append(j)
ans += value[itr]
itr += 1
len_c_v += 1
else:
itr += 1
if len_c_v != n:
print(-1)
else:
print(ans) |
s241753196 | p02241 | u067677727 | 1498820623 | Python | Python3 | py | Runtime Error | 0 | 0 | 468 | def main():
N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
print(adj)
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print()
if __name__ == "__main__":
main() |
s025946163 | p02241 | u067677727 | 1498820664 | Python | Python3 | py | Runtime Error | 0 | 0 | 445 | def main():
N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print()
if __name__ == "__main__":
main() |
s045729349 | p02241 | u067677727 | 1498820705 | Python | Python3 | py | Runtime Error | 0 | 0 | 458 | def main():
N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print()
return 0
if __name__ == "__main__":
main() |
s999580782 | p02241 | u067677727 | 1498820715 | Python | Python3 | py | Runtime Error | 0 | 0 | 465 | def main():
N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print()
return 0
if __name__ == "__main__":
return main() |
s567620293 | p02241 | u067677727 | 1498820855 | Python | Python3 | py | Runtime Error | 0 | 0 | 333 | N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print() |
s056769906 | p02241 | u067677727 | 1498820880 | Python | Python3 | py | Runtime Error | 0 | 0 | 341 | N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
for j in range(n):
print(adj[i][j], end=" ")
print() |
s525423321 | p02241 | u067677727 | 1498821025 | Python | Python3 | py | Runtime Error | 0 | 0 | 320 | N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
print(" ".join(list(map(str, adj[i])))) |
s619216032 | p02241 | u067677727 | 1498821094 | Python | Python3 | py | Runtime Error | 0 | 0 | 321 | N = 100
n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:] -1
for j in range(k):
adj[u][v[j]] = 1
for i in range(n):
print(" ".join(list(map(str, adj[i])))) |
s998666792 | p02241 | u067677727 | 1498821116 | Python | Python3 | py | Runtime Error | 0 | 0 | 312 | n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:] -1
for j in range(k):
adj[u][v[j]] = 1
for i in range(n):
print(" ".join(list(map(str, adj[i])))) |
s561492911 | p02241 | u067677727 | 1498821177 | Python | Python3 | py | Runtime Error | 0 | 0 | 350 | import sys
n = int(sys.stdin.readline())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, sys.stdin.readline().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:] -1
for j in range(k):
adj[u][v[j]] = 1
for i in range(n):
print(" ".join(list(map(str, adj[i])))) |
s425124181 | p02241 | u067677727 | 1498821359 | Python | Python3 | py | Runtime Error | 0 | 0 | 311 | n = int(input())
adj = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
tmp = list(map(int, input().split()))
u = tmp[0]
u = u -1
k = tmp[1]
v = tmp[2:]
for j in range(k):
adj[u][v[j]-1] = 1
for i in range(n):
print(" ".join(list(map(str, adj[i])))) |
s183957633 | p02241 | u735204496 | 1501217768 | Python | Python | py | Runtime Error | 0 | 0 | 586 | import sys
n = int(sys.stin.readline().strip())
dist = {}
for i in xrange(0, n):
array = map(int, sys.stdin.readline().strip().split(" "))
for (j, d) in enumerate(array):
dist[(i, j)] = d
searched = []
length = 0
target = 0
while len(searched) != n:
searched.append(target)
min_len = 2001
for v in searched:
for i in xrange(0, n):
if (i not in searched) and (min_len > dist[(v, i)]) and (dist[(v, i)] != -1):
min_len = dist[(v, i)]
target = i
length += min_len
print str(length)
|
s118642174 | p02241 | u514487486 | 1501217988 | Python | Python | py | Runtime Error | 0 | 0 | 578 | n = int(raw_input())
matrix = []
for i in range(n):
line = raw_input()
splited = line.split(" ")
splited = map(lambda x: int(x), splited)
matrix.append(splited)
result = 0
candidate = 0
selected = [0]
for i in range(n):
weight = 2001
for item in selected:
for j in range(n):
if matrix[j][item] != -1 and matrix[j][item] < weight and j not in selected:
candidate = j
weight = matrix[j][item]
selected.append(candidate)
if(len(selected) == n + 1):
break
result += weight
print result |
s365154386 | p02241 | u278938795 | 1501219512 | Python | Python3 | py | Runtime Error | 0 | 0 | 871 | import sys
from operator import add
n = int(sys.stdin.readline().strip())
A = [ [0] for i in range(n)]
for i in range(n):
temp = map(int ,sys.stdin.readline().strip().split(" "))
A[i] = temp
weight = [None for i in range(n)]
mitayatu=[False for i in range(n)]
def min(array):
temp = array[1]
index=0
for i in range(n):
if array[i] is not None and mitayatu[i]==False:
if temp>array[i]:
temp == array[i]
index = i
return index
def owari():
for i in mitayatu:
if i is False:
return False
return True
# zero origin
def prim(nodeid):
if owari() == True:
return
if mitayatu[nodeid]==True:
return
mitayatu[nodeid]=True
for i in range(n):
if A[nodeid][i]!=-1:
if weight[i] is None:
weight[i]=A[nodeid][i]
elif weight[i]>A[nodeid][i]:
weight[i]=A[nodeid][i]
prim(min(weight))
weight[0]=0
prim(0)
print reduce(add, weight) |
s939423164 | p02241 | u278938795 | 1501219643 | Python | Python3 | py | Runtime Error | 0 | 0 | 870 | import sys
from operator import add
n = int(sys.stdin.readline().strip())
A = [ [0] for i in range(n)]
for i in range(n):
temp = map(int ,sys.stdin.readline().strip().split(" "))
A[i] = temp
weight = [None for i in range(n)]
mitayatu=[False for i in range(n)]
def min(array):
temp = 100000
index= 0
for i in range(n):
if array[i] is not None and mitayatu[i]==False:
if temp>array[i]:
temp == array[i]
index = i
return index
def owari():
for i in mitayatu:
if i is False:
return False
return True
# zero origin
def prim(nodeid):
if owari() == True:
return
if mitayatu[nodeid]==True:
return
mitayatu[nodeid]=True
for i in range(n):
if A[nodeid][i]!=-1:
if weight[i] is None:
weight[i]=A[nodeid][i]
elif weight[i]>A[nodeid][i]:
weight[i]=A[nodeid][i]
prim(min(weight))
weight[0]=0
prim(0)
print reduce(add, weight) |
s829609989 | p02241 | u798803522 | 1509876786 | Python | Python3 | py | Runtime Error | 0 | 0 | 655 | import heapq
from collections import defaultdict
v_num = int(input())
edges = defaultdict(list)
for i in range(v_num):
data = [int(n) for n in input().split(" ")[1:]]
for j in range(i + 1, v_num):
if data[j] != -1:
edges[i].append([data[j], j])
edges[j].append([data[j], i])
queue = []
heapq.heapify(queue)
for c in edges[0]:
heapq.heappush(queue, c)
visited = {0}
answer = 0
while len(visited) < v_num:
q = heapq.pop(queue)
weight, one = q[0], q[1]
if one in visited:
continue
answer += weight
for e in edges[one]:
heapq.heappush(queue, e)
visited |= {one}
print(answer) |
s737774930 | p02241 | u024715419 | 1511155679 | Python | Python3 | py | Runtime Error | 0 | 0 | 538 | n = int(raw_input())
a = []
for i in range(n):
inp = raw_input()
if "-1" in inp:
inp = inp.replace("-1","10000")
a.append(list(map(int, inp.split())))
w = 0
v = set()
v.add(0)
while len(v) < n:
min_w = 10000
min_idx = 0
i = 0
for node in v:
if min_w > min(a[node]):
min_w = min(a[node])
i = node
min_idx = a[i].index(min_w)
if min_idx in v:
a[i][min_idx] = 10000
continue
else:
w += min_w
v.add(min_idx)
print(w) |
s730296013 | p02241 | u845643816 | 1511963552 | Python | Python3 | py | Runtime Error | 0 | 0 | 602 | n = int(input())
edgeList = []
for i in range(n):
a = list(map(int, input().split()))
for j in range(i):
if a[j] != -1:
edgeList.append([a[j], getRoot(i), getRoot(j)])
rootList = [-1 for i in range(n)]
sumLength = 0
def getRoot(x):
r = rootList[x]
if r < 0:
rootList[x] = x
elif r != x:
rootList[x] = getRoot(r)
return rootList[x]
edgeList.sort(key=lambda x: x[0])
for e in edgeList:
x = getRoot(e[1])
y = getRoot(e[2])
if x != y:
sumLength += e[0]
rootList[x] = rootList[y] = min(x, y)
print(sumLength) |
s709238810 | p02241 | u845643816 | 1511963572 | Python | Python3 | py | Runtime Error | 0 | 0 | 602 | n = int(input())
edgeList = []
def getRoot(x):
r = rootList[x]
if r < 0:
rootList[x] = x
elif r != x:
rootList[x] = getRoot(r)
return rootList[x]
for i in range(n):
a = list(map(int, input().split()))
for j in range(i):
if a[j] != -1:
edgeList.append([a[j], getRoot(i), getRoot(j)])
rootList = [-1 for i in range(n)]
sumLength = 0
edgeList.sort(key=lambda x: x[0])
for e in edgeList:
x = getRoot(e[1])
y = getRoot(e[2])
if x != y:
sumLength += e[0]
rootList[x] = rootList[y] = min(x, y)
print(sumLength) |
s342847981 | p02241 | u626266743 | 1511964742 | Python | Python3 | py | Runtime Error | 0 | 0 | 920 | MAX = 100
INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
d[0] = 0
n = int(input())
M = [[map(int, input().split()) for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == 1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
_sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s303998893 | p02241 | u626266743 | 1511964760 | Python | Python3 | py | Runtime Error | 0 | 0 | 921 | MAX = 100
INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
d[0] = 0
n = int(input())
M = [[map(int, input().split()) for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
_sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s558318401 | p02241 | u626266743 | 1511964844 | Python | Python3 | py | Runtime Error | 0 | 0 | 925 | MAX = 100
INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [[map(int, input().split()) for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
_sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s717568408 | p02241 | u626266743 | 1511965009 | Python | Python3 | py | Runtime Error | 0 | 0 | 947 | MAX = 100
INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [[map(int, input().split()) for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
_sum = sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
return _sum
print(prim()) |
s571308667 | p02241 | u626266743 | 1511965054 | Python | Python3 | py | Runtime Error | 0 | 0 | 931 | MAX = 100
INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [[map(int, input().split()) for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
return sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s762523273 | p02241 | u626266743 | 1511965131 | Python | Python3 | py | Runtime Error | 0 | 0 | 907 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
return sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s290894314 | p02241 | u626266743 | 1511965408 | Python | Python3 | py | Runtime Error | 0 | 0 | 907 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
return sum([M[i][p[i]] for i in range(n) if (p[i] != -1)])
print(prim()) |
s682357793 | p02241 | u626266743 | 1511965514 | Python | Python3 | py | Runtime Error | 0 | 0 | 905 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
d = [INFTY for i in range(n)]
p = [-1 for i in range(n)]
color = [WHITE for i in range(n)]
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
for i in range(n):
for j in range(n):
if (M[i][j] == -1):
M[i][j] = INFTY
def prim():
global M, d, p, color
d[0] = 0
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > M[u][v]):
d[v] = M[u][v]
p[v] = u
color[v] = GRAY
return sum([M[i][p[i]] for i in range(n) if p[i] != -1])
print(prim()) |
s722264711 | p02241 | u782850731 | 1380759224 | Python | Python | py | Runtime Error | 0 | 0 | 644 | #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin, maxint
def main():
num = int(stdin.readline())
M = []
for _ in xrange(num):
M.append([int(s) for s in stdin.readline().split()])
g = set(xrange(1, num+1))
index = g.pop()
h = {index}
weight = 0
while g:_
minimum = maxint
for j in h:
mj = M[j-1]
for i in g:
if 0 <= mj[i-1] < minimum:
index = i
minimum = mj[i-1]
h.add(index)
g.remove(index)
weight += minimum
print(weight)
main() |
s850649533 | p02242 | u920118302 | 1454649985 | Python | Python3 | py | Runtime Error | 0 | 0 | 542 | n = int(input())
G = [[-1] * n] * n
d = [0] * n
for i in range(n):
v = map(int, input().split())
for j in range(v[1]):
G[v[0]][v[2+2*j]] = int(v[3+2*j])
flag = [0] * n
tn = [1]
r = 0
while True:
for i in range(n):
if flag[i] == 0 and i in tn:
flag[i] = 1
d[i] = r
for j in range(n):
if G[i][j] != -1 and flag[j] == 0:
tn.append(j)
if len(tn) == n:
break
r += 1
for i in range(1, n+1):
print(str(i) + " " + str(d[i])) |
s884005094 | p02242 | u038005340 | 1454868779 | Python | Python | py | Runtime Error | 0 | 0 | 710 | INFTY = 100000000
n = int( raw_input() )
graph = {}
for i in range(n):
In = map( int, raw_input().split('') )
a = In[0]
b = In[1]
graph[a] = {}
for j in range(b):
c = In[2+j*2+1]
d = In[2+j*2]
graph[a][d] = c
da = {}
visited = {}
for i in range(n):
da[i] = INFTY
visited[i] = False
s = 0
da[s] = 0
visited[s] = True
while True:
for i in range(n):
if not visited[i] and i in graph[s] and da[i] > da[s] + graph[s][i]:
da[i] = da[s] + graph[s][i]
cost = INFTY
node = -1
for i in range(n):
if not visited[i] and da[i] < cost:
cost = da[i]
node = i
if cost == INFTY:
break
visited[node] = True
s = node
for i in range(n):
print i,da[i] |
s994554670 | p02242 | u038005340 | 1454869019 | Python | Python | py | Runtime Error | 0 | 0 | 710 | INFTY = 100000000
n = int( raw_input() )
graph = {}
for i in range(n):
In = map( int, raw_input().split('') )
a = In[0]
b = In[1]
graph[a] = {}
for j in range(b):
c = In[2+j*2+1]
d = In[2+j*2]
graph[a][d] = c
da = {}
visited = {}
for i in range(n):
da[i] = INFTY
visited[i] = False
s = 0
da[s] = 0
visited[s] = True
while True:
for i in range(n):
if not visited[i] and i in graph[s] and da[i] > da[s] + graph[s][i]:
da[i] = da[s] + graph[s][i]
cost = INFTY
node = -1
for i in range(n):
if not visited[i] and da[i] < cost:
cost = da[i]
node = i
if cost == INFTY:
break
visited[node] = True
s = node
for i in range(n):
print i,da[i] |
s107949078 | p02242 | u038005340 | 1454869298 | Python | Python | py | Runtime Error | 0 | 0 | 710 | INFTY = 100000000
n = int( raw_input() )
graph = {}
for i in range(n):
In = map( int , raw_input().split('') )
u = In[0]
k = In[1]
graph[u] = {}
for j in range(k):
v = In[2+j*2]
c = In[2+j*2+1]
graph[u][v] = c
da = {}
visited = {}
for i in range(n):
da[i] = INFTY
visited[i] = False
s = 0
da[s] = 0
visited[s] = True
while True:
for i in range(n):
if not visited[i] and i in graph[s] and da[i] > da[s] + graph[s][i]:
da[i] = da[s] + graph[s][i]
cost = INFTY
node = -1
for i in range(n):
if not visited[i] and da[i] < cost:
cost = da[i]
node = i
if cost == INFTY:
break
visited[node] = True
s = node
for i in range(n):
print i,da[i] |
s090762260 | p02242 | u038005340 | 1454869339 | Python | Python | py | Runtime Error | 0 | 0 | 706 | INFTY = 100000000
n = int( raw_input() )
graph = {}
for i in range(n):
In = map( int , raw_input().split('') )
u = In[0]
k = In[1]
graph[u] = {}
for j in range(k):
v = In[2+j*2]
c = In[2+j*2+1]
graph[u][v] = c
da = {}
visited = {}
for i in range(n):
da[i] = INFTY
visited[i] = False
s = 0
da[s] = 0
visited[s] = True
while True:
for i in range(n):
if not visited[i] and i in graph[s] and da[i] > da[s] + graph[s][i]:
da[i] = da[s] + graph[s][i]
cost = INFTY
node = -1
for i in range(n):
if not visited[i] and da[i] < cost:
cost = da[i]
node = i
if cost == INFTY: break
visited[node] = True
s = node
for i in range(n):
print i,da[i] |
s190831533 | p02242 | u885467869 | 1455008032 | Python | Python | py | Runtime Error | 0 | 0 | 1124 | def dijkstra(n):
d = [None] * 100
p = [None] * 100
color = [None] * 100
for i in xrange(n):
d[i] = float('inf')
p[i] = -1
color[i] = 0
d[0] = 0
while(True):
minv = float('inf')
u = -1
for i in xrange(n):
if minv > d[i] and color[i] != 2:
u = i
minv = d[i]
if u == -1:
break
color[u] = 2
for v in xrange(n):
if color[v] != 2 and data[u][v] != float('inf'):
if d[v] > d[u] + data[u][v]:
d[v] = d[u] + data[u][v]
p[v] = u
color[v] = 1
for i in xrange(n):
if d[i] == float('inf'):
print '%d %d' % (i, -1)
else:
print '%d %d' % (i, d[i])
n = input()
data = [None] * n
for i in xrange(n):
data[i] = [None] * n
line = map(int, raw_input().split())
for j in xrange(n):
if line[j] == -1:
data[i][j] = float('inf')
else:
data[i][j] = line[j];
dijkstra(n) |
s434272535 | p02242 | u885467869 | 1455008088 | Python | Python | py | Runtime Error | 0 | 0 | 1124 | def dijkstra(n):
d = [None] * 100
p = [None] * 100
color = [None] * 100
for i in xrange(n):
d[i] = float('inf')
p[i] = -1
color[i] = 0
d[0] = 0
while(True):
minv = float('inf')
u = -1
for i in xrange(n):
if minv > d[i] and color[i] != 2:
u = i
minv = d[i]
if u == -1:
break
color[u] = 2
for v in xrange(n):
if color[v] != 2 and data[u][v] != float('inf'):
if d[v] > d[u] + data[u][v]:
d[v] = d[u] + data[u][v]
p[v] = u
color[v] = 1
for i in xrange(n):
if d[i] == float('inf'):
print '%d %d' % (i, -1)
else:
print '%d %d' % (i, d[i])
n = input()
data = [None] * n
for i in xrange(n):
data[i] = [None] * n
line = map(int, raw_input().split())
for j in xrange(n):
if line[j] == -1:
data[i][j] = float('inf')
else:
data[i][j] = line[j];
dijkstra(n) |
s734058413 | p02242 | u078762447 | 1455010919 | Python | Python | py | Runtime Error | 0 | 0 | 626 | n = int(raw_input())
g = [[10000 for i in range(n)]for j in range(n)]
c = [0 for i in range(n)]
d = [10000 for i in range(n)]
p = [-1 for i in range(n)]
d[0] = 0
c[0] = 1
for i in range(n):
g[i] = map(int,raw_input().split())
while 1:
min = 10000
u = -1
for i in range(n):
if c[i] != 2 and d[i] < min:
min = d[i]
u = i
if u == -1:
break
c[u] = 2
for v in range(n):
if c[v] != 2 and g[u][v] != -1:
if d[v] > d[u]+g[u][v]:
d[v] = d[u]+g[u][v]
c[v] = 1
for i in range(n):
print "%d %d" %(i,d[i]) |
s700806665 | p02242 | u619765879 | 1455029430 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s901928955 | p02242 | u619765879 | 1455029466 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s926586965 | p02242 | u619765879 | 1455029610 | Python | Python | py | Runtime Error | 0 | 0 | 417 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s234310512 | p02242 | u619765879 | 1455029625 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s022275078 | p02242 | u619765879 | 1455029717 | Python | Python | py | Runtime Error | 0 | 0 | 686 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i |
s806204115 | p02242 | u619765879 | 1455029729 | Python | Python | py | Runtime Error | 0 | 0 | 679 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '-1' |
s658172899 | p02242 | u619765879 | 1455029752 | Python | Python | py | Runtime Error | 0 | 0 | 543 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for i in range(n):
if d[i]==inf:
print '-1' |
s051868136 | p02242 | u619765879 | 1455029869 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s528279061 | p02242 | u619765879 | 1455029933 | Python | Python | py | Runtime Error | 0 | 0 | 744 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
x = 2+j
y = 3+j
v = int(str[x])
c = int(str[y])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s305879371 | p02242 | u619765879 | 1455029963 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s803051011 | p02242 | u619765879 | 1455029990 | Python | Python | py | Runtime Error | 0 | 0 | 726 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k-1):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s573975607 | p02242 | u619765879 | 1455030162 | Python | Python | py | Runtime Error | 0 | 0 | 734 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
x = j
v = int(str[2+x])
c = int(str[3+x])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s209234030 | p02242 | u619765879 | 1455030211 | Python | Python | py | Runtime Error | 0 | 0 | 680 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s126103351 | p02242 | u619765879 | 1455030219 | Python | Python | py | Runtime Error | 0 | 0 | 665 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s617896316 | p02242 | u619765879 | 1455030253 | Python | Python | py | Runtime Error | 0 | 0 | 714 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s008834152 | p02242 | u619765879 | 1455030369 | Python | Python3 | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s372601710 | p02242 | u619765879 | 1455030479 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s441031415 | p02242 | u619765879 | 1455030612 | Python | Python | py | Runtime Error | 0 | 0 | 724 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[1+j])
c = int(str[2+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s711421077 | p02242 | u619765879 | 1455030619 | Python | Python | py | Runtime Error | 0 | 0 | 720 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[j])
c = int(str[j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s551593897 | p02242 | u619765879 | 1455030716 | Python | Python | py | Runtime Error | 0 | 0 | 725 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in xrange(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s269630369 | p02242 | u619765879 | 1455030768 | Python | Python | py | Runtime Error | 0 | 0 | 729 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = raw_input().split()
u = int(str[0])
k = int(str[1])
for j in range(int(k)):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s453171387 | p02242 | u619765879 | 1455030871 | Python | Python | py | Runtime Error | 0 | 0 | 734 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = int(str[0])
k = int(str[1])
for j in range(k):
v = int(str[2+j])
c = int(str[3+j])
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s458131740 | p02242 | u619765879 | 1455030902 | Python | Python | py | Runtime Error | 0 | 0 | 714 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s000461346 | p02242 | u619765879 | 1455031947 | Python | Python | py | Runtime Error | 0 | 0 | 730 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
# v = str[2+j]
# c = str[3+j]
M[u][str[2+j]] = str[3+j]
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s555508101 | p02242 | u619765879 | 1455032011 | Python | Python | py | Runtime Error | 0 | 0 | 732 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
# v = str[2+j]
# c = str[3+j]
M[u][str[2+j]] = str[3+j]
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s598481139 | p02242 | u619765879 | 1455032063 | Python | Python | py | Runtime Error | 0 | 0 | 725 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
str = []
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s326853702 | p02242 | u619765879 | 1455032150 | Python | Python | py | Runtime Error | 0 | 0 | 747 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
str = [0 for i in range(1000)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s407629534 | p02242 | u619765879 | 1455032184 | Python | Python | py | Runtime Error | 0 | 0 | 716 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+u]
c = str[3+u]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s767829473 | p02242 | u619765879 | 1455032200 | Python | Python | py | Runtime Error | 0 | 0 | 716 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+n]
c = str[3+n]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s325253906 | p02242 | u619765879 | 1455032206 | Python | Python | py | Runtime Error | 0 | 0 | 716 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s441072019 | p02242 | u619765879 | 1455032419 | Python | Python | py | Runtime Error | 0 | 0 | 716 | n = input()
inf = 1000000000
M = [[inf for i in range(n)] for i in range(n)]
for i in range(n):
str = map(int, raw_input().split())
u = str[0]
k = str[1]
for j in range(k):
v = str[2+j]
c = str[3+j]
M[u][v] = c
d = [inf for i in range(n)]
color = [0 for i in range(n)]
d[0] = 0
color[0] = 1
while 1:
minv = inf
u = -1
for i in range(n):
if minv>d[i] and color[i]!=2:
u = i
minv = d[i]
print minv
if u == -1:
break
color[u] = 2
for v in range(n):
if color[v]!=2 and M[u][v]!=inf:
if d[v]>d[u]+M[u][v]:
d[v] = d[u] + M[u][v]
color[v] = 1
for i in range(n):
if d[i]==inf:
print '%d -1' % i
else:
print '%d %d' % (i, d[i]) |
s598452880 | p02242 | u567281053 | 1463712561 | Python | Python | py | Runtime Error | 10 | 6460 | 642 | import sys
def dijkstra(W, n):
U = [i for i in range(1, n)]
D = [W[0][i] for i in range(n)]
D[0] = 0
while len(U) != 0:
mind, minu = 100001, -1
for u in U:
if D[u] < mind:
mind, minu = D[u], u
U.remove(minu)
for i in range(1, n):
D[i] = min(D[i], D[minu] + W[minu][i])
return D
lines = sys.stdin.readlines()
n = int(lines.pop(0))
W = [[100001] * n for _ in range(n)]
for line in lines:
l = map(int, line.split())
for i in range(l[1]):
W[l[0]][l[2 * i + 2]] = l[2 * i + 3]
D = dijkstra(W, n)
for i in range(n):
print i, D[i] |
s773978126 | p02242 | u159356473 | 1481525365 | Python | Python3 | py | Runtime Error | 0 | 0 | 971 | #coding:utf-8
def Dijkestra(G,n):
d=[100000000000]*n
pi=[None]*n
d[0]=0
C=[]
for i in range(n):
C.append(i)
while len(C)!=0:
u=C[0]
for i in range(1,len(C)):
if d[u]>d[i]:
u=i
C.remove(u)
for i in range(len(G[u])):
if G[u][i]==-1:
continue
elif d[i]>d[u]+G[u][i]:
d[i]=d[u]+G[u][i]
pi[i]=u
for i in range(n):
print(i,d[i])
if __name__=="__main__":
n=int(input())
G=[]
for i in range(n):
a=[]
ele=list(map(int,input().split()))
k=ele[1]
t=ele[2:]
v=c=[]
for j in range(k):
v=v+[t[2*j]]
c=c+[t[2*j+1]]
for j in range(n):
if j in v:
a.append(c[v.index(j)])
else:
a.append(-1)
G.append(a)
Dijkestra(G,n) |
s384803642 | p02242 | u159356473 | 1481525416 | Python | Python3 | py | Runtime Error | 0 | 0 | 971 | #coding:utf-8
def Dijkestra(G,n):
d=[100000000000]*n
pi=[None]*n
d[0]=0
C=[]
for i in range(n):
C.append(i)
while len(C)!=0:
u=C[0]
for i in range(1,len(C)):
if d[u]>d[i]:
u=i
C.remove(u)
for i in range(len(G[u])):
if G[u][i]==-1:
continue
elif d[i]>d[u]+G[u][i]:
d[i]=d[u]+G[u][i]
pi[i]=u
for i in range(n):
print(i,d[i])
if __name__=="__main__":
n=int(input())
G=[]
for i in range(n):
a=[]
ele=list(map(int,input().split()))
k=ele[1]
t=ele[2:]
v=c=[]
for j in range(k):
v=v+[t[2*j]]
c=c+[t[2*j+1]]
for j in range(n):
if j in v:
a.append(c[v.index(j)])
else:
a.append(-1)
G.append(a)
Dijkestra(G,n) |
s882997532 | p02242 | u923668099 | 1486721698 | Python | Python3 | py | Runtime Error | 0 | 0 | 1078 | import sys
from math import inf
def debug(x, table):
for name, val in table.items():
if x is val:
print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
return None
def SSSP(n, Adj):
d = [inf] * n
p = [-1] * n
checked = [False] * n
d[0] = 0
checked[0] = True
u = 0
for i in range(n - 1):
for v, cost in Adj[u]:
if d[u] + cost < d[v]:
p[v] = u
d[v] = d[u] + cost
min_n = 0
min_w = inf
for v in range(n):
if not checked[v] and d[v] < min_w:
min_n = v
min_w = d[v]
u = min_n
checked[u] = True
return d
def solve():
n = int(input())
Adj = [[] for i in range(n)]
for i in range(n):
u, k, *line = [int(i) for i in input().split()]
for j in range(k):
Adj[u].append((line[2*j], line[2*j + 1]))
# debug(Adj, locals())
d = SSSP(n, Adj)
for i in range(n):
print(i, d[i])
if __name__ == '__main__':
solve() |
s756636099 | p02242 | u112247126 | 1488598919 | Python | Python3 | py | Runtime Error | 0 | 0 | 1067 | INF = float('inf')
def dijkstra(source):
distance[source] = 0
parent[source] = -1
while True:
mincost = INF
for i in range(n):
if color[i] != 'black' and distance[i] < mincost:
mincost = distance[i]
u = i
if mincost == INF:
break
color[u] = 'black'
for v in range(n):
if color[v] != 'black' and adjMat[u][v] != INF:
if distance[u] + adjMat[u][v] < distance[v]:
distance[v] = distance[u] + adjMat[u][v]
parent[v] = u
color[v] = 'gray'
n = int(input())
color = ['white'] * n
parent = [-1] * n
distance = [INF] * n
adjMat = [[INF] * n for _ in range(n)]
for i in range(n):
inputList = list(map(int, input().split()))
adjRow = inputList[0::2][1:]
weightRow = inputList[1::2][1:]
for v, weight in zip(adjRow, weightRow):
adjMat[i][v] = weight
dijkstra(0)
for index, distance in enumerate(distance):
print('{} {}').format(index, distance) |
s284168656 | p02242 | u370086573 | 1497683026 | Python | Python3 | py | Runtime Error | 0 | 0 | 1073 | def diikstraMethd(G, s):
# ?????????
n = len(G)
# White:0 Gyay:1 Black:2
color = [0 for _ in range(n)]
d = [INF for _ in range(n)]
p = [None for _ in range(n)]
d[s] = 0
while True:
mincost = INF
for i in range(n):
if color[i] != 2 and d[i] < mincost:
mincost = d[i]
u = i
if mincost == INF: break
color[u] = 2
for v in range(n):
if color[v] != 2 and M[u][v] != INF:
if d[u] + M[u][v] < d[v]:
d[v] = d[u] + M[u][v]
p[v] = u
color[u] = 1
return d
if __name__ == '__main__':
n = int(input())
M = [[INF for _ in range(n)] for i in range(n)]
for _ in range(n):
tmp = list(map(int, input().split()))
u = tmp.pop(0)
k = tmp.pop(0)
for _ in range(k):
v = tmp.pop(0)
c = tmp.pop(0)
M[u][v] = c
d = diikstraMethd(M, 0)
for i in range(n):
print('{0} {1}'.format(i, d[i])) |
s614251543 | p02242 | u370086573 | 1497683114 | Python | Python3 | py | Runtime Error | 0 | 0 | 1073 | def diikstraMethd(G, s):
# ?????????
n = len(G)
# White:0 Gyay:1 Black:2
color = [0 for _ in range(n)]
d = [INF for _ in range(n)]
p = [None for _ in range(n)]
d[s] = 0
while True:
mincost = INF
for i in range(n):
if color[i] != 2 and d[i] < mincost:
mincost = d[i]
u = i
if mincost == INF: break
color[u] = 2
for v in range(n):
if color[v] != 2 and M[u][v] != INF:
if d[u] + M[u][v] < d[v]:
d[v] = d[u] + M[u][v]
p[v] = u
color[u] = 1
return d
if __name__ == '__main__':
n = int(input())
M = [[INF for _ in range(n)] for i in range(n)]
for _ in range(n):
tmp = list(map(int, input().split()))
u = tmp.pop(0)
k = tmp.pop(0)
for _ in range(k):
v = tmp.pop(0)
c = tmp.pop(0)
M[u][v] = c
d = diikstraMethd(M, 0)
for i in range(n):
print('{0} {1}'.format(i, d[i])) |
s687183360 | p02242 | u370086573 | 1497683482 | Python | Python3 | py | Runtime Error | 0 | 0 | 1072 | def diikstraMethd(G, s):
# ?????????
n = len(G)
# White:0 Gyay:1 Black:2
color = [0 for _ in range(n)]
d = [INF for _ in range(n)]
p = [None for _ in range(n)]
d[s] = 0
while True:
mincost = INF
for i in range(n):
if color[i] != 2 and d[i] < mincost:
mincost = d[i]
u = i
if mincost == INF: break
color[u] = 2
for v in range(n):
if color[v] != 2 and M[u][v] != INF:
if d[u] + M[u][v] < d[v]:
d[v] = d[u] + M[u][v]
p[v] = u
color[u] = 1
return d
if __name__ == '__main__':
n = int(input())
M = [[INF for _ in range(n)] for i in range(n)]
for _ in range(n):
tmp = list(map(int, input().split()))
u = tmp.pop(0)
k = tmp.pop(0)
for _ in range(k):
v = tmp.pop(0)
c = tmp.pop(0)
M[u][v] = c
d = diikstraMethd(M, 0)
for i in range(n):
print('{0} {1}'.format(i, d[i])) |
s839492334 | p02242 | u370086573 | 1497683576 | Python | Python3 | py | Runtime Error | 0 | 0 | 1072 | def diikstraMethd(G, s):
# ?????????
n = len(G)
# White:0 Gyay:1 Black:2
color = [0 for _ in range(n)]
d = [INF for _ in range(n)]
p = [None for _ in range(n)]
d[s] = 0
while True:
mincost = INF
for i in range(n):
if color[i] != 2 and d[i] < mincost:
mincost = d[i]
u = i
if mincost == INF: break
color[u] = 2
for v in range(n):
if color[v] != 2 and M[u][v] != INF:
if d[u] + M[u][v] < d[v]:
d[v] = d[u] + M[u][v]
p[v] = u
color[u] = 1
return d
if __name__ == '__main__':
n = int(input())
M = [[INF for _ in range(n)] for i in range(n)]
for _ in range(n):
tmp = list(map(int, input().split()))
u = tmp.pop(0)
k = tmp.pop(0)
for _ in range(k):
v = tmp.pop(0)
c = tmp.pop(0)
M[u][v] = c
d = diikstraMethd(M, 0)
for i in range(n):
print('{0} {1}'.format(i, d[i])) |
s003919273 | p02242 | u278938795 | 1501220712 | Python | Python | py | Runtime Error | 0 | 0 | 939 | import sys
from operator import add
n = int(sys.stdin.readline().strip())
A = [ [0] for i in range(n)]
for i in range(n):
temp = map(int ,sys.stdin.readline().strip().split(" "))
A[i] = temp
weight = [None for i in range(n)]
mitayatu=[False for i in range(n)]
def min(array):
temp = 100000
index= 0
for i in range(n):
if array[i] is not None and mitayatu[i]==False:
if temp>=array[i]:
temp = array[i]
index = i
return index
def owari():
for i in mitayatu:
if i is False:
return False
return True
# zero origin
def prim(nodeid):
#print(nodeid)
if owari() == True:
return
if mitayatu[nodeid]==True:
return
mitayatu[nodeid]=True
for i in range(n):
if A[nodeid][i]!=-1:
if weight[i] is None:
weight[i]=A[nodeid][i]
elif weight[i]>A[nodeid][i] and mitayatu[i]==False:
weight[i]=A[nodeid][i]+weight[nodeid]
prim(min(weight))
weight[0]=0
prim(0)
#print(weight)
print(reduce(add, weight)) |
s871191237 | p02242 | u626266743 | 1511966509 | Python | Python3 | py | Runtime Error | 0 | 0 | 895 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [INFTY for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, p, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
print(dijkstra()) |
s499824166 | p02242 | u626266743 | 1511966841 | Python | Python3 | py | Runtime Error | 0 | 0 | 956 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [INFTY for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, p, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
print(str(i) + " " + str(d[i]))
print(dijkstra()) |
s491976968 | p02242 | u626266743 | 1511967070 | Python | Python3 | py | Runtime Error | 0 | 0 | 1002 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [INFTY for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, p, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
if(d[i] = INFTY):
d[i] == -1
print(str(i) + " " + str(d[i]))
dijkstra() |
s694128329 | p02242 | u626266743 | 1511967497 | Python | Python3 | py | Runtime Error | 0 | 0 | 999 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [WHITE for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
if(d[i] = INFTY):
d[i] == -1
print(str(i) + " " + str(d[i]))
dijkstra() |
s403750867 | p02242 | u626266743 | 1511967624 | Python | Python3 | py | Runtime Error | 0 | 0 | 956 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [WHITE for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
print(i, (-1 if d[i] == INFTY else d[i]))
dijkstra() |
s767001448 | p02242 | u626266743 | 1511967664 | Python | Python3 | py | Runtime Error | 0 | 0 | 966 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [WHITE for i in range(n)]
for i in range(n):
u = int(input())
k = int(input())
for j in range(k):
v = int(input())
c = int(input())
M[u][v] = c
def dijkstra():
global M, d, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
print(str(i), (-1 if d[i] == INFTY else str(d[i])))
dijkstra() |
s659709085 | p02242 | u626266743 | 1511967802 | Python | Python3 | py | Runtime Error | 0 | 0 | 933 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
for u in range(0, n):
U = list(map(int, input().split()[2:]))
for j in range(0, len(U), 2):
M[u][U[j]] = U[j + 1]
d = [INFTY for i in range(n)]
color = [WHITE for i in range(n)]
def dijkstra():
global M, d, color, n
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
print(str(i), (-1 if d[i] == INFTY else str(d[i])))
dijkstra() |
s571765034 | p02242 | u626266743 | 1511967976 | Python | Python3 | py | Runtime Error | 0 | 0 | 939 | INFTY = 1 << 21
WHITE = 0
GRAY = 1
BLACK = 2
n = int(input())
M = [list(map(int, input().split())) for i in range(n)]
d = [INFTY for i in range(n)]
color = [WHITE for i in range(n)]
for u in range(n):
U = list(map(int, input().split()[2:]))
for j in range(0, len(U), 2):
M[u][U[j]] = U[j + 1]
def dijkstra():
global M, d, color
d[0] = 0
color[0] = GRAY
while(1):
minv = INFTY
u = -1
for i in range(n):
if (minv > d[i] and color[i] != BLACK):
u = i
minv = d[i]
if (u == -1):
break
color[u] = BLACK
for v in range(n):
if (color[v] != BLACK and M[u][v] != INFTY):
if (d[v] > d[u] + M[u][v]):
d[v] = d[u] + M[u][v]
color[v] = GRAY
for i in range(n):
print(str(i), (-1 if d[i] == INFTY else str(d[i])))
dijkstra() |
s425467275 | p02242 | u845643816 | 1511968256 | Python | Python3 | py | Runtime Error | 0 | 0 | 697 | rootList = [-1 for i in range(n)]
parent = [0 for i in range(n)]
lenList = [0 for i in range(n)]
def getRoot(x):
r = rootList[x]
if r < 0:
rootList[x] = x
elif r != x:
rootList[x] = getRoot(r)
return rootList[x]
edgeList.sort(key=lambda x: x[0])
flag = True
while flag:
flag = False
for e in edgeList: # weight:e[0], e[1]->e[2]
if e[2] == 0:
continue
x = getRoot(e[1])
y = getRoot(e[2])
if x == 0 != y:
parent[e[2]] = e[1]
lenList[e[2]] += lenList[e[1]] + e[0]
rootList[y] = 0
flag = True
break
for i, j in zip(range(n), lenList):
print(i, j) |
s237321306 | p02242 | u845643816 | 1511968276 | Python | Python3 | py | Runtime Error | 0 | 0 | 668 | rootList = [-1 for i in range(n)]
parent = [0 for i in range(n)]
lenList = [0 for i in range(n)]
def getRoot(x):
r = rootList[x]
if r < 0:
rootList[x] = x
elif r != x:
rootList[x] = getRoot(r)
return rootList[x]
edgeList.sort(key=lambda x: x[0])
flag = True
while flag:
flag = False
for e in edgeList:
if e[2] == 0:
continue
x = getRoot(e[1])
y = getRoot(e[2])
if x == 0 != y:
parent[e[2]] = e[1]
lenList[e[2]] += lenList[e[1]] + e[0]
rootList[y] = 0
flag = True
break
for i, j in zip(range(n), lenList):
print(i, j) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.