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.
There is a tree with N vertices, numbered 1 through N. The i-th edge in this tree connects Vertices A_i and B_i and has a length of C_i.
Joisino created a complete graph with N vertices. The le... | instruction | 0 | 14,009 | 13 | 28,018 |
No | output | 1 | 14,009 | 13 | 28,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a tree with N vertices, numbered 1 through N. The i-th edge in this tree connects Vertices A_i and B_i and has a length of C_i.
Joisino created a complete graph with N vertices. The le... | instruction | 0 | 14,010 | 13 | 28,020 |
No | output | 1 | 14,010 | 13 | 28,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a tree with N vertices, numbered 1 through N. The i-th edge in this tree connects Vertices A_i and B_i and has a length of C_i.
Joisino created a complete graph with N vertices. The le... | instruction | 0 | 14,011 | 13 | 28,022 |
No | output | 1 | 14,011 | 13 | 28,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Assume that you have k one-dimensional segments s_1, s_2, ... s_k (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph consists of k vertexes, and there is an edge bet... | instruction | 0 | 14,244 | 13 | 28,488 |
Tags: dfs and similar, dp, graphs, trees
Correct Solution:
```
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
ab = [list(map(int,input().split())) for i in range(n-1)]
graph = [[] for i in range(n+1)]
deg = [0]*(n+1)
for a,b in ab:
graph[a].append(b)
graph[b... | output | 1 | 14,244 | 13 | 28,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Assume that you have k one-dimensional segments s_1, s_2, ... s_k (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph c... | instruction | 0 | 14,245 | 13 | 28,490 |
No | output | 1 | 14,245 | 13 | 28,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Assume that you have k one-dimensional segments s_1, s_2, ... s_k (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph c... | instruction | 0 | 14,246 | 13 | 28,492 |
No | output | 1 | 14,246 | 13 | 28,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Assume that you have k one-dimensional segments s_1, s_2, ... s_k (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph c... | instruction | 0 | 14,247 | 13 | 28,494 |
No | output | 1 | 14,247 | 13 | 28,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Assume that you have k one-dimensional segments s_1, s_2, ... s_k (each segment is denoted by two integers — its endpoints). Then you can build the following graph on these segments. The graph c... | instruction | 0 | 14,248 | 13 | 28,496 |
No | output | 1 | 14,248 | 13 | 28,497 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,673 | 13 | 29,346 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
n = int(input())
g = [[] for _ in range(n)]
for _ in range(n-1):
u, v = map(int, input().split())
u -= 1
v -= 1
g[u].append(v)
g[v].append(u)
c = list(map(int, input().split()))
dif = [0 for _ in range(n)]
cnt = 0
fo... | output | 1 | 14,673 | 13 | 29,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,674 | 13 | 29,348 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
n = int(input())
edges = [tuple(map(int, input().split())) for i in range(n - 1)]
colours = input().split()
'''better plan:
1)take any node
2)go up while parent has the same colour
3)as soon as colour changes save the result... | output | 1 | 14,674 | 13 | 29,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,675 | 13 | 29,350 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
read = lambda: map(int, input().split())
n = int(input())
ed = []
for i in range(n - 1):
u, v = read()
if u > v: u, v = v, u
ed.append((u, v))
c = [0] + list(read())
edr = []
g = [list() for i in range(n + 1)]
ver = set()
fo... | output | 1 | 14,675 | 13 | 29,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,676 | 13 | 29,352 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
N = int(input())
G = [[] for i in range(N)]
d = []
for i in range(N - 1):
a, b = map(int, input().split())
a, b = a - 1, b - 1
G[a].append(b)
G[b].append(a)
d.append((a, b))
C = list(map(int, input().split()))
num = ... | output | 1 | 14,676 | 13 | 29,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,677 | 13 | 29,354 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
import sys
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
def solve():
n = mint()
e = [ [] for i in range(n+1)]
for i in range(n-1):
u,v = mints()
... | output | 1 | 14,677 | 13 | 29,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,678 | 13 | 29,356 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
import sys
import collections
import itertools
n = int(sys.stdin.readline())
graph = collections.defaultdict(list)
for _ in range(n - 1):
u, v = map(int, str.split(sys.stdin.readline()))
graph[u].append(v)
graph[v].append... | output | 1 | 14,678 | 13 | 29,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,679 | 13 | 29,358 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
#!/usr/bin/env python3
def ri():
return map(int, input().split())
n = int(input())
e = []
for i in range(n-1):
a, b = ri()
a -= 1
b -= 1
e.append([a, b])
c = list(ri())
ed = []
for ee in e:
if c[ee[0]] != c[... | output | 1 | 14,679 | 13 | 29,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Timofey birthday, and his mother asked him to remo... | instruction | 0 | 14,680 | 13 | 29,360 |
Tags: dfs and similar, dp, dsu, graphs, implementation, trees
Correct Solution:
```
class Node:
def __init__(self, number, color, adjacency_set):
self.number = number
self.color = color
self.adjacency_set = adjacency_set
def main():
n = int(input())
tree = []
for i in range(n)... | output | 1 | 14,680 | 13 | 29,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,681 | 13 | 29,362 |
Yes | output | 1 | 14,681 | 13 | 29,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,682 | 13 | 29,364 |
Yes | output | 1 | 14,682 | 13 | 29,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,683 | 13 | 29,366 |
Yes | output | 1 | 14,683 | 13 | 29,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,684 | 13 | 29,368 |
Yes | output | 1 | 14,684 | 13 | 29,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,685 | 13 | 29,370 |
No | output | 1 | 14,685 | 13 | 29,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,686 | 13 | 29,372 |
No | output | 1 | 14,686 | 13 | 29,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,687 | 13 | 29,374 |
No | output | 1 | 14,687 | 13 | 29,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Each New Year Timofey and his friends cut down a tree of n vertices and bring it home. After that they paint all the n its vertices, so that the i-th vertex gets color ci.
Now it's time for Tim... | instruction | 0 | 14,688 | 13 | 29,376 |
No | output | 1 | 14,688 | 13 | 29,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,724 | 13 | 29,448 |
Tags: constructive algorithms, trees
Correct Solution:
```
def read():
return tuple(int(x) for x in input().split())
def main():
(h, ) = read()
a = read()
tree = []
fi = 0
flag = False
for i, x in enumerate(a):
if fi == 0:
if not flag and x > 1:
flag = True
elif flag and x > 1:
fi = len(tree)
... | output | 1 | 14,724 | 13 | 29,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,725 | 13 | 29,450 |
Tags: constructive algorithms, trees
Correct Solution:
```
h=int(input())
l=list(map(int,input().split()))
x=False
pos=0
s=1
for i in range(h):
if (l[i]!=1) and (l[i+1]!=1) :
pos=i+1
x=True
print("ambiguous")
break
if not x:
print("perfect")
else:
ch="0"... | output | 1 | 14,725 | 13 | 29,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,726 | 13 | 29,452 |
Tags: constructive algorithms, trees
Correct Solution:
```
n = int(input())
h = [int(i) for i in input().split()]
flag = 0
for i in range(n):
if h[i] >= 2 and h[i+1] >= 2:
flag = i
if flag:
a = []
c = 0
for i in range(n+1):
for j in range(h[i]):
a.append(c)
c += h[... | output | 1 | 14,726 | 13 | 29,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,727 | 13 | 29,454 |
Tags: constructive algorithms, trees
Correct Solution:
```
h = int(input())
a = list(map(int,input().split()))
perfect = True
for i in range(h):
if a[i]>1 and a[i+1]>1:
perfect = False
break
if perfect:
print("perfect")
else:
print("ambiguous")
tree1 = list(range(h+1))
tree2 = list... | output | 1 | 14,727 | 13 | 29,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,728 | 13 | 29,456 |
Tags: constructive algorithms, trees
Correct Solution:
```
h = int(input())
a = list(map(int,input().split()))
p, c, f = 0, 0, False
s1, s2 = [], []
for i in a:
for j in range(i):
s1.append(c)
if j == i-1 and not f and p >= 2 and i >= 2:
f = True
s2.append(c-1)
else :... | output | 1 | 14,728 | 13 | 29,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,729 | 13 | 29,458 |
Tags: constructive algorithms, trees
Correct Solution:
```
import sys
#f = open('input', 'r')
f = sys.stdin
n = f.readline()
n = int(n)
cl = f.readline().split()
cl = [int(x) for x in cl]
c_index = 0
p1 = ['0']
p2 = ['0']
ambiguous = False
cur_index = 1
for i, c in enumerate(cl):
if i == 0:
continue
if i ... | output | 1 | 14,729 | 13 | 29,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,730 | 13 | 29,460 |
Tags: constructive algorithms, trees
Correct Solution:
```
h = int(input())
a = list(map(int, input().split()))
perfect = True
for i in range(1, len(a)):
if (a[i] != 1 and a[i - 1] != 1):
perfect = False
print ("perfect" if perfect else "ambiguous")
ret1 = [0] * sum(a)
ret2 = [0] * sum(a)
#print (ret1)
node... | output | 1 | 14,730 | 13 | 29,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an experienced participant, she guessed that she should... | instruction | 0 | 14,731 | 13 | 29,462 |
Tags: constructive algorithms, trees
Correct Solution:
```
"""
Author - Satwik Tiwari .
21th NOV , 2020 - Saturday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fracti... | output | 1 | 14,731 | 13 | 29,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,732 | 13 | 29,464 |
Yes | output | 1 | 14,732 | 13 | 29,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,733 | 13 | 29,466 |
Yes | output | 1 | 14,733 | 13 | 29,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,734 | 13 | 29,468 |
Yes | output | 1 | 14,734 | 13 | 29,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,735 | 13 | 29,470 |
Yes | output | 1 | 14,735 | 13 | 29,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,736 | 13 | 29,472 |
No | output | 1 | 14,736 | 13 | 29,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,737 | 13 | 29,474 |
No | output | 1 | 14,737 | 13 | 29,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,738 | 13 | 29,476 |
No | output | 1 | 14,738 | 13 | 29,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sasha is taking part in a programming competition. In one of the problems she should check if some rooted trees are isomorphic or not. She has never seen this problem before, but, being an exper... | instruction | 0 | 14,739 | 13 | 29,478 |
No | output | 1 | 14,739 | 13 | 29,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing edges that are labeled as e_i[0], e_i[1], …, e_... | instruction | 0 | 15,173 | 13 | 30,346 |
Tags: brute force, data structures, dfs and similar, dp, graphs, implementation, math, number theory
Correct Solution:
```
import io, sys
input = lambda f=io.StringIO(sys.stdin.buffer.read().decode()).readline: f().rstrip()
LCM = 2520
n = int(input())
k = list(map(int, input().split()))
m, e = [], []
for _ in range(n)... | output | 1 | 15,173 | 13 | 30,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing edges that are labeled as e_i[0], e_i[1], …, e_... | instruction | 0 | 15,174 | 13 | 30,348 |
Tags: brute force, data structures, dfs and similar, dp, graphs, implementation, math, number theory
Correct Solution:
```
import io, sys
input = lambda f=io.StringIO(sys.stdin.buffer.read().decode()).readline: f().rstrip()
LCM = 2520
n = int(input())
k = list(map(int, input().split()))
m, e = [0] * n, [None] * n
for ... | output | 1 | 15,174 | 13 | 30,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing edges that are labeled as e_i[0], e_i[1], …, e_... | instruction | 0 | 15,175 | 13 | 30,350 |
Tags: brute force, data structures, dfs and similar, dp, graphs, implementation, math, number theory
Correct Solution:
```
import sys
from sys import stdin
def solve(v,c):
if d[v][c] != None:
return d[v][c]
vnum = 0
visits = set()
while True:
if c*n+v in visits:
last = ... | output | 1 | 15,175 | 13 | 30,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing ... | instruction | 0 | 15,176 | 13 | 30,352 |
No | output | 1 | 15,176 | 13 | 30,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing ... | instruction | 0 | 15,177 | 13 | 30,354 |
No | output | 1 | 15,177 | 13 | 30,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing ... | instruction | 0 | 15,178 | 13 | 30,356 |
No | output | 1 | 15,178 | 13 | 30,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Gildong is experimenting with an interesting machine Graph Traveler. In Graph Traveler, there is a directed graph consisting of n vertices numbered from 1 to n. The i-th vertex has m_i outgoing ... | instruction | 0 | 15,179 | 13 | 30,358 |
No | output | 1 | 15,179 | 13 | 30,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed acyclic graph (a directed graph that does not contain cycles) of n vertices and m arcs. The i-th arc leads from the vertex x_i to the vertex y_i and has the weight w_i.
Your task is to select an integer a_v for each... | instruction | 0 | 15,268 | 13 | 30,536 |
Tags: bitmasks, dfs and similar, dp, flows, graphs, math
Correct Solution:
```
from heapq import heappush, heappop
class MinCostFlow:
INF = 10**18
def __init__(self, N):
self.N = N
self.G = [[] for i in range(N)]
def add_edge(self, fr, to, cap, cost):
forward = [to, cap, cost, None... | output | 1 | 15,268 | 13 | 30,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a directed acyclic graph (a directed graph that does not contain cycles) of n vertices and m arcs. The i-th arc leads from the vertex x_i to the vertex y_i and has the weight w_i.
... | instruction | 0 | 15,269 | 13 | 30,538 |
No | output | 1 | 15,269 | 13 | 30,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a directed acyclic graph (a directed graph that does not contain cycles) of n vertices and m arcs. The i-th arc leads from the vertex x_i to the vertex y_i and has the weight w_i.
... | instruction | 0 | 15,270 | 13 | 30,540 |
No | output | 1 | 15,270 | 13 | 30,541 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.