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 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,232 | 13 | 92,464 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
from itertools import combinations
from sys import stdin
import math
def listIn():
return list((map(int,stdin.readline().strip().split())))
def stringIn():
return([x for x in stdin.readline().split()])
def intIn():
re... | output | 1 | 46,232 | 13 | 92,465 |
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,233 | 13 | 92,466 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
def solve():
n = int(input())
p = list(map(int, input().split(" "))) # 2...n
s = list(map(int, input().split(" "))) # 1...n
MAX_VAL = 10**9 + 2
v_child = [None] * n # 1...n
for i, p_i in enumera... | output | 1 | 46,233 | 13 | 92,467 |
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,234 | 13 | 92,468 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
def solution(n,p,v):
sv = v[:]
#print(sv)
for i in range(1, n):
if v[i] != -1: #still alive
par = p[i] - 1 #parent index
#updating
if sv[par] == -1:
sv[par] = v[i... | output | 1 | 46,234 | 13 | 92,469 |
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,235 | 13 | 92,470 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
from sys import stdin
input=lambda : stdin.readline().strip()
from math import ceil,sqrt,factorial,gcd
from collections import deque
n=int(input())
l=list(map(int,input().split()))
s=list(map(int,input().split()))
graph={i:set() for i i... | output | 1 | 46,235 | 13 | 92,471 |
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,236 | 13 | 92,472 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import sys
n=int(input())
p=list(map(int,input().split()))
s=list(map(int,input().split()))
children=[]
for i in range(n):
children.append([])
for i in range(n-1):
children[p[i]-1].append(i+1)
a=[-1]*n
a[0]=s[0]
for i in range(1,n):... | output | 1 | 46,236 | 13 | 92,473 |
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,237 | 13 | 92,474 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
import sys
import math,bisect
sys.setrecursionlimit(10 ** 6)
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,defaultdict
def I(): return int(sys.stdin.readline())... | output | 1 | 46,237 | 13 | 92,475 |
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,238 | 13 | 92,476 |
Tags: constructive algorithms, dfs and similar, greedy, trees
Correct Solution:
```
# -*- coding: utf-8 -*-
# @Time : 2019/1/6 1:37
# @Author : LunaFire
# @Email : gilgemesh2012@gmail.com
# @File : D. Sum in the tree.py
from collections import deque
def main():
n = int(input())
p = list(map(int, inp... | output | 1 | 46,238 | 13 | 92,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,239 | 13 | 92,478 |
Yes | output | 1 | 46,239 | 13 | 92,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,240 | 13 | 92,480 |
Yes | output | 1 | 46,240 | 13 | 92,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,241 | 13 | 92,482 |
Yes | output | 1 | 46,241 | 13 | 92,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,242 | 13 | 92,484 |
Yes | output | 1 | 46,242 | 13 | 92,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,243 | 13 | 92,486 |
No | output | 1 | 46,243 | 13 | 92,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,244 | 13 | 92,488 |
No | output | 1 | 46,244 | 13 | 92,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,245 | 13 | 92,490 |
No | output | 1 | 46,245 | 13 | 92,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
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 compute... | instruction | 0 | 46,246 | 13 | 92,492 |
No | output | 1 | 46,246 | 13 | 92,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A tree is an undirected connected graph without cycles. The distance between two vertices is the number of edges in a simple path between them.
Limak is a little polar bear. He lives in a tree that consists of n vertices, numbered 1 through... | instruction | 0 | 46,748 | 13 | 93,496 |
Tags: dfs and similar, dp, trees
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
from collections import deque
n, k = map(int, input().split())
tot_dist = 0
vis = [0]*(n+1)
dist = [[[0]*2 for j in range(k)] for i in range(n+1)]
adj = [[]for i in range(n+1)]
for i in range(n-1):
u,v = map(int,inp... | output | 1 | 46,748 | 13 | 93,497 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A tree is an undirected connected graph without cycles. The distance between two vertices is the number of edges in a simple path between them.
Limak is a little polar bear. He lives in a tree that consists of n vertices, numbered 1 through... | instruction | 0 | 46,749 | 13 | 93,498 |
Tags: dfs and similar, dp, trees
Correct Solution:
```
"""
#If FastIO not needed, used this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
from types import GeneratorType
BU... | output | 1 | 46,749 | 13 | 93,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di, which can be equal to 0, 1 or - 1. T... | instruction | 0 | 46,768 | 13 | 93,536 |
Tags: constructive algorithms, data structures, dfs and similar, dp, graphs
Correct Solution:
```
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import sys
import heapq
INF=10**9
def Dijkstra(graph, start,m):
dist=[INF]*len(graph)
parent=[INF]*len(graph)
queue=[(0, start)]
while queue:
... | output | 1 | 46,768 | 13 | 93,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an in... | instruction | 0 | 46,769 | 13 | 93,538 |
No | output | 1 | 46,769 | 13 | 93,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let the main characters of this problem be personages from some recent movie. New Avengers seem to make a lot of buzz. I didn't watch any part of the franchise and don't know its heroes well, bu... | instruction | 0 | 46,824 | 13 | 93,648 |
No | output | 1 | 46,824 | 13 | 93,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let the main characters of this problem be personages from some recent movie. New Avengers seem to make a lot of buzz. I didn't watch any part of the franchise and don't know its heroes well, bu... | instruction | 0 | 46,825 | 13 | 93,650 |
No | output | 1 | 46,825 | 13 | 93,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let the main characters of this problem be personages from some recent movie. New Avengers seem to make a lot of buzz. I didn't watch any part of the franchise and don't know its heroes well, bu... | instruction | 0 | 46,826 | 13 | 93,652 |
No | output | 1 | 46,826 | 13 | 93,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let the main characters of this problem be personages from some recent movie. New Avengers seem to make a lot of buzz. I didn't watch any part of the franchise and don't know its heroes well, bu... | instruction | 0 | 46,827 | 13 | 93,654 |
No | output | 1 | 46,827 | 13 | 93,655 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,004 | 13 | 94,008 |
"Correct Solution:
```
from sys import stdin
from collections import defaultdict
readline = stdin.readline
def main():
v, e = map(int, readline().split())
g = defaultdict(set)
residual = [[0] * v for _ in range(v)]
source, sink = 0, v - 1
for _ in range(e):
s, t, c = map(int, readline().s... | output | 1 | 47,004 | 13 | 94,009 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,005 | 13 | 94,010 |
"Correct Solution:
```
import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*s... | output | 1 | 47,005 | 13 | 94,011 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,006 | 13 | 94,012 |
"Correct Solution:
```
INF = 10**12
N = 101
class FordFulkerson:
def __init__(self):
self.G = [[] for _ in range(N)]
self.used = [False] * N
def add_edge(self, s, t, c):
self.G[s].append([t, c, len(self.G[t])])
self.G[t].append([s, 0, len(self.G[s])-1])
def dfs(self, s, t... | output | 1 | 47,006 | 13 | 94,013 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,007 | 13 | 94,014 |
"Correct Solution:
```
import sys,collections
sys.setrecursionlimit(10000)
INF = float("inf")
V,E = map(int,sys.stdin.readline().split())
uvc = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(E)) # multi line with multi param
#uvc = [[0,1,1],[0,2,3],[1,2,1],[2,3,2]]
G = {i:{} for i in range... | output | 1 | 47,007 | 13 | 94,015 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,008 | 13 | 94,016 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(200000)
n,e = map(int,input().split())
g = [[] for i in range(n)]
for i in range(e):
a,b,c = map(int,input().split())
g[a].append([b,c,len(g[b])])
g[b].append([a,0,len(g[a])-1])
def dfs(x,t,f):
if x == t:
return f
global used
used[x] = 1
for j in... | output | 1 | 47,008 | 13 | 94,017 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,009 | 13 | 94,018 |
"Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def bfs(source, target, parent):
queue = deque()
queue.appendleft(source)
visited = [False] * v_num
visited[source] = True
wh... | output | 1 | 47,009 | 13 | 94,019 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,010 | 13 | 94,020 |
"Correct Solution:
```
import collections
def bfs(u, n):
global level, network
level = [-1] * n
deq = collections.deque()
level[u] = 0
deq.append(u)
while deq:
v = deq.popleft()
for w, c, l in network[v]:
if c > 0 and level[w] < 0:
level[w] = level[v... | output | 1 | 47,010 | 13 | 94,021 |
Provide a correct Python 3 solution for this coding contest problem.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edge can not exceed the corresponding capacity. Find the ma... | instruction | 0 | 47,011 | 13 | 94,022 |
"Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def graph_bfs(source, target, parent):
visited = [False] * v_num
queue = deque()
queue.appendleft(source)
visited[source] = True
... | output | 1 | 47,011 | 13 | 94,023 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,012 | 13 | 94,024 |
Yes | output | 1 | 47,012 | 13 | 94,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,013 | 13 | 94,026 |
Yes | output | 1 | 47,013 | 13 | 94,027 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,014 | 13 | 94,028 |
Yes | output | 1 | 47,014 | 13 | 94,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,015 | 13 | 94,030 |
Yes | output | 1 | 47,015 | 13 | 94,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,016 | 13 | 94,032 |
No | output | 1 | 47,016 | 13 | 94,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,017 | 13 | 94,034 |
No | output | 1 | 47,017 | 13 | 94,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,018 | 13 | 94,036 |
No | output | 1 | 47,018 | 13 | 94,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A flow network is a directed graph which has a $source$ and a $sink$. In a flow network, each edge $(u, v)$ has a capacity $c(u, v)$. Each edge receives a flow, but the amount of flow on the edg... | instruction | 0 | 47,019 | 13 | 94,038 |
No | output | 1 | 47,019 | 13 | 94,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,189 | 13 | 94,378 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import sys, threading
from math import inf
input = sys.stdin.readline
def put():
return map(int, input().split())
def dfs(tree,i, sum, p):
if len(tree[i])==1 and i!=0:
return 1
cnt=0
for j,w,c in t... | output | 1 | 47,189 | 13 | 94,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,190 | 13 | 94,380 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
... | output | 1 | 47,190 | 13 | 94,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,191 | 13 | 94,382 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
... | output | 1 | 47,191 | 13 | 94,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,192 | 13 | 94,384 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
from collections import *
from sys import stdin, stdout
input = stdin.buffer.readline
print = stdout.write
# "". join(strings)
def ri():
return int(input())
def rl():
return list(map(int, input().split()... | output | 1 | 47,192 | 13 | 94,385 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,193 | 13 | 94,386 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
#!/usr/bin/env python3
import io
import os
import heapq
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
def get_str():
return input().decode().strip()
def rint():
return map(int, input().split())
def ... | output | 1 | 47,193 | 13 | 94,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,194 | 13 | 94,388 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections impo... | output | 1 | 47,194 | 13 | 94,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,195 | 13 | 94,390 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import sys,bisect
from collections import deque
input=sys.stdin.buffer.readline
t=1
t=int(input())
for _ in range(t):
n,S=map(int,input().split())
edge=[[] for i in range(n)]
for i in range(n-1):
u,v,... | output | 1 | 47,195 | 13 | 94,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost.
A tree is a connected gr... | instruction | 0 | 47,196 | 13 | 94,392 |
Tags: binary search, dfs and similar, greedy, sortings, trees, two pointers
Correct Solution:
```
import sys,bisect
from collections import deque
input=sys.stdin.buffer.readline
t=1
t=int(input())
for _ in range(t):
n,S=map(int,input().split())
edge=[[] for i in range(n)]
for i in range(n-1):
u,v,... | output | 1 | 47,196 | 13 | 94,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each e... | instruction | 0 | 47,197 | 13 | 94,394 |
Yes | output | 1 | 47,197 | 13 | 94,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each e... | instruction | 0 | 47,198 | 13 | 94,396 |
Yes | output | 1 | 47,198 | 13 | 94,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Easy and hard versions are actually different problems, so we advise you to read both statements carefully.
You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each e... | instruction | 0 | 47,199 | 13 | 94,398 |
Yes | output | 1 | 47,199 | 13 | 94,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.