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 graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,479 | 13 | 90,958 |
No | output | 1 | 45,479 | 13 | 90,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,555 | 13 | 91,110 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
import sys
from collections import defaultdict,deque
input=sys.stdin.readline
for _ in range(int(input())):
n=int(input())
g=defaultdict(list)
for i in range(n-1):
u,v=map(int,input().split())
g[u].append(v)... | output | 1 | 45,555 | 13 | 91,111 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,556 | 13 | 91,112 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
"""
NTC here
"""
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
# def dfs(adj, start=0):
# n = len(adj)
# visited = [False]*n
# srt = [start]
# parent = [-1]*n
# childs = [[] for i in... | output | 1 | 45,556 | 13 | 91,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,557 | 13 | 91,114 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
from sys import stdin, stdout
readline, printline = stdin.readline, stdout.write
def mint():
return int(readline())
def mints():
return list(map(int, readline().split()))
class Node:
def __init__(self, val):
se... | output | 1 | 45,557 | 13 | 91,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,558 | 13 | 91,116 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
_str = str
BUFSIZE = 8192
def str(x=b''):
return x if type(x) is bytes else _str(x).encode()
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self... | output | 1 | 45,558 | 13 | 91,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,559 | 13 | 91,118 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
import io
import os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs... | output | 1 | 45,559 | 13 | 91,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,560 | 13 | 91,120 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
import sys
from collections import defaultdict, deque
from operator import itemgetter
sys.setrecursionlimit(200000)
_DEBUG = False
if _DEBUG:
sys.stdin = open('c.in')
else:
input = sys.stdin.readline
def solve(n: int, edges)... | output | 1 | 45,560 | 13 | 91,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,561 | 13 | 91,122 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
def solve(N, graph):
stack = [0]
Par = [-1]*N
checked = [False]*N
Children = [1]*N
checked[0] = True
Ch = [-1]*N
while stack:
p = stack.pop()
if... | output | 1 | 45,561 | 13 | 91,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (remove it and remove all edges from this vertex)... | instruction | 0 | 45,562 | 13 | 91,124 |
Tags: constructive algorithms, dfs and similar, graphs, trees
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutati... | output | 1 | 45,562 | 13 | 91,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,563 | 13 | 91,126 |
Yes | output | 1 | 45,563 | 13 | 91,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,564 | 13 | 91,128 |
Yes | output | 1 | 45,564 | 13 | 91,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,565 | 13 | 91,130 |
Yes | output | 1 | 45,565 | 13 | 91,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,566 | 13 | 91,132 |
Yes | output | 1 | 45,566 | 13 | 91,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,567 | 13 | 91,134 |
No | output | 1 | 45,567 | 13 | 91,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,568 | 13 | 91,136 |
No | output | 1 | 45,568 | 13 | 91,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,569 | 13 | 91,138 |
No | output | 1 | 45,569 | 13 | 91,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fishing Prince loves trees, and he especially loves trees with only one centroid. The tree is a connected graph without cycles.
A vertex is a centroid of a tree only when you cut this vertex (r... | instruction | 0 | 45,570 | 13 | 91,140 |
No | output | 1 | 45,570 | 13 | 91,141 |
Provide tags and a correct Python 2 solution for this coding contest problem.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help him in solving the problem.
You are given a wei... | instruction | 0 | 45,742 | 13 | 91,484 |
Tags: dp, sortings
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
raw_input = stdin.readline
pr = stdout.write
mod=10**9+7
def ni():
return int(raw_input())
def li():
return map(int,raw_input().split())
def pn(n):
stdout.write(str(n)+'\n')
def pa(arr)... | output | 1 | 45,742 | 13 | 91,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help him in solving the problem.
You are given a wei... | instruction | 0 | 45,743 | 13 | 91,486 |
Tags: dp, sortings
Correct Solution:
```
from sys import *
f = list(map(int, stdin.read().split()))
n, m = f[0], f[1]
d = [[] for i in range(100001)]
for j in range(2, len(f), 3):
x, y, w = f[j:j + 3]
d[w].append((y, x))
s = [0] * (n + 1)
for q in d:
for y, k in [(y, s[x]) for y, x in q]: s[y] = max(s[y]... | output | 1 | 45,743 | 13 | 91,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help him in solving the problem.
You are given a wei... | instruction | 0 | 45,744 | 13 | 91,488 |
Tags: dp, sortings
Correct Solution:
```
from sys import *
a = list(map(int, stdin.read().split()))
n = a[0]
m = a[1]
inf = 10**5 + 1
g = [[] for i in range(inf)]
for i in range(2, len(a), 3):
b, c, w = a[i:i + 3]
g[w].append((c, b))
n += 1
s = [0] * n
for l in g:
for i, k in [(i, s[j]) for i, j in l]:
s[i] =... | output | 1 | 45,744 | 13 | 91,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help h... | instruction | 0 | 45,745 | 13 | 91,490 |
No | output | 1 | 45,745 | 13 | 91,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help h... | instruction | 0 | 45,746 | 13 | 91,492 |
No | output | 1 | 45,746 | 13 | 91,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help h... | instruction | 0 | 45,747 | 13 | 91,494 |
No | output | 1 | 45,747 | 13 | 91,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Pashmak's homework is a problem about graphs. Although he always tries to do his homework completely, he can't solve this problem. As you know, he's really weak at graph theory; so try to help h... | instruction | 0 | 45,748 | 13 | 91,496 |
No | output | 1 | 45,748 | 13 | 91,497 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,960 | 13 | 91,920 |
"Correct Solution:
```
from collections import defaultdict
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
bxs = list(map(int, input().split()))
xs = bxs[:]
dd = defaultdict(set)
for i, x in enumerate(xs):
dd[x].add(i+1)
xs = list(set(xs))
xs.sort()
#for x, i in xs:
G = [set() for _ in range... | output | 1 | 45,960 | 13 | 91,921 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,961 | 13 | 91,922 |
"Correct Solution:
```
import sys
N, M = map(int, input().split())
D = list(map(int, input().split()))
DI = list(zip(D, list(range(N))))
G = [[] for _ in range(N)]
for i in range(M):
u, v = map(int, input().split())
G[u-1].append((v-1, i))
G[v-1].append((u-1, i))
DI.sort()
V = [-1]*N
j = 0
used = [False]*N
... | output | 1 | 45,961 | 13 | 91,923 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,962 | 13 | 91,924 |
"Correct Solution:
```
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
def argsort(li, key=None, reverse=False):
return [i for _, i in sorted(
[(a, i) for i, a in enum... | output | 1 | 45,962 | 13 | 91,925 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,963 | 13 | 91,926 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
xs = list(map(int, input().split()))
G = [set() for _ in range(N)]
for i in range(M):
u, v = sorted(map(int, input().split()),key=lambda x:[xs[x-1],-x])
G[v-1].add((u-1,i))
xs,d,cc = sorted([(x,i) for i, x in enumerate... | output | 1 | 45,963 | 13 | 91,927 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,964 | 13 | 91,928 |
"Correct Solution:
```
"""
明らかに無理→最小が2つ無い or 最小同士がペアになってない
(最小から接続する頂点に最小がない)
満たしてる→最小の辺を置いちゃおう
小さい奴からGreedyに置いてく？
自分の周りにendしてるやつ or 大きさが同じやつがあったら繋げちゃう
そのとき白黒はどうでも良さそう？
"""
import sys
N,M = map(int,input().split())
D = list(map(int,input().split()))
dic2 = [[] for i in range(N)]
for i in range(M):
U,V = map... | output | 1 | 45,964 | 13 | 91,929 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,965 | 13 | 91,930 |
"Correct Solution:
```
import sys
from operator import itemgetter
def solve(n, m, ddd, links):
ddi = list(enumerate(ddd))
ddi.sort(key=itemgetter(1))
LIMIT = 10 ** 9 + 1
costs = [LIMIT] * m
for v, dv in ddi:
du, li, u = min(links[v])
if du > dv:
print(-1)
re... | output | 1 | 45,965 | 13 | 91,931 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,966 | 13 | 91,932 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
xs = list(map(int, input().split()))
G = [set() for _ in range(N+1)]
es = []
for i in range(M):
u, v = sorted(map(int, input().split()))
if xs[u-1] == xs[v-1]:
G[v].add(u)
G[u].add(v)
elif xs[u-1] >... | output | 1 | 45,966 | 13 | 91,933 |
Provide a correct Python 3 solution for this coding contest problem.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers D_1, D_2, ..., D_N.
Determine whether the conditions be... | instruction | 0 | 45,967 | 13 | 91,934 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
xs = list(map(int, input().split()))
G = [set() for _ in range(N+1)]
es = []
for i in range(M):
u, v = map(int, input().split())
if xs[u-1] == xs[v-1]:
G[v].add(u)
G[u].add(v)
elif xs[u-1] > xs[v-1... | output | 1 | 45,967 | 13 | 91,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,968 | 13 | 91,936 |
Yes | output | 1 | 45,968 | 13 | 91,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,969 | 13 | 91,938 |
Yes | output | 1 | 45,969 | 13 | 91,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,970 | 13 | 91,940 |
Yes | output | 1 | 45,970 | 13 | 91,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,971 | 13 | 91,942 |
Yes | output | 1 | 45,971 | 13 | 91,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,972 | 13 | 91,944 |
No | output | 1 | 45,972 | 13 | 91,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,973 | 13 | 91,946 |
No | output | 1 | 45,973 | 13 | 91,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,974 | 13 | 91,948 |
No | output | 1 | 45,974 | 13 | 91,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a connected undirected graph with N vertices and M edges. Edge i in this graph (1 \leq i \leq M) connects Vertex U_i and Vertex V_i bidirectionally. We are additionally given N integers ... | instruction | 0 | 45,975 | 13 | 91,950 |
No | output | 1 | 45,975 | 13 | 91,951 |
Provide a correct Python 3 solution for this coding contest problem.
Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain posi... | instruction | 0 | 46,115 | 13 | 92,230 |
"Correct Solution:
```
from collections import deque
try:
while 1:
V, d = map(int, input().split())
F = [0]*V
a = b = 1
for v in range(V):
a, b = (a+b) % 1001, a
F[v] = a
G = [[] for i in range(V)]
for i in range(V):
for j in range(... | output | 1 | 46,115 | 13 | 92,231 |
Provide a correct Python 3 solution for this coding contest problem.
Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain posi... | instruction | 0 | 46,116 | 13 | 92,232 |
"Correct Solution:
```
def initSets(N):
return [ x for x in range(N) ]
def getRoot(arr, n):
while arr[n] != n:
arr[n] = arr[arr[n]]
n = arr[n]
return n
def union(arr, n, m):
a = getRoot(arr, n)
b = getRoot(arr, m)
if a != b:
arr[a] = b
def isSameSet(arr, n, m):
ret... | output | 1 | 46,116 | 13 | 92,233 |
Provide a correct Python 3 solution for this coding contest problem.
Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain posi... | instruction | 0 | 46,117 | 13 | 92,234 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10000000)
MOD = 1001
INF = 10 ** 15
class UnionFind():
def __init__(self,n):
self.n = n
self.parents = [-1]*n
def find(self,x): #根を見つける、繋ぎ直す
if self.parents[x] < 0:
return x
else:
self.parents[x] = ... | output | 1 | 46,117 | 13 | 92,235 |
Provide a correct Python 3 solution for this coding contest problem.
Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).
Let V and d be two certain posi... | instruction | 0 | 46,119 | 13 | 92,238 |
"Correct Solution:
```
while 1:
try:
v,d=map(int,input().split())
f=[0]*(v+1)
f[0],f[1]=1,2
for i in range(2,v+1):
f[i]=(f[i-1]+f[i-2])%1001
f.sort()
c=1
for i in range(2,v+1):
if f[i]-f[i-1]>=d: c+=1
print(c)
except:break
`... | output | 1 | 46,119 | 13 | 92,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where w... | instruction | 0 | 46,120 | 13 | 92,240 |
No | output | 1 | 46,120 | 13 | 92,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted undirected tree consisting of n vertices. Vertex 1 is the root.
Let's denote a depth array of vertex x as an infinite sequence [d_{x, 0}, d_{x, 1}, d_{x, 2}, ...], where ... | instruction | 0 | 46,176 | 13 | 92,352 |
No | output | 1 | 46,176 | 13 | 92,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted undirected tree consisting of n vertices. Vertex 1 is the root.
Let's denote a depth array of vertex x as an infinite sequence [d_{x, 0}, d_{x, 1}, d_{x, 2}, ...], where ... | instruction | 0 | 46,177 | 13 | 92,354 |
No | output | 1 | 46,177 | 13 | 92,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted undirected tree consisting of n vertices. Vertex 1 is the root.
Let's denote a depth array of vertex x as an infinite sequence [d_{x, 0}, d_{x, 1}, d_{x, 2}, ...], where ... | instruction | 0 | 46,178 | 13 | 92,356 |
No | output | 1 | 46,178 | 13 | 92,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted undirected tree consisting of n vertices. Vertex 1 is the root.
Let's denote a depth array of vertex x as an infinite sequence [d_{x, 0}, d_{x, 1}, d_{x, 2}, ...], where ... | instruction | 0 | 46,179 | 13 | 92,358 |
No | output | 1 | 46,179 | 13 | 92,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mitya has a rooted tree with n vertices indexed from 1 to n, where the root has index 1. Each vertex v initially had an integer number a_v ≥ 0 written on it. For every vertex v Mitya has computed s_v: the sum of all values written on the ver... | instruction | 0 | 46,231 | 13 | 92,462 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
n = int(input())
p = list(map(int, input().split()))
s = list(map(int, input().split()))
a = [0]*n
a[0] = s[0]
g = [[] for _ in range(n+1)]
for i in range(n-1):
g[p[i]].append(i+2)
for i in range(1, n):
if s[i] == -1:
if... | output | 1 | 46,231 | 13 | 92,463 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.