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 a correct Python 3 solution for this coding contest problem.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge connecting Vertex i and j; otherwise, there is no such edg... | instruction | 0 | 55,413 | 13 | 110,826 |
"Correct Solution:
```
def bfs(dp, arr, i, visited):
q = []
q.append(i)
visited[i] = True
while q:
i = q.pop(0)
visited[i] = True
for j in arr[i]:
if dp[j] == -1:
dp[j] = dp[i] + 1
elif dp[i] == dp[j]:
return -1
if visited[j] == False:
visited[j] = True
q.append(j)
return 0
n=i... | output | 1 | 55,413 | 13 | 110,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,414 | 13 | 110,828 |
Yes | output | 1 | 55,414 | 13 | 110,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,415 | 13 | 110,830 |
Yes | output | 1 | 55,415 | 13 | 110,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,416 | 13 | 110,832 |
Yes | output | 1 | 55,416 | 13 | 110,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,417 | 13 | 110,834 |
Yes | output | 1 | 55,417 | 13 | 110,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,418 | 13 | 110,836 |
No | output | 1 | 55,418 | 13 | 110,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,419 | 13 | 110,838 |
No | output | 1 | 55,419 | 13 | 110,839 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,420 | 13 | 110,840 |
No | output | 1 | 55,420 | 13 | 110,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a connected undirected graph with N vertices and M edges. The vertices are numbered 1 to N, and the edges are described by a grid of characters S. If S_{i,j} is `1`, there is an edge co... | instruction | 0 | 55,421 | 13 | 110,842 |
No | output | 1 | 55,421 | 13 | 110,843 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Today is tuesday, that means there is a dispute in JOHNNY SOLVING team again: they try to understand who is Johnny and who is Solving. That's why guys asked Umnik to help them. Umnik gave guys a connected graph with n vertices without loops ... | instruction | 0 | 55,647 | 13 | 111,294 |
Tags: constructive algorithms, dfs and similar, graphs, math
Correct Solution:
```
import sys
s = sys.stdin.read()
inp = []
numb = 0
for i in range(len(s)):
if s[i]>='0':
numb = 10*numb + ord(s[i])-48
else:
inp.append(numb)
numb = 0
if s[-1]>='0':
inp.append(numb)
ii = 0
n = inp[... | output | 1 | 55,647 | 13 | 111,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today is tuesday, that means there is a dispute in JOHNNY SOLVING team again: they try to understand who is Johnny and who is Solving. That's why guys asked Umnik to help them. Umnik gave guys a... | instruction | 0 | 55,648 | 13 | 111,296 |
No | output | 1 | 55,648 | 13 | 111,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Today is tuesday, that means there is a dispute in JOHNNY SOLVING team again: they try to understand who is Johnny and who is Solving. That's why guys asked Umnik to help them. Umnik gave guys a... | instruction | 0 | 55,649 | 13 | 111,298 |
No | output | 1 | 55,649 | 13 | 111,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if <image>. Let d(u, v) be the shortest ... | instruction | 0 | 56,125 | 13 | 112,250 |
No | output | 1 | 56,125 | 13 | 112,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if <image>. Let d(u, v) be the shortest ... | instruction | 0 | 56,126 | 13 | 112,252 |
No | output | 1 | 56,126 | 13 | 112,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if <image>. Let d(u, v) be the shortest ... | instruction | 0 | 56,127 | 13 | 112,254 |
No | output | 1 | 56,127 | 13 | 112,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a positive integer n. Let's build a graph on vertices 1, 2, ..., n in such a way that there is an edge between vertices u and v if and only if <image>. Let d(u, v) be the shortest ... | instruction | 0 | 56,128 | 13 | 112,256 |
No | output | 1 | 56,128 | 13 | 112,257 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,243 | 13 | 112,486 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
MOD=10**9+7
def dot(a, b):
res = [[0] * n for _ in range(n)]
for i in range(n):
for k, aik in enumerate(a[i]):
for j,bkj in enumerate(b[k]):
res[i][j] += aik*bkj
res[i][j] %= MOD
return res
n,k = ... | output | 1 | 56,243 | 13 | 112,487 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,244 | 13 | 112,488 |
"Correct Solution:
```
mod = 10**9+7
def mat_mul(A, B):
# A,Bは正方行列とする
C = [[0]*N for _ in range(N)]
for i in range(N):
for j in range(N):
C[i][j] = sum(A[i][k] * B[k][j] for k in range(N)) % mod
return C
def matpow(A, n):
B = [[0]*N for _ in range(N)]
for i in range(N):
... | output | 1 | 56,244 | 13 | 112,489 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,245 | 13 | 112,490 |
"Correct Solution:
```
import sys
stdin = sys.stdin
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def naa(N): return [na() for _ in range(N)]
def ns(): return stdin.readline().rstrip() # ignore trailing spaces
def matrix_cal(A, B, mod):
a = len(A)
b = len(A[0])... | output | 1 | 56,245 | 13 | 112,491 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,246 | 13 | 112,492 |
"Correct Solution:
```
n, kk = map(int, input().split())
AA = [list(map(int, input().split())) for _ in range(n)]
mod = 10 ** 9 + 7
# nxnの行列積
def matrix_product(A, B):
res = [[0] * n for _ in range(n)]
for i in range(n):
for k in range(n):
for j in range(n):
res[i][j] += A... | output | 1 | 56,246 | 13 | 112,493 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,247 | 13 | 112,494 |
"Correct Solution:
```
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import fac... | output | 1 | 56,247 | 13 | 112,495 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,248 | 13 | 112,496 |
"Correct Solution:
```
p = 10**9+7
def pow(X,k):
if k==0:
return [[1 if i==j else 0 for j in range(N)] for i in range(N)]
if k==1:
return X
if k%2==0:
Y = pow(X,k//2)
Z = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
... | output | 1 | 56,248 | 13 | 112,497 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,249 | 13 | 112,498 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
def matDot(A,B,MOD):
N,M,L = len(A),len(A[0]),len(B[0])
res = [[0]*L for i in range(N)]
for i in range(N):
for j in range(L):
s = 0
for k in range(M):
s = (s + A[i][k]*B[k][j]) % MOD
... | output | 1 | 56,249 | 13 | 112,499 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j. If a_{i, j} = 1, there is a d... | instruction | 0 | 56,250 | 13 | 112,500 |
"Correct Solution:
```
n,k = map(int,input().split())
g = [list(map(int,input().split())) for i in range(n)]
mod = 10**9+7
ans = 0
def mul(x,y):
res = []
for i in range(n):
tmp = []
for j in range(n):
ko = 0
for k in range(n):
ko += x[i][k] * y[k][j]
ko %=mod
tmp.append(ko)... | output | 1 | 56,250 | 13 | 112,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,251 | 13 | 112,502 |
Yes | output | 1 | 56,251 | 13 | 112,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,252 | 13 | 112,504 |
Yes | output | 1 | 56,252 | 13 | 112,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,253 | 13 | 112,506 |
Yes | output | 1 | 56,253 | 13 | 112,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,254 | 13 | 112,508 |
Yes | output | 1 | 56,254 | 13 | 112,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,255 | 13 | 112,510 |
No | output | 1 | 56,255 | 13 | 112,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,256 | 13 | 112,512 |
No | output | 1 | 56,256 | 13 | 112,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,257 | 13 | 112,514 |
No | output | 1 | 56,257 | 13 | 112,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple directed graph G with N vertices, numbered 1, 2, \ldots, N.
For each i and j (1 \leq i, j \leq N), you are given an integer a_{i, j} that represents whether there is a directe... | instruction | 0 | 56,258 | 13 | 112,516 |
No | output | 1 | 56,258 | 13 | 112,517 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,379 | 13 | 112,758 |
"Correct Solution:
```
# coding=utf-8
class Tree():
def __init__(self):
self.root = None
def insert(self, key):
node = Node(key)
flag = False
if self.root == None:
self.root = node
else:
search_node = self.root
while search_node:
... | output | 1 | 56,379 | 13 | 112,759 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,380 | 13 | 112,760 |
"Correct Solution:
```
import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
root = None
def insert(key):
global root
x, y = root, None
while x is not None: x, y = x.left if key < x.key else x.right, x
... | output | 1 | 56,380 | 13 | 112,761 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,381 | 13 | 112,762 |
"Correct Solution:
```
class Node:
def __init__(self, key, parent=None, left=None, right=None):
self.key = key
self.parent = parent
self.left = left
self.right = right
class Tree:
root = None
preorder_list = []
inorder_list = []
def __init__(self):
pass
d... | output | 1 | 56,381 | 13 | 112,763 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,382 | 13 | 112,764 |
"Correct Solution:
```
n = int(input())
class Node:
def __init__(self):
self.key = -1
self.parent_id = -1
self.left_id = -1
self.right_id = -1
def insert(nodes,z):
y = -1
root_id = -1
for i in range(len(nodes)):
if nodes[i].parent_id == -1:
root_id ... | output | 1 | 56,382 | 13 | 112,765 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,383 | 13 | 112,766 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
print = sys.stdout.write
class Node:
__slots__ = ["data", "left", "right"]
def __init__(self, data):
self.data = data
self.left = None
self.right = None
class BinarySearchTree:
__slots__ = ["root"]
def __init__(self):... | output | 1 | 56,383 | 13 | 112,767 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,384 | 13 | 112,768 |
"Correct Solution:
```
class BinarySearchTree:
root = None
def insert(self, k):
y = None
x = self.root
z = Node(k)
while x:
y = x
if z.k < x.k:
x = x.l
else:
x = x.r
z.p = y
if y == None:... | output | 1 | 56,384 | 13 | 112,769 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,385 | 13 | 112,770 |
"Correct Solution:
```
"""
二分探索木を構成する
"""
import copy
class Node:
def __init__(self, node_id, parent=None, left=None, right=None):
self.node_id = node_id
self.parent = parent
self.left = left
self.right = right
class Tree:
def insert_root_node(self, new_id):
global root... | output | 1 | 56,385 | 13 | 112,771 |
Provide a correct Python 3 solution for this coding contest problem.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Binary search tree is one of fundamental search trees. The ... | instruction | 0 | 56,386 | 13 | 112,772 |
"Correct Solution:
```
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_8_A
#????????????
def insert(root, insert_node):
focus_node = root
parent = None
while not focus_node == None:
parent = focus_node
if focus_node["data"] > insert_node["data"]:
focus_node = fo... | output | 1 | 56,386 | 13 | 112,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,387 | 13 | 112,774 |
Yes | output | 1 | 56,387 | 13 | 112,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,388 | 13 | 112,776 |
Yes | output | 1 | 56,388 | 13 | 112,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,389 | 13 | 112,778 |
Yes | output | 1 | 56,389 | 13 | 112,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,390 | 13 | 112,780 |
Yes | output | 1 | 56,390 | 13 | 112,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,391 | 13 | 112,782 |
No | output | 1 | 56,391 | 13 | 112,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,392 | 13 | 112,784 |
No | output | 1 | 56,392 | 13 | 112,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,393 | 13 | 112,786 |
No | output | 1 | 56,393 | 13 | 112,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Search trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.
Bin... | instruction | 0 | 56,394 | 13 | 112,788 |
No | output | 1 | 56,394 | 13 | 112,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an unweighted tree with n vertices. Then n - 1 following operations are applied to the tree. A single operation consists of the following steps:
1. choose two leaves;
2. add the length of the simple path between them to ... | instruction | 0 | 56,898 | 13 | 113,796 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
import sys
from collections import deque as dq
n = int(input())
ind = 0
inp = [int(x)-1 for line in sys.stdin.readlines() for x in line.split()]
coupl = [[] for _ in range(n)]
for _ in range(n-1):
a,b = inp[ind],inp[ind+1]... | output | 1 | 56,898 | 13 | 113,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an unweighted tree with n vertices. Then n - 1 following operations are applied to the tree. A single operation consists of the following steps:
1. choose two leaves;
2. add the length of the simple path between them to ... | instruction | 0 | 56,899 | 13 | 113,798 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
import sys
def main():
n = int(input())
edges = list(map(int, sys.stdin.read().split()))
tree_edges = dict()
for i in range(n):
tree_edges[i + 1] = set()
for i in range(0, len(edges) - 1, 2):
... | output | 1 | 56,899 | 13 | 113,799 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.