message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,783 | 1 | 5,566 |
Yes | output | 1 | 2,783 | 1 | 5,567 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,784 | 1 | 5,568 |
Yes | output | 1 | 2,784 | 1 | 5,569 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,785 | 1 | 5,570 |
Yes | output | 1 | 2,785 | 1 | 5,571 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,786 | 1 | 5,572 |
Yes | output | 1 | 2,786 | 1 | 5,573 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,787 | 1 | 5,574 |
No | output | 1 | 2,787 | 1 | 5,575 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,788 | 1 | 5,576 |
No | output | 1 | 2,788 | 1 | 5,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,789 | 1 | 5,578 |
No | output | 1 | 2,789 | 1 | 5,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia lives in a city that has n houses built along the main ringroad. The ringroad houses are numbered 1 through n in the clockwise order. The ringroad traffic is one way and also is clockwise.... | instruction | 0 | 2,790 | 1 | 5,580 |
No | output | 1 | 2,790 | 1 | 5,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and ... | instruction | 0 | 2,860 | 1 | 5,720 |
Tags: combinatorics, dfs and similar, graphs, trees
Correct Solution:
```
from queue import Queue
import sys
cost = []
#coo
def readarray(): return map(int, input().split(' '))
n = int(input())
graph = [[] for i in range(n)]
for i in range(n - 1):
u, v, c = readarray()
u, v = u - 1, v - 1
cost.append(c)
... | output | 1 | 2,860 | 1 | 5,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and ... | instruction | 0 | 2,861 | 1 | 5,722 |
Tags: combinatorics, dfs and similar, graphs, trees
Correct Solution:
```
from bisect import *
from collections import *
from math import gcd,ceil,sqrt,floor,inf
from heapq import *
from itertools import *
from operator import add,mul,sub,xor,truediv,floordiv
from functools import *
#----------------------------------... | output | 1 | 2,861 | 1 | 5,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and ... | instruction | 0 | 2,862 | 1 | 5,724 |
Tags: combinatorics, dfs and similar, graphs, trees
Correct Solution:
```
import sys
sys.setrecursionlimit(1500)
MAX = 100005;
g = [[] for _ in range(MAX)]
vis = [False] * MAX
dp = [0] * MAX
prod = [0] * MAX
edges = []
order = []
def dfs(st):
stack = []
stack.append((st, -1))
vis[st] = True
while stac... | output | 1 | 2,862 | 1 | 5,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and ... | instruction | 0 | 2,863 | 1 | 5,726 |
Tags: combinatorics, dfs and similar, graphs, trees
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
... | output | 1 | 2,863 | 1 | 5,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and ... | instruction | 0 | 2,864 | 1 | 5,728 |
Tags: combinatorics, dfs and similar, graphs, trees
Correct Solution:
```
from queue import Queue
import sys
cost = []
def readarray(): return map(int, input().split(' '))
n = int(input())
graph = [[] for i in range(n)]
for i in range(n - 1):
u, v, c = readarray()
u, v = u - 1, v - 1
cost.append(c)
graph[u].ap... | output | 1 | 2,864 | 1 | 5,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The ci... | instruction | 0 | 2,865 | 1 | 5,730 |
No | output | 1 | 2,865 | 1 | 5,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The ci... | instruction | 0 | 2,866 | 1 | 5,732 |
No | output | 1 | 2,866 | 1 | 5,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The ci... | instruction | 0 | 2,867 | 1 | 5,734 |
No | output | 1 | 2,867 | 1 | 5,735 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
New Year is coming in Tree World! In this world, as the name implies, there are n cities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The ci... | instruction | 0 | 2,868 | 1 | 5,736 |
No | output | 1 | 2,868 | 1 | 5,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,869 | 1 | 5,738 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
ans = 0
b = 2 ** (n + 1) - 3
while n != 0:
n -= 1
#print(n)
p = 2 ** (n + 1) - 3
while b != p:
ans += abs(arr[b] - arr[b - 1])
arr[b // 2 - 1] += max(arr[b], arr[b -... | output | 1 | 2,869 | 1 | 5,739 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,870 | 1 | 5,740 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
def main():
n, l, res = 2 ** (int(input()) + 1) - 2, [0, 0], 0
l.extend(map(int, input().split()))
while n:
a, b = l[n], l[n + 1]
if a < b:
l[n // 2] += b
res += b - a
else:
l[n //... | output | 1 | 2,870 | 1 | 5,741 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,871 | 1 | 5,742 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
# fin = open("input.txt")
# n = int(fin.readline())
# A = [0] + list(map(int, fin.readline().split()))
n = int(input())
A = [0] + list(map(int, input().split()))
C = 0
for i in range(2 ** n - 2, -1, -1):
C += abs(A[i * 2 + 1] - A[i * 2 + 2])
A[i] += ... | output | 1 | 2,871 | 1 | 5,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,872 | 1 | 5,744 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
s = 0
n = int(input())
k = (1 << (n + 1)) - 1
a = [0, 0] + list(map(int, input().split()))
for i in range(k, 1, -2):
u, v = a[i], a[i - 1]
if u > v: u, v = v, u
s += v - u
a[i >> 1] += v
print(s)
``` | output | 1 | 2,872 | 1 | 5,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,873 | 1 | 5,746 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
#!python3
n = int(input())
a = input().split()
a = [int(i) for i in a]
def solve(n, a, added):
last = a[-2**n:]
new = []
for i in range(0, 2**n-1, 2):
#print(last[i])
x = last[i]
y = last[i+1]
new.append(max(x,y))
added = added + abs(x-y... | output | 1 | 2,873 | 1 | 5,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,874 | 1 | 5,748 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n = 2**(int(input())+1)-1;
a = [0,0] + list(map(int,input().split()))
r = 0
while n>1:
a[n//2] += max(a[n], a[n-1])
r += abs(a[n]-a[n-1])
n -= 2
print(r)
``` | output | 1 | 2,874 | 1 | 5,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,875 | 1 | 5,750 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
n = int(input())
l = list(map(int,input().split()))
l = [0]+l
top = 1
lim = 2**(n+1)-1
count = 0
def solver(top):
global count
left = top*2+1
right = 2+ top*2
if(left>lim or right>lim):
#print(top,"ret ",l[top])
return l... | output | 1 | 2,875 | 1 | 5,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to... | instruction | 0 | 2,876 | 1 | 5,752 |
Tags: dfs and similar, greedy, implementation
Correct Solution:
```
from math import floor
def main():
n = int(input())
a = list(map(int, input().split()))
streets = []
for i in range(2**n, 2**(n+1)):
#print('---')
idx = i
#print(idx)
if idx > 1:
#print('Cost: %d' % a[idx-2])
res = a[idx-2]
... | output | 1 | 2,876 | 1 | 5,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,877 | 1 | 5,754 |
Yes | output | 1 | 2,877 | 1 | 5,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,878 | 1 | 5,756 |
Yes | output | 1 | 2,878 | 1 | 5,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,879 | 1 | 5,758 |
Yes | output | 1 | 2,879 | 1 | 5,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,880 | 1 | 5,760 |
Yes | output | 1 | 2,880 | 1 | 5,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,881 | 1 | 5,762 |
No | output | 1 | 2,881 | 1 | 5,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,882 | 1 | 5,764 |
No | output | 1 | 2,882 | 1 | 5,765 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,883 | 1 | 5,766 |
No | output | 1 | 2,883 | 1 | 5,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Om Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even so... | instruction | 0 | 2,884 | 1 | 5,768 |
No | output | 1 | 2,884 | 1 | 5,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In an unspecified solar system, there are N planets. A space government company has recently hired space contractors to build M bidirectional Hyperspace™ highways, each connecting two different ... | instruction | 0 | 3,359 | 1 | 6,718 |
No | output | 1 | 3,359 | 1 | 6,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In an unspecified solar system, there are N planets. A space government company has recently hired space contractors to build M bidirectional Hyperspace™ highways, each connecting two different ... | instruction | 0 | 3,360 | 1 | 6,720 |
No | output | 1 | 3,360 | 1 | 6,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In an unspecified solar system, there are N planets. A space government company has recently hired space contractors to build M bidirectional Hyperspace™ highways, each connecting two different ... | instruction | 0 | 3,361 | 1 | 6,722 |
No | output | 1 | 3,361 | 1 | 6,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In an unspecified solar system, there are N planets. A space government company has recently hired space contractors to build M bidirectional Hyperspace™ highways, each connecting two different ... | instruction | 0 | 3,362 | 1 | 6,724 |
No | output | 1 | 3,362 | 1 | 6,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,499 | 1 | 6,998 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
from collections import deque
import sys
from array import array # noqa: F401
import typing as Tp # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
def bfs(n, adj, start):
cost = [-1] * n
cost[... | output | 1 | 3,499 | 1 | 6,999 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,500 | 1 | 7,000 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import math
import random
import sys
from bisect import bisect_left, bisect_right
from collections import Counter, UserDict, defaultdict, deque, namedtuple
from functools import cmp_to_key, lru_cache, reduce
from heapq import heapify, hea... | output | 1 | 3,500 | 1 | 7,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,501 | 1 | 7,002 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
from itertools import accumulate
from collections import deque
def BFS(adj,level,s):
queue=deque([s])
level[s]=0
while queue:
s=queue.popleft()
for i in adj[s]:
if level[i]==-1:
qu... | output | 1 | 3,501 | 1 | 7,003 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,502 | 1 | 7,004 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
"""
Template written to be used by Python Programmers.
Use at your own risk!!!!
Owned by adi0311(5 star at CodeChef and Specialist at Codeforces).
"""
# import io, os
import sys
from functools import lru_cache, cmp_to_key
from... | output | 1 | 3,502 | 1 | 7,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,503 | 1 | 7,006 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import bisect
import os
from collections import Counter
import bisect
from collections import defaultdict
import math
import random
import heapq as hq
from math import sqrt
import sys
from functools import reduce, cmp_to_key
from collecti... | output | 1 | 3,503 | 1 | 7,007 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,504 | 1 | 7,008 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import sys
from collections import deque
from itertools import accumulate
def bfs(n, s, links):
q = deque([(0, s)])
visited = set()
distances = [0] * n
while q:
d, v = q.popleft()
if v in visited:
... | output | 1 | 3,504 | 1 | 7,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,505 | 1 | 7,010 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import sys
from collections import deque
def input():
return sys.stdin.readline()[:-1]
INF = 10**6
t = int(input())
for _ in range(t):
n, m, a, b, c = map(int, input().split())
a, b, c = a-1, b-1, c-1
p = list(map(int, input().split(... | output | 1 | 3,505 | 1 | 7,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a path between each pair of vertices (districts).
... | instruction | 0 | 3,506 | 1 | 7,012 |
Tags: brute force, graphs, greedy, shortest paths, sortings
Correct Solution:
```
from sys import stdin
input=stdin.readline
def bfs(g,r):
it=-1
p=[0]*len(g)
q=[r]
v=[0]*len(g)
while(it<len(q)-1):
it+=1
v[q[it]]=1
for i in range(len(g[q[it]])):
if v[g[q[it]][i]]==... | output | 1 | 3,506 | 1 | 7,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a pa... | instruction | 0 | 3,507 | 1 | 7,014 |
Yes | output | 1 | 3,507 | 1 | 7,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a pa... | instruction | 0 | 3,508 | 1 | 7,016 |
Yes | output | 1 | 3,508 | 1 | 7,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a pa... | instruction | 0 | 3,509 | 1 | 7,018 |
Yes | output | 1 | 3,509 | 1 | 7,019 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a pa... | instruction | 0 | 3,510 | 1 | 7,020 |
Yes | output | 1 | 3,510 | 1 | 7,021 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected unweighted graph consisting of n vertices and m edges (which represents the map of Bertown) and the array of prices p of length m. It is guaranteed that there is a pa... | instruction | 0 | 3,511 | 1 | 7,022 |
No | output | 1 | 3,511 | 1 | 7,023 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.