message stringlengths 2 49.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 446 108k | cluster float64 13 13 | __index_level_0__ int64 892 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie has recently found undirected weighted graphs with the following properties very interesting:
* The graph is connected and contains exactly n vertices and m edges.
* All edge weights... | instruction | 0 | 23,505 | 13 | 47,010 |
Yes | output | 1 | 23,505 | 13 | 47,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie has recently found undirected weighted graphs with the following properties very interesting:
* The graph is connected and contains exactly n vertices and m edges.
* All edge weights... | instruction | 0 | 23,506 | 13 | 47,012 |
No | output | 1 | 23,506 | 13 | 47,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie has recently found undirected weighted graphs with the following properties very interesting:
* The graph is connected and contains exactly n vertices and m edges.
* All edge weights... | instruction | 0 | 23,507 | 13 | 47,014 |
No | output | 1 | 23,507 | 13 | 47,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie has recently found undirected weighted graphs with the following properties very interesting:
* The graph is connected and contains exactly n vertices and m edges.
* All edge weights... | instruction | 0 | 23,508 | 13 | 47,016 |
No | output | 1 | 23,508 | 13 | 47,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jamie has recently found undirected weighted graphs with the following properties very interesting:
* The graph is connected and contains exactly n vertices and m edges.
* All edge weights... | instruction | 0 | 23,509 | 13 | 47,018 |
No | output | 1 | 23,509 | 13 | 47,019 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,638 | 13 | 47,276 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
N, M = map(int, readline().split())
Edge = [[] for _ in range(N)]
for _ in range(M):
u, v, c = map(int, readline().split())
u -= 1
v -= 1
Edge[u].append((v, c))
Edge[v].append((u, c))
A = [None]*N
A[0] = (1, 0)
stack = [0]
used = set... | output | 1 | 23,638 | 13 | 47,277 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,639 | 13 | 47,278 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 23,639 | 13 | 47,279 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,640 | 13 | 47,280 |
"Correct Solution:
```
from math import ceil,floor
N,M=map(int,input().split())
Graph=[[] for i in range(N)]
for i in range(M):
a,b,s=map(int,input().split())
Graph[a-1].append((b-1,s))
Graph[b-1].append((a-1,s))
inf=float("inf")
node=[(0,0) for i in range(N)]
visited=[False]*N
node[0],visited[0]=(1,0),True
L,R... | output | 1 | 23,640 | 13 | 47,281 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,641 | 13 | 47,282 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**6)
def input():
return sys.stdin.readline()[:-1]
n, m = map(int, input().split())
cyc = [0 for _ in range(n)]
num = [10**30 for _ in range(n)]
adj = [[] for _ in range(n)]
used = [False for _ in range(m)]
for i in range(m):
u, v, s = map(int, input().s... | output | 1 | 23,641 | 13 | 47,283 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,642 | 13 | 47,284 |
"Correct Solution:
```
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return s... | output | 1 | 23,642 | 13 | 47,285 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,643 | 13 | 47,286 |
"Correct Solution:
```
from collections import deque
import sys
n,m = map(int,input().split())
uvs = []
dic = {}
for i in range(m):
u,v,s = map(int,input().split())
u -= 1
v -= 1
uvs.append([u,v,s])
if u not in dic:
dic[u] = []
if v not in dic:
dic[v] = []
dic[u].append... | output | 1 | 23,643 | 13 | 47,287 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,644 | 13 | 47,288 |
"Correct Solution:
```
from collections import deque
import sys
input = sys.stdin.readline
def is_bipartite(graph):
"""二部グラフ判定する"""
n = len(graph)
col = [-1] * n
q = deque([0])
col[0] = 0
while q:
v = q.pop()
for nxt_v, _ in graph[v]:
if col[nxt_v] == -1:
... | output | 1 | 23,644 | 13 | 47,289 |
Provide a correct Python 3 solution for this coding contest problem.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive integer in each vertex so that the following condition is ... | instruction | 0 | 23,645 | 13 | 47,290 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
E=[[] for i in range(n+1)]
for i in range(m):
x,y,s=map(int,input().split())
E[x].append((y,s))
E[y].append((x,s))
Q=[1]
USE=[-1]*(n+1)
USE[1]=0
FROM=[-1]*(n+1)
flag=1
while Q and flag==1:
x=Q.pop()
#print... | output | 1 | 23,645 | 13 | 47,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,646 | 13 | 47,292 |
Yes | output | 1 | 23,646 | 13 | 47,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,647 | 13 | 47,294 |
Yes | output | 1 | 23,647 | 13 | 47,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,648 | 13 | 47,296 |
Yes | output | 1 | 23,648 | 13 | 47,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,649 | 13 | 47,298 |
Yes | output | 1 | 23,649 | 13 | 47,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,650 | 13 | 47,300 |
No | output | 1 | 23,650 | 13 | 47,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,651 | 13 | 47,302 |
No | output | 1 | 23,651 | 13 | 47,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,652 | 13 | 47,304 |
No | output | 1 | 23,652 | 13 | 47,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kenkoooo found a simple connected graph. The vertices are numbered 1 through n. The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.
Kenkoooo is trying to write a positive in... | instruction | 0 | 23,653 | 13 | 47,306 |
No | output | 1 | 23,653 | 13 | 47,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,971 | 13 | 47,942 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
n,m,q=map(int,input().split())
mod,mxw = 1000000007,0;wgts,neig=[0]*n,[0]*n
for i in range(n):
neig[i]=[0]
for i in range(m):
a,b,w=map(int,input().split())
a-=1;b-=1;neig[a][0]+=1;neig[b][0]+=1;neig[a].append([b,w]);neig[b].append(... | output | 1 | 23,971 | 13 | 47,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,972 | 13 | 47,944 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
n,m,q=map(int,input().split())
mod=1000000007
mxw=0
wgts=[0]*n
neig=[0]*n
for i in range(n):
neig[i]=[0]
for i in range(m):
a,b,w=map(int,input().split())
a-=1;b-=1;neig[a][0]+=1;neig[b][0]+=1;neig[a].appe... | output | 1 | 23,972 | 13 | 47,945 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,973 | 13 | 47,946 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(sys.stdin.readline())
def ria(): return list(map(int, sys.stdin.readline().split()))
def ws(s): sys.stdout.write(s + '\n')
def wi(n): sys.stdout.write(str(n) + '\n')
def wia(a):... | output | 1 | 23,973 | 13 | 47,947 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,974 | 13 | 47,948 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m, q = map(int, input().split())
MOD = 10 ** 9 + 7
edges = []
adj = [[] for _ in range(n)]
for i in range(m):
a, b, w = map(int, input().split())
a -= 1
b -= 1
edges.append((a, b, w))
adj[a].append((b, w))
... | output | 1 | 23,974 | 13 | 47,949 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,975 | 13 | 47,950 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
#lev contains height from root,lower neighbour, higher neighbours
#lev[0] contains 0 (because it is the root), higher neighbours (=neighbours)
n,m,q=map(int,input().split())
mod=1000000007
mxw=0
wgts=[0]*n
neig=[0]*n
f... | output | 1 | 23,975 | 13 | 47,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,976 | 13 | 47,952 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
n,m,q=map(int,input().split());mod,mxw = 1000000007,0;wgts,neig=[0]*n,[0]*n
for i in range(n):neig[i]=[0]
for i in range(m):a,b,w=map(int,input().split());a-=1;b-=1;neig[a][0]+=1;neig[b][0]+=1;neig[a].append([b,w]);neig[b].append([a,w]);mxw=max(mxw,w);wgts... | output | 1 | 23,976 | 13 | 47,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that for each i (1 ≤ i ≤ k) the edge (v_i, v_{i+1}) ... | instruction | 0 | 23,977 | 13 | 47,954 |
Tags: binary search, dp, geometry, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m, q = map(int, input().split())
MOD = 10 ** 9 + 7
edges = []
adj = [[] for _ in range(n)]
for i in range(m):
a, b, w = map(int, input().split())
a -= 1
b -= 1
edges.append((a, b, w))
adj[a].append((b, w))
... | output | 1 | 23,977 | 13 | 47,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that ... | instruction | 0 | 23,978 | 13 | 47,956 |
No | output | 1 | 23,978 | 13 | 47,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that ... | instruction | 0 | 23,979 | 13 | 47,958 |
No | output | 1 | 23,979 | 13 | 47,959 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that ... | instruction | 0 | 23,980 | 13 | 47,960 |
No | output | 1 | 23,980 | 13 | 47,961 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a simple weighted connected undirected graph, consisting of n vertices and m edges.
A path in the graph of length k is a sequence of k+1 vertices v_1, v_2, ..., v_{k+1} such that ... | instruction | 0 | 23,981 | 13 | 47,962 |
No | output | 1 | 23,981 | 13 | 47,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
* The game consist... | instruction | 0 | 24,127 | 13 | 48,254 |
Tags: dp, graphs, shortest paths
Correct Solution:
```
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
# from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bise... | output | 1 | 24,127 | 13 | 48,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
* The game consist... | instruction | 0 | 24,128 | 13 | 48,256 |
Tags: dp, graphs, shortest paths
Correct Solution:
```
import sys
from array import array # noqa: F401
n = int(input())
matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]
aa = tuple(map(lambda x: int(x) - 1, input().split()))
ans = [''] * n
for i in range(n-1, -1, -1):
x = aa[i]
for a ... | output | 1 | 24,128 | 13 | 48,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
* The game consist... | instruction | 0 | 24,129 | 13 | 48,258 |
Tags: dp, graphs, shortest paths
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
def solve():
n = int(input())
matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]
a = tuple(map(lambda x: int(x... | output | 1 | 24,129 | 13 | 48,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
* The game consist... | instruction | 0 | 24,130 | 13 | 48,260 |
Tags: dp, graphs, shortest paths
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n = int(input())
matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]
a = tuple(map(lambda x: int(x) - 1, input().split()))
... | output | 1 | 24,130 | 13 | 48,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
* The game consist... | instruction | 0 | 24,131 | 13 | 48,262 |
Tags: dp, graphs, shortest paths
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n = int(input())
matrix = [array('i', list(map(int, input().split()))) for _ in range(n)]
aa = tuple(map(lambda x: int(x) - 1, input().split()))... | output | 1 | 24,131 | 13 | 48,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he... | instruction | 0 | 24,132 | 13 | 48,264 |
No | output | 1 | 24,132 | 13 | 48,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he... | instruction | 0 | 24,133 | 13 | 48,266 |
No | output | 1 | 24,133 | 13 | 48,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he... | instruction | 0 | 24,134 | 13 | 48,268 |
No | output | 1 | 24,134 | 13 | 48,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he... | instruction | 0 | 24,135 | 13 | 48,270 |
No | output | 1 | 24,135 | 13 | 48,271 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,525 | 13 | 49,050 |
"Correct Solution:
```
n,m,p=map(int,input().split())
l=[list(map(int,input().split())) for i in range(m)]
distance=[float('inf')]*n
distance[0]=0
for i in range(n-1):
for j in range(m):
if distance[l[j][1]-1]>distance[l[j][0]-1]-l[j][2]+p:
distance[l[j][1]-1]=distance[l[j][0]-1]-l[j][2]+p
x=distance[n-1]
f... | output | 1 | 24,525 | 13 | 49,051 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,526 | 13 | 49,052 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M, P = map(int, input().split())
edges = []
for _ in range(M):
a, b, c = map(int, input().split())
edges.append([a-1, b-1, -c+P])
def bellnabFord(edges, src, N):
inf = float('inf')
dist = [inf for i in range... | output | 1 | 24,526 | 13 | 49,053 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,527 | 13 | 49,054 |
"Correct Solution:
```
import sys
from collections import defaultdict
def reverse_search(n, parents):
q = [n - 1]
visited = set()
while q:
v = q.pop()
if v in visited:
continue
visited.add(v)
q.extend(u for u in parents[v] if u not in visited)
return visited... | output | 1 | 24,527 | 13 | 49,055 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,528 | 13 | 49,056 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N, M, P = map(int, input().split())
edges = []
for _ in range(M):
a, b, c = map(int, input().split())
edges.append([a-1, b-1, -c+P])
def bellnabFord(edges, src, N):
inf = float('inf')
dist = [inf for i in range... | output | 1 | 24,528 | 13 | 49,057 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,529 | 13 | 49,058 |
"Correct Solution:
```
#57 ABC137E
#ベルマンフォード
n,m,p=map(int,input().split())
abc=[list(map(int,input().split())) for _ in range(m)]
abc=[[a,b,p-c] for a,b,c in abc]
def BF(edges,num_v,source):
#グラフの初期化
inf=float("inf")
dist=[inf for i in range(num_v)]
dist[source-1]=0
#辺の緩和
neg=[False for _ ... | output | 1 | 24,529 | 13 | 49,059 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,530 | 13 | 49,060 |
"Correct Solution:
```
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,m,p=map(int,input().split())
E=[]
for i in range(m):
a,b,c=map(int,input().spl... | output | 1 | 24,530 | 13 | 49,061 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,531 | 13 | 49,062 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
def BellmanFord(edges, v, source):
INF = float("inf")
dist = [INF for _ in range(v)]
dist[source] = 0
for i in range(2 * v + 1):
... | output | 1 | 24,531 | 13 | 49,063 |
Provide a correct Python 3 solution for this coding contest problem.
There is a directed graph with N vertices numbered 1 to N and M edges. The i-th edge is directed from Vertex A_i to Vertex B_i, and there are C_i coins placed along that edge. Additionally, there is a button on Vertex N.
We will play a game on this... | instruction | 0 | 24,532 | 13 | 49,064 |
"Correct Solution:
```
n,m,p=map(int,input().split())
g=[[] for _ in range(n)]
e=[]
for _ in range(m):
a,b,c=map(int,input().split())
a,b=a-1,b-1
c-=p
g[a].append([b,c])
e.append([a,b,-c])
# ベルマンフォード法
# edges:エッジ、有向エッジ[a,b,c]a->bのエッジでコストc
# num_v:頂点の数
# source:始点
def BellmanFord(edges,num_v,source):
#グラフ... | output | 1 | 24,532 | 13 | 49,065 |
Provide a correct Python 3 solution for this coding contest problem.
D: Rescue a Postal Worker
story
You got a job at the post office, which you have long dreamed of this spring. I decided on the delivery area I was in charge of, and it was my first job with a feeling of excitement, but I didn't notice that there wa... | instruction | 0 | 24,702 | 13 | 49,404 |
"Correct Solution:
```
from heapq import heappush, heappop
n, m, k, p = map(int, input().split())
p -= 1
edges = [[] for _ in range(n)]
for _ in range(m):
x, y, w = map(int, input().split())
x -= 1
y -= 1
edges[x].append((y, w))
edges[y].append((x, w))
point = []
for _ in range(k):
s, t = map(int, input().... | output | 1 | 24,702 | 13 | 49,405 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.