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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 918 | 13 | 1,836 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
def dfs(cur_node, childs, vis, cur_dfs):
if cur_node in cur_dfs:
return True
if vis[cur_node]:
return False
vis[cur_node] = True
cur_dfs.add(cur_node)
for ele in child... | output | 1 | 918 | 13 | 1,837 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 919 | 13 | 1,838 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
from collections import defaultdict
ans = defaultdict(lambda : 1)
flag = 0
def dfs(i):
global flag
vis[i] = 1
for j in hash[i]:
if not vis[j]:
dfs(j)
else:
if vis[j] == 1:
... | output | 1 | 919 | 13 | 1,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 920 | 13 | 1,840 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
[N,M] = list(map(int,input().split()))
edges = [[] for _ in range(N+1)]
edge_in = []
for _ in range(M):
[u,v] = list(map(int,input().split()))
edge_in.append([u,v])
edges[u].append(v)
seen = [False for _ in range(N+1)]
visited = ... | output | 1 | 920 | 13 | 1,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 921 | 13 | 1,842 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
n, m = input().split(' ')
n, m = int(n), int(m)
ch = [[] for i in range(n+1)]
edges_by_order = []
for i in range(m):
x, y = input().split(' ')
x, y = int(x), int(y)
ch[x].append(y)
edges_by_order.append((x, y))
for i in ran... | output | 1 | 921 | 13 | 1,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 922 | 13 | 1,844 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
WHITE, GRAY, BLACK = 0, 1, 2
def solve(graph: [], colors: []):
n = len(graph)-1
visited = [WHITE] * (n + 1)
returnValue = 1
for i in range(1, n + 1):
if visited[i] == WHITE and Dfs(graph, colors, i, visited):
... | output | 1 | 922 | 13 | 1,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 923 | 13 | 1,846 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
#!python3
from collections import deque, Counter
import array
from itertools import combinations, permutations
from math import sqrt
import unittest
def read_int():
return int(input().strip())
def read_int_array():
return [int(i) ... | output | 1 | 923 | 13 | 1,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 924 | 13 | 1,848 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
v_n, e_n = tuple(map(int, input().split()))
G = [set() for _ in range(v_n)]
edges = []
d_s = [-1] * v_n
ok = False
def dfs(u):
global ok
if ok:
return
d_s[u] = 0
for v in G[u]:
if d_s[v] == -1:
dfs(v... | output | 1 | 924 | 13 | 1,849 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 925 | 13 | 1,850 |
Yes | output | 1 | 925 | 13 | 1,851 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 926 | 13 | 1,852 |
Yes | output | 1 | 926 | 13 | 1,853 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 927 | 13 | 1,854 |
Yes | output | 1 | 927 | 13 | 1,855 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 928 | 13 | 1,856 |
Yes | output | 1 | 928 | 13 | 1,857 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 929 | 13 | 1,858 |
No | output | 1 | 929 | 13 | 1,859 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 930 | 13 | 1,860 |
No | output | 1 | 930 | 13 | 1,861 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 931 | 13 | 1,862 |
No | output | 1 | 931 | 13 | 1,863 |
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 graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k ... | instruction | 0 | 932 | 13 | 1,864 |
No | output | 1 | 932 | 13 | 1,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's teacher will evaluate his model and grade Jaco... | instruction | 0 | 1,292 | 13 | 2,584 |
Tags: binary search, dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
g = [[] for _ in range(n)]
for i in range(n - 1):
u, v = map(int, input().split())
g[u-1].append(v-1)
g[v-1].append(u-1)
... | output | 1 | 1,292 | 13 | 2,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's... | instruction | 0 | 1,293 | 13 | 2,586 |
No | output | 1 | 1,293 | 13 | 2,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For his computer science class, Jacob builds a model tree with sticks and balls containing n nodes in the shape of a tree. Jacob has spent ai minutes building the i-th ball in the tree.
Jacob's... | instruction | 0 | 1,294 | 13 | 2,588 |
No | output | 1 | 1,294 | 13 | 2,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tree, which consists of n vertices. Recall that a tree is a connected undirected graph without cycles.
<image> Example of a tree.
Vertices are numbered from 1 to n. All vertices have weights, the weight of the vertex v is ... | instruction | 0 | 1,774 | 13 | 3,548 |
Tags: dp, trees
Correct Solution:
```
n, k = map(int, input().split())
a = list(map(int, input().split()))
g = {}
def dfs(v, p=-1):
c = [dfs(child, v) for child in g.get(v, set()) - {p}]
c.sort(key=len, reverse=True)
r = []
i = 0
while c:
if i >= len(c[-1]):
c.pop()
else:
o = max(i, k - i - 1)
s = q ... | output | 1 | 1,774 | 13 | 3,549 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,238 | 13 | 4,476 |
"Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
def calc():
def mex(i):
D = {}
for j in X[i]:
D[G[j]] = 1
for g in range(N + 1):
if g not in D:
return g
M = int(input())
X = [[] for _ in range(N)]
for _ in r... | output | 1 | 2,238 | 13 | 4,477 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,239 | 13 | 4,478 |
"Correct Solution:
```
from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(N+1):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
... | output | 1 | 2,239 | 13 | 4,479 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,240 | 13 | 4,480 |
"Correct Solution:
```
from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(input())
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1... | output | 1 | 2,240 | 13 | 4,481 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,241 | 13 | 4,482 |
"Correct Solution:
```
import sys
from collections import defaultdict
n, *mabs = map(int, sys.stdin.buffer.read().split())
MOD = 998244353
base = 10 ** 18 % MOD
base_costs = [base]
for i in range(n - 1):
base_costs.append(base_costs[-1] * base % MOD)
graphs = []
i = 0
for _ in range(3):
m = mabs[i]
i += 1
... | output | 1 | 2,241 | 13 | 4,483 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,242 | 13 | 4,484 |
"Correct Solution:
```
from collections import defaultdict
import sys
input = lambda: sys.stdin.readline().rstrip()
M = 998244353
B = pow(10, 18, M)
N = int(input())
def geometric_mod(a, r, m, n):
x = a
for i in range(n):
yield x
x = (x*r)%m
BB = list(geometric_mod(1, B, M, N+2))
def ext_euc(a, b):
x1... | output | 1 | 2,242 | 13 | 4,485 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,243 | 13 | 4,486 |
"Correct Solution:
```
from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1, y1
def inv_mod(a, b, m):
x, y = ex... | output | 1 | 2,243 | 13 | 4,487 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,244 | 13 | 4,488 |
"Correct Solution:
```
from collections import defaultdict
M = 998244353
B = 10**18 % M
def mex(s):
for i in range(max(s)+2):
if i not in s:
return i
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y... | output | 1 | 2,244 | 13 | 4,489 |
Provide a correct Python 3 solution for this coding contest problem.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N, z_1, z_2, \dots, z_N. The edges in X, Y, Z are respect... | instruction | 0 | 2,245 | 13 | 4,490 |
"Correct Solution:
```
from collections import defaultdict
M = 998244353
B = pow(10, 18, M)
N = int(input())
def ext_euc(a, b):
x1, y1, z1 = 1, 0, a
x2, y2, z2 = 0, 1, b
while z1 != 1:
d, m = divmod(z2,z1)
x1, x2 = x2-d*x1, x1
y1, y2 = y2-d*y1, y1
z1, z2 = m, z1
return x1, y1
def inv_mod(a, b... | output | 1 | 2,245 | 13 | 4,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,246 | 13 | 4,492 |
Yes | output | 1 | 2,246 | 13 | 4,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,247 | 13 | 4,494 |
Yes | output | 1 | 2,247 | 13 | 4,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,248 | 13 | 4,496 |
Yes | output | 1 | 2,248 | 13 | 4,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,249 | 13 | 4,498 |
Yes | output | 1 | 2,249 | 13 | 4,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,250 | 13 | 4,500 |
No | output | 1 | 2,250 | 13 | 4,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,251 | 13 | 4,502 |
No | output | 1 | 2,251 | 13 | 4,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,252 | 13 | 4,504 |
No | output | 1 | 2,252 | 13 | 4,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are simple undirected graphs X, Y, Z, with N vertices each and M_1, M_2, M_3 edges, respectively. The vertices in X, Y, Z are respectively called x_1, x_2, \dots, x_N, y_1, y_2, \dots, y_N... | instruction | 0 | 2,253 | 13 | 4,506 |
No | output | 1 | 2,253 | 13 | 4,507 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,254 | 13 | 4,508 |
"Correct Solution:
```
import sys
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
DBG = True and False
PROBL = 1
MAXVISIT = 400
def ddprint(x):
if DBG:
print(x)
sys.stdout.flush()
def trigger()... | output | 1 | 2,254 | 13 | 4,509 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,255 | 13 | 4,510 |
"Correct Solution:
```
import sys
from collections import deque
from heapq import heapify, heappop, heappush
from math import sqrt
from itertools import permutations
def root_search(order, cost, wf, V): #店舗から出るときの探索
type_num = len(order)
hold = [] #holdで上位n個のみ保持し、最後に残ったものをpre_holdに移す
heapify(hold)
pre_... | output | 1 | 2,255 | 13 | 4,511 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,256 | 13 | 4,512 |
"Correct Solution:
```
"""https://atcoder.jp/contests/hokudai-hitachi2019-1/tasks/hokudai_hitachi2019_1_a
Time Limit: 30 sec / Memory Limit: 1024 MB
# Score
score := time_max**2 * n_deleverd - sum((deleverd_time[i] - ordered_time[i])**2 for i in deleverd)
# Requirements
- time_max = 10_000
- 200 <= n_vertices <= 400
... | output | 1 | 2,256 | 13 | 4,513 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,257 | 13 | 4,514 |
"Correct Solution:
```
def empty(t_max):
return [-1] * t_max
def main():
nv, ne = map(int, input().split())
# graph
graph_dict = dict()
for i in range(nv):
graph_dict[i + 1] = dict()
for _ in range(ne):
u, v, d = map(int, input().split())
graph_dict[u][v] = d
... | output | 1 | 2,257 | 13 | 4,515 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,258 | 13 | 4,516 |
"Correct Solution:
```
import copy
##############################
# 指定した商品データを削除する処理
##############################
def deleteProduct(nowPos):
global product
for i in reversed(range(len(product))):
#削除したので、ループ回数上限を再チェック
# if i >= len(product):
# brea... | output | 1 | 2,258 | 13 | 4,517 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,259 | 13 | 4,518 |
"Correct Solution:
```
import sys
from collections import deque
from heapq import heapify, heappop, heappush
def decide_next_dst(cost, order):
d = 0
c = 0
for key in order:
if cost[key][0] > c:
d = key
c = cost[key][0]
return (d, c)
def solve():
inf = 10000000000
... | output | 1 | 2,259 | 13 | 4,519 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,260 | 13 | 4,520 |
"Correct Solution:
```
import sys
from collections import deque
from heapq import heapify, heappop, heappush
def decide_final_dst(cost, order, current_id, store_cost, wf, dmax):
d = 0
c = (store_cost * (dmax / wf[current_id][0]) ** 2 if current_id > 0 else 0) * 0.1
for key in order:
if cost[key] *... | output | 1 | 2,260 | 13 | 4,521 |
Provide a correct Python 3 solution for this coding contest problem.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* 1 \leq d_{u_i, v_i} \leq \lceil 4\sqrt{2|V|} \rceil (1 \... | instruction | 0 | 2,261 | 13 | 4,522 |
"Correct Solution:
```
import sys
from collections import deque
from heapq import heapify, heappop, heappush
def decide_next_dst(cost, order):
d = 0
c = 0
for key in order:
if cost[key][0] > c:
d = key
c = cost[key][0]
return (d, c)
def solve():
inf = 10000000000
... | output | 1 | 2,261 | 13 | 4,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,262 | 13 | 4,524 |
Yes | output | 1 | 2,262 | 13 | 4,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,263 | 13 | 4,526 |
Yes | output | 1 | 2,263 | 13 | 4,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,264 | 13 | 4,528 |
Yes | output | 1 | 2,264 | 13 | 4,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,265 | 13 | 4,530 |
Yes | output | 1 | 2,265 | 13 | 4,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,266 | 13 | 4,532 |
No | output | 1 | 2,266 | 13 | 4,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,267 | 13 | 4,534 |
No | output | 1 | 2,267 | 13 | 4,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Requirements
* All inputs are of non-negative integer value.
* T_{\text{max}} = 10000
* 200 \leq |V| \leq 400
* 1.5 |V| \leq |E| \leq 2 |V|
* 1 \leq u_{i}, v_{i} \leq |V| (1 \leq i \leq |E|)
* ... | instruction | 0 | 2,268 | 13 | 4,536 |
No | output | 1 | 2,268 | 13 | 4,537 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.