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.
You are given a tree with n nodes and q queries.
Every query starts with three integers k, m and r, followed by k nodes of the tree a_1, a_2, …, a_k. To answer a query, assume that the tree is ... | instruction | 0 | 43,862 | 13 | 87,724 |
No | output | 1 | 43,862 | 13 | 87,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are playing a game. They have a tree consisting of n vertices. Initially, Bob has k chips, the i-th chip is located in the vertex a_i (all these vertices are unique). Before the ga... | instruction | 0 | 44,047 | 13 | 88,094 |
No | output | 1 | 44,047 | 13 | 88,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are playing a game. They have a tree consisting of n vertices. Initially, Bob has k chips, the i-th chip is located in the vertex a_i (all these vertices are unique). Before the ga... | instruction | 0 | 44,048 | 13 | 88,096 |
No | output | 1 | 44,048 | 13 | 88,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are playing a game. They have a tree consisting of n vertices. Initially, Bob has k chips, the i-th chip is located in the vertex a_i (all these vertices are unique). Before the ga... | instruction | 0 | 44,049 | 13 | 88,098 |
No | output | 1 | 44,049 | 13 | 88,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice and Bob are playing a game. They have a tree consisting of n vertices. Initially, Bob has k chips, the i-th chip is located in the vertex a_i (all these vertices are unique). Before the ga... | instruction | 0 | 44,050 | 13 | 88,100 |
No | output | 1 | 44,050 | 13 | 88,101 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,485 | 13 | 88,970 |
"Correct Solution:
```
import sys
N = int(sys.stdin.buffer.readline())
AB = list(map(int, sys.stdin.buffer.read().split()))
A = AB[::2]
B = AB[1::2]
ans = min(sum(A), sum(B))
AB.sort()
pivot = AB[N-1]
pivot2 = AB[N]
pivot_idxs = []
pivot2_idxs = []
ans2 = sum(AB[:N])
for i, (a, b) in enumerate(zip(A, B)):
if a <= p... | output | 1 | 44,485 | 13 | 88,971 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,486 | 13 | 88,972 |
"Correct Solution:
```
N = int(input())
A = []
B = []
Sa = 0
Sb = 0
for i in range(N):
a,b = map(int,input().split())
A.append([a,i])
B.append([b,i])
Sa += a
Sb += b
C = sorted(A+B)
ind = []
ans = 0
for i in range(N):
ind.append(C[i][1])
ans += C[i][0]
ind = set(ind)
if len(ind) == N:
if... | output | 1 | 44,486 | 13 | 88,973 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,487 | 13 | 88,974 |
"Correct Solution:
```
# C
from heapq import heappush, heappop
N = int(input())
values = [0]*(2*N)
for i in range(N):
A, B = map(int, input().split())
values[i] = A
values[i+N] = B
def argsort(R_arr):
N = len(R_arr)
R_args = [0]*N
R_vars = [0]*N
h = []
for i in range(N):
heapp... | output | 1 | 44,487 | 13 | 88,975 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,488 | 13 | 88,976 |
"Correct Solution:
```
n = int(input())
edge = []
num_list = []
for i in range(n):
a, b = map(int, input().split())
edge.append([a, b])
num_list.append(a)
num_list.append(b)
num_list.sort()
K = num_list[n-1]
ab = []
ax = []
xb = []
for i in range(n):
a, b = edge[i]
if a <= K and b <= K:
... | output | 1 | 44,488 | 13 | 88,977 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,489 | 13 | 88,978 |
"Correct Solution:
```
n = int(input())
c = []
not_c = []
chosen = set()
ans = 0
for i in range(n):
a, b = map(int, input().split())
not_c.append([max(a, b), i])
c.append([min(a, b), i])
ans += min(a, b)
if a < b:
chosen.add("a")
elif a > b:
chosen.add("b")
if len(chosen) < 2:
print(ans)
else:
c = sorted(c... | output | 1 | 44,489 | 13 | 88,979 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,490 | 13 | 88,980 |
"Correct Solution:
```
N=int(input())
A=[]
node=[]
for i in range(N):
x,y=map(int,input().split())
A.append((x,i,"left"))
A.append((y,i,"right"))
node.append((x,y))
A.sort()
Used=[[False,False] for i in range(N)]
Used_node=0
for i in range(N):
if A[i][2]=="left":
Used[A[i][1]][0]=True
if not Used[A... | output | 1 | 44,490 | 13 | 88,981 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,491 | 13 | 88,982 |
"Correct Solution:
```
N=int(input());A=[-1]*N;B=[-1]*N
for i in range(N):A[i],B[i]=map(int,input().split())
ans=min(sum(A),sum(B));t=[(A[i],i) for i in range(N)]+[(B[i],i) for i in range(N)];t.sort();d=[0]*N
for i in range(N):d[t[i][1]]+=1
S=sum(t[i][0] for i in range(N))
if max(d)==2:
print(S)
else:
ans2=min(... | output | 1 | 44,491 | 13 | 88,983 |
Provide a correct Python 3 solution for this coding contest problem.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex x to Vertex y for all pairs 1 \leq x,y \leq N, and its w... | instruction | 0 | 44,492 | 13 | 88,984 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**9)
n=int(input())
Cost=[]
s1,s2=0,0
for i in range(n):
a,b=map(int,input().split())
s1+=a
s2+=b
Cost.append([a,i])
Cost.append([b,i])
Cost.sort()
s3=sum([Cost[i][0] for i in range(n)])
if len(set([Cost[i][1] for i i... | output | 1 | 44,492 | 13 | 88,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,493 | 13 | 88,986 |
Yes | output | 1 | 44,493 | 13 | 88,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,494 | 13 | 88,988 |
Yes | output | 1 | 44,494 | 13 | 88,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,495 | 13 | 88,990 |
Yes | output | 1 | 44,495 | 13 | 88,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,496 | 13 | 88,992 |
Yes | output | 1 | 44,496 | 13 | 88,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,497 | 13 | 88,994 |
No | output | 1 | 44,497 | 13 | 88,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,498 | 13 | 88,996 |
No | output | 1 | 44,498 | 13 | 88,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,499 | 13 | 88,998 |
No | output | 1 | 44,499 | 13 | 88,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a directed weighted graph with N vertices. Each vertex has two integers written on it, and the integers written on Vertex i are A_i and B_i.
In this graph, there is an edge from Vertex ... | instruction | 0 | 44,500 | 13 | 89,000 |
No | output | 1 | 44,500 | 13 | 89,001 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,501 | 13 | 89,002 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
def parorder(Edge, p):
N = len(Edge)
par = [0]*N
par[p] = -1
stack = [p]
order = []
visited = set([p])
ast = stack.append
apo = order.append
while stack:
vn = stack.pop()
apo(vn)
for vf in Edge[v... | output | 1 | 44,501 | 13 | 89,003 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,502 | 13 | 89,004 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
N = int(input())
VW = [[int(x)-1 for x in input().split()] for _ in range(N-1)]
"""
直径に次数1の頂点が生えている
"""
graph = [[] for _ in range(N)]
deg = [0] * N
for v,w in VW:
graph[v].append(w)
graph[w].append(v)
deg[v] += 1
... | output | 1 | 44,502 | 13 | 89,005 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,503 | 13 | 89,006 |
"Correct Solution:
```
import sys
#sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def LI(): return list(map(int, s... | output | 1 | 44,503 | 13 | 89,007 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,504 | 13 | 89,008 |
"Correct Solution:
```
#!/usr/bin/env python3
def solve(n, adj_list, d):
s = []
path_adj_list = [[] for _ in range(n)]
for v in range(n):
if 1 < d[v]:
p = path_adj_list[v]
for w in adj_list[v]:
if 1 < d[w]:
p.append(w)
if 2 <... | output | 1 | 44,504 | 13 | 89,009 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,505 | 13 | 89,010 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
sys.setrecursionlimit(2*10**5)
n=int(input())
edge=[[] for i in range(n)]
for i in range(n-1):
v,w=map(int,input().split())
edge[v-1].append(w-1)
edge[w-1].append(v-1)
if n==2:
exit(print(1,2))
leafcnt=[0]*n
for v in range(n):
for nv in ... | output | 1 | 44,505 | 13 | 89,011 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:
* If p_i = 1, do no... | instruction | 0 | 44,506 | 13 | 89,012 |
"Correct Solution:
```
import sys
from collections import deque
def diameter(n, links):
q = deque([(0, -1)])
v = 0
while q:
v, p = q.popleft()
q.extend((u, v) for u in links[v] if u != p)
q = deque([(v, -1)])
w = 0
parents = [-1] * n
while q:
w, p = q.popleft()
... | output | 1 | 44,506 | 13 | 89,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,... | instruction | 0 | 44,507 | 13 | 89,014 |
No | output | 1 | 44,507 | 13 | 89,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,... | instruction | 0 | 44,508 | 13 | 89,016 |
No | output | 1 | 44,508 | 13 | 89,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,... | instruction | 0 | 44,509 | 13 | 89,018 |
No | output | 1 | 44,509 | 13 | 89,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:
First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,... | instruction | 0 | 44,510 | 13 | 89,020 |
No | output | 1 | 44,510 | 13 | 89,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be the sum of edges on the unique path between the n... | instruction | 0 | 44,646 | 13 | 89,292 |
Tags: bitmasks, graphs, interactive
Correct Solution:
```
import sys
def req(a, b):
if a == [] or b == []:
return -1
print(len(a), len(b),*a,*b)
sys.stdout.flush()
return int(input())
def br(r, l, d):
if d == 1:
return list(range(r, (r + l)//2)), list(range((r+l)//2, l))
a, b... | output | 1 | 44,646 | 13 | 89,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be the sum of edges on the unique path between the n... | instruction | 0 | 44,647 | 13 | 89,294 |
Tags: bitmasks, graphs, interactive
Correct Solution:
```
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = sys.stdin.readline().split()
self.index =... | output | 1 | 44,647 | 13 | 89,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be th... | instruction | 0 | 44,648 | 13 | 89,296 |
No | output | 1 | 44,648 | 13 | 89,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be th... | instruction | 0 | 44,649 | 13 | 89,298 |
No | output | 1 | 44,649 | 13 | 89,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be th... | instruction | 0 | 44,650 | 13 | 89,300 |
No | output | 1 | 44,650 | 13 | 89,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a weighted tree with n nodes and n-1 edges. The nodes are conveniently labeled from 1 to n. The weights are positive integers at most 100. Define the distance between two nodes to be th... | instruction | 0 | 44,651 | 13 | 89,302 |
No | output | 1 | 44,651 | 13 | 89,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have an undirected graph consisting of n nodes, numbered 1 through n. Each node has at most two incident edges. For each pair of nodes, there is at most an edge connecting them. No edge connec... | instruction | 0 | 44,895 | 13 | 89,790 |
No | output | 1 | 44,895 | 13 | 89,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have an undirected graph consisting of n nodes, numbered 1 through n. Each node has at most two incident edges. For each pair of nodes, there is at most an edge connecting them. No edge connec... | instruction | 0 | 44,896 | 13 | 89,792 |
No | output | 1 | 44,896 | 13 | 89,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have an undirected graph consisting of n nodes, numbered 1 through n. Each node has at most two incident edges. For each pair of nodes, there is at most an edge connecting them. No edge connec... | instruction | 0 | 44,897 | 13 | 89,794 |
No | output | 1 | 44,897 | 13 | 89,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I have an undirected graph consisting of n nodes, numbered 1 through n. Each node has at most two incident edges. For each pair of nodes, there is at most an edge connecting them. No edge connec... | instruction | 0 | 44,898 | 13 | 89,796 |
No | output | 1 | 44,898 | 13 | 89,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,931 | 13 | 89,862 |
Tags: greedy, math
Correct Solution:
```
import sys
f = sys.stdin
n, m = map(int, f.readline().strip().split())
v = [int(u) for u in f.readline().strip().split()]
d = [{} for u in range(n)]
for i in range(m):
xi, yi, ei = map(int, f.readline().strip().split())
d[yi-1][xi-1] = ei
d[xi-1][yi-1] = ei
def ... | output | 1 | 44,931 | 13 | 89,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,932 | 13 | 89,864 |
Tags: greedy, math
Correct Solution:
```
n, m = map(int, input().split())
x = [int(c) for c in input().split()]
ans = 0
for _ in range(m):
a, b, c = map(int, input().split())
ans = max(ans, (x[a - 1] + x[b - 1]) / c)
print(ans)
``` | output | 1 | 44,932 | 13 | 89,865 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,933 | 13 | 89,866 |
Tags: greedy, math
Correct Solution:
```
import math
def solve():
n, m = [int(i) for i in input().split()]
vw = [int(i) for i in input().split()]
M = 0.0
for _ in range(m):
a, b, c = [int(i) for i in input().split()]
M = max(M, (vw[a - 1] + vw[b - 1]) / c)
print(M)
if __name__ == '__main__':
solve... | output | 1 | 44,933 | 13 | 89,867 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,934 | 13 | 89,868 |
Tags: greedy, math
Correct Solution:
```
nodes, edges = map(int, input().split())
nodesValues = list(map(int,input().split()))
density = 0
total = 0
for i in range(edges):
node1, node2, edgeValue = map(int, input().split())
total = (nodesValues[node2-1] + nodesValues[node1-1])/edgeValue
if total > density:
... | output | 1 | 44,934 | 13 | 89,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,935 | 13 | 89,870 |
Tags: greedy, math
Correct Solution:
```
n, m = map(int, input().split())
v = list(map(int, input().split()))
mini = 0
for i in range(m):
a, b, c = map(int, input().split())
mini = max(mini, (v[a-1]+v[b-1])/c)
print(mini)
``` | output | 1 | 44,935 | 13 | 89,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,936 | 13 | 89,872 |
Tags: greedy, math
Correct Solution:
```
n, m = map(int, input().split(" "))
val = list(map(int, input().split(" ")))
ans = 0
for i in range(m):
x, y, z = map(int, input().split(" "))
ans = max(ans, (val[x-1]+val[y-1])/z)
print(ans)
``` | output | 1 | 44,936 | 13 | 89,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,937 | 13 | 89,874 |
Tags: greedy, math
Correct Solution:
```
nodes , edges = map(int,input().split())
x=list(map(int,input().split()))
error =0
for i in range(edges):
a,b,c=map(int,input().split())
error = max(error , (x[a-1]+x[b-1])/c)
print(error)
``` | output | 1 | 44,937 | 13 | 89,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 44,938 | 13 | 89,876 |
Tags: greedy, math
Correct Solution:
```
import sys
from collections import defaultdict
import math
from heapq import *
import itertools
MAXNUM = math.inf
MINNUM = -1 * math.inf
ASCIILOWER = 97
ASCIIUPPER = 65
pq = [] # list of entries arranged in a heap
entry_finder = {} # mapping of tasks to entries
REMOVED = "<r... | output | 1 | 44,938 | 13 | 89,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 44,939 | 13 | 89,878 |
Yes | output | 1 | 44,939 | 13 | 89,879 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.