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 an undirected connected graph consisting of n vertices and m edges. There are no loops and no multiple edges in the graph.
You are also given two distinct vertices s and t, and tw... | instruction | 0 | 446 | 13 | 892 |
No | output | 1 | 446 | 13 | 893 |
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 connected graph consisting of n vertices and m edges. There are no loops and no multiple edges in the graph.
You are also given two distinct vertices s and t, and tw... | instruction | 0 | 447 | 13 | 894 |
No | output | 1 | 447 | 13 | 895 |
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 connected graph consisting of n vertices and m edges. There are no loops and no multiple edges in the graph.
You are also given two distinct vertices s and t, and tw... | instruction | 0 | 448 | 13 | 896 |
No | output | 1 | 448 | 13 | 897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a rooted tree with n nodes. The Night King removes exactly one node from the tree and all the edges associated with it. Doing this splits the tree and forms a forest. The node which is rem... | instruction | 0 | 449 | 13 | 898 |
No | output | 1 | 449 | 13 | 899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 455 | 13 | 910 |
Tags: dfs and similar, graphs
Correct Solution:
```
import sys
from math import *
def minp():
return sys.stdin.readline().strip()
def mint():
return int(minp())
def mints():
return map(int, minp().split())
n, x = mints()
e = [[] for i in range(n)]
for i in range(n-1):
a, b = mints()
e[a-1].append(b-1)
e[b-1].... | output | 1 | 455 | 13 | 911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 456 | 13 | 912 |
Tags: dfs and similar, graphs
Correct Solution:
```
import sys
from collections import deque
n, x = map(int, sys.stdin.buffer.readline().decode('utf-8').split())
x -= 1
adj = [[] for _ in range(n)]
for u, v in (map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):
adj[u-1].append(v-1)
adj[v-1]... | output | 1 | 456 | 13 | 913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 457 | 13 | 914 |
Tags: dfs and similar, graphs
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
from collections import deque
def prog():
n,x = map(int,input().split())
adj = [[] for i in range(n + 1)]
for i in range(n-1):
u,v = map(int,input().split())
adj[u].append(v)
adj[v].appen... | output | 1 | 457 | 13 | 915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 458 | 13 | 916 |
Tags: dfs and similar, graphs
Correct Solution:
```
def prog():
from sys import stdin
from collections import deque
n,x = map(int,stdin.readline().split())
x-=1
d = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int,stdin.readline().split())
d[a-1].append(b-1)
d[b-... | output | 1 | 458 | 13 | 917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 459 | 13 | 918 |
Tags: dfs and similar, graphs
Correct Solution:
```
from collections import deque
from sys import stdin
#parsea una linea
def parser():
return map(int, stdin.readline().split())
#Metodo usado para calcular las distancia de un vertice al resto de los vertices
def BFS(s):
distance=[-1 for i in range(n)]
dist... | output | 1 | 459 | 13 | 919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 460 | 13 | 920 |
Tags: dfs and similar, graphs
Correct Solution:
```
from collections import deque
from sys import stdin
#parser
def parser():
return [int(i) for i in stdin.readline().split(" ")]
#Algoritmo BFS
def BFS(s):
if s==0:
distance=distance_Alice
else:
distance=distance_Bob
distance[s]=0
q... | output | 1 | 460 | 13 | 921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 461 | 13 | 922 |
Tags: dfs and similar, graphs
Correct Solution:
```
import sys,math,itertools
from collections import Counter,deque,defaultdict
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map... | output | 1 | 461 | 13 | 923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree.
Alice starts at vertex 1 ... | instruction | 0 | 462 | 13 | 924 |
Tags: dfs and similar, graphs
Correct Solution:
```
from sys import stdin
#Clase nodo
class Node():
def __init__(self,value=None,prox=None):
self.value=value
self.prox=prox
#Clase cola
class Queue:
def __init__(self):
self.first=None
self.last=None
self.count=0
... | output | 1 | 462 | 13 | 925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is t... | instruction | 0 | 465 | 13 | 930 |
Yes | output | 1 | 465 | 13 | 931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice got tired of playing the tag game by the usual rules so she offered Bob a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is t... | instruction | 0 | 469 | 13 | 938 |
No | output | 1 | 469 | 13 | 939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 508 | 13 | 1,016 |
Tags: graphs, greedy, implementation
Correct Solution:
```
import sys
n = int(input())
pos = []
ind = 0
inp = [s for line in sys.stdin.readlines() for s in line.split()]
color = []
costs = 0
reds = []
greens = []
blues = []
for i in range(n):
a,b = inp[ind],inp[ind+1]
ind+=2
pos.append(int(a))
color.... | output | 1 | 508 | 13 | 1,017 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 509 | 13 | 1,018 |
Tags: graphs, greedy, implementation
Correct Solution:
```
k=int(input())
t,a,b,m,n,o,d,e,s,x,y,z,l=13*[0]
for i in range(k):
c=input().split(" ")
f=int(c[0])
if c[1]=="G":
if o<1:
z=f
if t:
if m>0:
d=max(d,f-m)
if n>0:
e=ma... | output | 1 | 509 | 13 | 1,019 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 510 | 13 | 1,020 |
Tags: graphs, greedy, implementation
Correct Solution:
```
from sys import exit, stdin, stdout
input, print = stdin.readline, stdout.write
n = int(input())
r, g, b = [], [], []
ans = 0
for i in range(n):
x, t = [i for i in input().split()]
x = int(x)
if t == 'G':
g.append(x)
elif t == 'R':
... | output | 1 | 510 | 13 | 1,021 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 511 | 13 | 1,022 |
Tags: graphs, greedy, implementation
Correct Solution:
```
k=int(input())
t,a,b,m,n,o,d,e,s,x,y,z,l=13*[0]
for i in range(k):
c=input().split(" ")
f=int(c[0])
if c[1]=="G":
if o<1:
z=f
if t:
if m>0:
d=max(d,f-m)
if n>0:
e=ma... | output | 1 | 511 | 13 | 1,023 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 512 | 13 | 1,024 |
Tags: graphs, greedy, implementation
Correct Solution:
```
n=int(input())
g=[]
r=[]
b=[]
lr=0
lb=0
lg=0
for i in range(n):
a=input().split(" ")
if a[1]=="G":
g.append(int(a[0]))
lg+=1
if a[1]=="R":
r.append(int(a[0]))
lr+=1
if a[1]=="B":
b.append(int(a[0]))
... | output | 1 | 512 | 13 | 1,025 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 513 | 13 | 1,026 |
Tags: graphs, greedy, implementation
Correct Solution:
```
n = int( input() )
min_red, max_red = -1, -1
min_blue, max_blue = -1, -1
left_green, right_green = -1, -1
a = []
ans = 0
last_r, last_b, last_g = -1, -1, -1
r_edges = []
b_edges = []
g_edges = []
for i in range( n ):
p, c = input().split()
p = ... | output | 1 | 513 | 13 | 1,027 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 514 | 13 | 1,028 |
Tags: graphs, greedy, implementation
Correct Solution:
```
#! /usr/bin/env python3
#------------------------------------------------
# Author: krishna
# Created: Fri Dec 29 23:04:38 IST 2017
# File Name: f.py
# USAGE:
# f.py
# Description:
#
#------------------------------------------------
import sys
n =... | output | 1 | 514 | 13 | 1,029 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Roy and Biv have a set of n points on the infinite number line.
Each point has one of 3 colors: red, green, or blue.
Roy and Biv would like to connect all the points with some edges. Edges can be drawn between any of the two of the given p... | instruction | 0 | 515 | 13 | 1,030 |
Tags: graphs, greedy, implementation
Correct Solution:
```
n=int(input())
nfirst,rc,bc,memr,memb,memg,dr,db,s,rl,bl,gl,lg=13*[0]
for i in range(n):
a=input().split(" ")
if a[1]=="G":
if memg==0:
gl=int(a[0])
if nfirst:
if memr>0:
dr=max(dr,int(a[0])-memr)
... | output | 1 | 515 | 13 | 1,031 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 591 | 13 | 1,182 |
"Correct Solution:
```
s=input()
if s[0]=='0' or s[-1]=='1' or s[:-1]!=s[:-1][::-1]:
print(-1)
exit(0)
e=[]
bi=0
for i,j in enumerate(s[:-1]):
e.append([bi,i+1])
if j=='1':
bi=i+1
for i,j in e:
print(i+1,j+1)
``` | output | 1 | 591 | 13 | 1,183 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 592 | 13 | 1,184 |
"Correct Solution:
```
s = input()
n,m,m2 = len(s),1,2
if 1-int(s[0]) or int(s[-1]) or any(s[i]!=s[n-i-2] for i in range(n-1)): print(-1)
else:
for i in range(n-1):
print(m,m2)
if int(s[i]): m = m2
m2+=1
``` | output | 1 | 592 | 13 | 1,185 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 593 | 13 | 1,186 |
"Correct Solution:
```
#01:36
s = input()
n = len(s)
if s[-1] == '1':
print(-1)
exit()
t = s[:-1]
if t[::-1] != t:
print(-1)
exit()
if s[0] == '0':
print(-1)
exit()
print(0+1,1+1)
now = 0
for i in range(2,n):
print(now+1,i+1)
if s[i-1] == '1':
now = i
``` | output | 1 | 593 | 13 | 1,187 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 594 | 13 | 1,188 |
"Correct Solution:
```
x = [c for c in input()]
n = len(x)
ret=[]
for i in range(n-1):
ret.append([0,0])
if x[n-1] == "1":
print (-1)
elif x[0] == "0":
print (-1)
else:
flg = 1
for i in range(n-1):
if x[i] != x[n-1-i-1]:
flg = 0
if flg == 0:
print (-1)
else:
... | output | 1 | 594 | 13 | 1,189 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 595 | 13 | 1,190 |
"Correct Solution:
```
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):... | output | 1 | 595 | 13 | 1,191 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 596 | 13 | 1,192 |
"Correct Solution:
```
s = input()
n = len(s)
if s[n - 1] == '1' or s[0] == '0':
print(-1)
exit()
for i in range(n):
if s[i] != s[n - i - 2]:
print(-1)
exit()
cur_s = 2
cur_p = 2
print(1, 2)
for i in range(n - 2):
if s[i + 1] == '1':
print(cur_s + 1, cur_p)
cur_p = cur... | output | 1 | 596 | 13 | 1,193 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 597 | 13 | 1,194 |
"Correct Solution:
```
s = input()
if s[0] == '0' or s[-1] == '1' or s[:-1] != s[:-1][::-1]:
print(-1)
exit(0)
edges = []
head = 0
for idx, i in enumerate(s[:-1]):
edges.append([head, idx + 1])
if i == '1':
head = idx + 1
for i, j in edges:
print(i + 1, j + 1)
``` | output | 1 | 597 | 13 | 1,195 |
Provide a correct Python 3 solution for this coding contest problem.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.
* If the i-th cha... | instruction | 0 | 598 | 13 | 1,196 |
"Correct Solution:
```
s = input()
l = len(s)
if s[0] != '1' or s[-2] != '1' or s[-1] != '0':
print('-1')
exit()
if s[:-1] != s[:-1][::-1]:
print('-1')
exit()
# 1頂点に全部ついた状態から始める
e = [l] + [-1] * (l-1)
now = 0
h = (l-1) // 2
for i in range(h, 0, -1):
c = s[i]
if c == '0':
continue
# now の木から子をi個取り出して... | output | 1 | 598 | 13 | 1,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 599 | 13 | 1,198 |
Yes | output | 1 | 599 | 13 | 1,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 600 | 13 | 1,200 |
Yes | output | 1 | 600 | 13 | 1,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 601 | 13 | 1,202 |
Yes | output | 1 | 601 | 13 | 1,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 602 | 13 | 1,204 |
Yes | output | 1 | 602 | 13 | 1,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 603 | 13 | 1,206 |
No | output | 1 | 603 | 13 | 1,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 604 | 13 | 1,208 |
No | output | 1 | 604 | 13 | 1,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 605 | 13 | 1,210 |
No | output | 1 | 605 | 13 | 1,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s of length n. Does a tree with n vertices that satisfies the following conditions exist?
* The vertices are numbered 1,2,..., n.
* The edges are numbered 1,2,..., n-1, a... | instruction | 0 | 606 | 13 | 1,212 |
No | output | 1 | 606 | 13 | 1,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 836 | 13 | 1,672 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import math
n,m=map(int,input().split())
neigh=[]
for i in range(n):
neigh.append([])
for i in range(m):
a,b=map(int,input().split())
neigh[a-1].append(b-1)
neigh[b-1].append(a-1)
seen=set()
index=[0]*n
diams=[]
trees=0
... | output | 1 | 836 | 13 | 1,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 837 | 13 | 1,674 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
from collections import deque
##make the tree
n,m=[int(x) for x in input().split()]
tree={}
for i in range(m):
a,b=[int(x) for x in input().split()]
if a not in tree:
tree[a]=[b]
else:
tree[a].append(b)
i... | output | 1 | 837 | 13 | 1,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 838 | 13 | 1,676 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import sys
sys.setrecursionlimit(10000)
class Tree():
def __init__(self, nodes):
self.root = None
class Node():
def __init__(self, val):
self.parent = None
self.val = val
self.children = []
def add(self, child):... | output | 1 | 838 | 13 | 1,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 839 | 13 | 1,678 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
from collections import defaultdict
from collections import deque
import heapq
import sys
input = sys.stdin.readline
def get_root(s):
v = []
while not s == root[s]:
v.append(s)
s = root[s]
for i in v:
... | output | 1 | 839 | 13 | 1,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 840 | 13 | 1,680 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import sys
sys.setrecursionlimit(1100)
def dfs1(u,pre): #find the components
vis[u] = True
now.append(u)
for v in to[u]:
if v!=pre:dfs1(v,u)
def dfs2(u,pre): #calulate the distance
mxdist[... | output | 1 | 840 | 13 | 1,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 841 | 13 | 1,682 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import sys
def dfs(v, d, prev, i):
global mid
global M
M[v] = False
way[d] = v
if way[d + 1] == 0:
mid[i] = way[d // 2]
mx = (d, v)
for x in E[v]:
if x != prev:
mx = max(mx, dfs(... | output | 1 | 841 | 13 | 1,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the maximum number of edges in the shortest path be... | instruction | 0 | 842 | 13 | 1,684 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
from collections import defaultdict, deque
from math import ceil
n, m = map(int, input().split())
graph = defaultdict(list)
for i in range(m):
u, v = map(int, input().split())
graph[u].append(v)
graph[v].append(u)
vis = ... | output | 1 | 842 | 13 | 1,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the ... | instruction | 0 | 843 | 13 | 1,686 |
No | output | 1 | 843 | 13 | 1,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the ... | instruction | 0 | 844 | 13 | 1,688 |
No | output | 1 | 844 | 13 | 1,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the ... | instruction | 0 | 845 | 13 | 1,690 |
No | output | 1 | 845 | 13 | 1,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a forest — an undirected graph with n vertices such that each its connected component is a tree.
The diameter (aka "longest shortest path") of a connected undirected graph is the ... | instruction | 0 | 846 | 13 | 1,692 |
No | output | 1 | 846 | 13 | 1,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a directed graph with n vertices and m directed edges without self-loops or multiple edges.
Let's denote the k-coloring of a digraph as following: you color each edge in one of k colors. The k-coloring is good if and only if t... | instruction | 0 | 917 | 13 | 1,834 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
import sys
sys.setrecursionlimit(10**9)
def dfs(a):
global adj,vis,st
j=0
vis[a]=1
for i in adj[a][:]:
if vis[i[0]]==0:
dfs(i[0])
adj[a][j][1]=1
elif vis[i[0]]==2:
adj[a][j][1... | output | 1 | 917 | 13 | 1,835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.