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 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected tree of n vertices.
Some vertices are colored blue, some are colored red and some are uncolored. It is guaranteed that the tree contains at least one red vertex and... | instruction | 0 | 4,206 | 13 | 8,412 |
No | output | 1 | 4,206 | 13 | 8,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tree with n vertices numbered 1, …, n. A tree is a connected simple graph without cycles.
Let dist(u, v) be the number of edges in the unique simple path connecting vertices u a... | instruction | 0 | 4,415 | 13 | 8,830 |
No | output | 1 | 4,415 | 13 | 8,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kilani and Abd are neighbors for 3000 years, but then the day came and Kilani decided to move to another house. As a farewell gift, Kilani is going to challenge Abd with a problem written by the... | instruction | 0 | 4,416 | 13 | 8,832 |
No | output | 1 | 4,416 | 13 | 8,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kilani and Abd are neighbors for 3000 years, but then the day came and Kilani decided to move to another house. As a farewell gift, Kilani is going to challenge Abd with a problem written by the... | instruction | 0 | 4,417 | 13 | 8,834 |
No | output | 1 | 4,417 | 13 | 8,835 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kilani and Abd are neighbors for 3000 years, but then the day came and Kilani decided to move to another house. As a farewell gift, Kilani is going to challenge Abd with a problem written by the... | instruction | 0 | 4,418 | 13 | 8,836 |
No | output | 1 | 4,418 | 13 | 8,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kilani and Abd are neighbors for 3000 years, but then the day came and Kilani decided to move to another house. As a farewell gift, Kilani is going to challenge Abd with a problem written by the... | instruction | 0 | 4,419 | 13 | 8,838 |
No | output | 1 | 4,419 | 13 | 8,839 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,556 | 13 | 9,112 |
Tags: greedy, math
Correct Solution:
```
# HEY STALKER
n, m = map(int, input().split())
l = list(map(int, input().split()))
ans = 0
for t in range(m):
x, y, c = map(int, input().split())
ans = max(ans, (l[x-1] + l[y-1]) / c)
print(ans)
``` | output | 1 | 4,556 | 13 | 9,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,557 | 13 | 9,114 |
Tags: greedy, math
Correct Solution:
```
import math
def solve():
n, m = [int(i) for i in input().split()]
vw = [int(i) for i in input().split()]
M = 0.0
for _ in range(m):
a, b, c = [int(i) for i in input().split()]
M = max(M, (vw[a - 1] + vw[b - 1]) / c)
print(M)
if __name__ == '__main__':
solve... | output | 1 | 4,557 | 13 | 9,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,558 | 13 | 9,116 |
Tags: greedy, math
Correct Solution:
```
v, e = map(int, input().split())
vertex = list(map(int, input().split()))
ret = 0.0
for i in range(e):
a, b, c = map(int, input().split())
a -= 1;
b -= 1;
ret = max(ret, (vertex[a] + vertex[b]) / c)
print(ret)
``` | output | 1 | 4,558 | 13 | 9,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,559 | 13 | 9,118 |
Tags: greedy, math
Correct Solution:
```
n,m = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
for i in range(m):
ax,bx,x = map(int,input().split())
ans = max(ans,(a[ax-1]+a[bx-1])/x)
print(ans)
``` | output | 1 | 4,559 | 13 | 9,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,560 | 13 | 9,120 |
Tags: greedy, math
Correct Solution:
```
n,m=map(int,input().split());a=list(map(int,input().split()));o=0.0
for i in range(m):
x,y,c=map(int,input().split());o=max(o,(a[x-1]+a[y-1])/c)
print(o)
# Made By Mostafa_Khaled
``` | output | 1 | 4,560 | 13 | 9,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,561 | 13 | 9,122 |
Tags: greedy, math
Correct Solution:
```
nodes , edges = map(int,input().split())
x=list(map(int,input().split()))
error =0
for i in range(edges):
a,b,c=map(int,input().split())
error = max(error , (x[a-1]+x[b-1])/c)
print(error)
``` | output | 1 | 4,561 | 13 | 9,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,562 | 13 | 9,124 |
Tags: greedy, math
Correct Solution:
```
import sys
def input(): return sys.stdin.readline().strip()
n, m = map(int, input().split())
x = [int(i) for i in input().split()]
edge = []
val = 0
for i in range(m):
a, b, c = map(int, input().split())
val = max((x[a-1]+x[b-1])/c, val)
print(val)
``` | output | 1 | 4,562 | 13 | 9,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,563 | 13 | 9,126 |
Tags: greedy, math
Correct Solution:
```
n, m = map(int, input().split())
t, v = 0, [0] + list(map(int, input().split()))
for i in range(m):
x, y, d = map(int, input().split())
t = max(t, (v[x] + v[y]) / d)
print(t)
``` | output | 1 | 4,563 | 13 | 9,127 |
Provide tags and a correct Python 2 solution for this coding contest problem.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) as follows:
<image> where v is the sum of the... | instruction | 0 | 4,564 | 13 | 9,128 |
Tags: greedy, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(int,raw_input().split())
def pr_n... | output | 1 | 4,564 | 13 | 9,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,565 | 13 | 9,130 |
Yes | output | 1 | 4,565 | 13 | 9,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,566 | 13 | 9,132 |
Yes | output | 1 | 4,566 | 13 | 9,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,567 | 13 | 9,134 |
Yes | output | 1 | 4,567 | 13 | 9,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,568 | 13 | 9,136 |
Yes | output | 1 | 4,568 | 13 | 9,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,569 | 13 | 9,138 |
No | output | 1 | 4,569 | 13 | 9,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,570 | 13 | 9,140 |
No | output | 1 | 4,570 | 13 | 9,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 4,571 | 13 | 9,142 |
No | output | 1 | 4,571 | 13 | 9,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You need to find a binary tree of size n that satisfies a given set of c constraints. Suppose that the nodes of the unknown binary tree are labeled using a pre-order traversal starting with 1. F... | instruction | 0 | 4,596 | 13 | 9,192 |
No | output | 1 | 4,596 | 13 | 9,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You need to find a binary tree of size n that satisfies a given set of c constraints. Suppose that the nodes of the unknown binary tree are labeled using a pre-order traversal starting with 1. F... | instruction | 0 | 4,597 | 13 | 9,194 |
No | output | 1 | 4,597 | 13 | 9,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,731 | 13 | 9,462 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
n = int(input())
edges = [[] for i in range(n)]
for i in range(n-1):
u, v = map(int, input().split())
edges[u-1].append(v-1)
edges[v-1].append(u-1)
colors = [-1 for i in range(n)]
dfs = [(0,0)]
while len(dfs) > 0:
node, color = dfs.pop()
co... | output | 1 | 4,731 | 13 | 9,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,732 | 13 | 9,464 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
from col... | output | 1 | 4,732 | 13 | 9,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,733 | 13 | 9,466 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
import sys
from sys import stdin,stdout
import bisect
import math
mod=10**9 +7
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
re... | output | 1 | 4,733 | 13 | 9,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,734 | 13 | 9,468 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
"""http://codeforces.com/problemset/problem/862/B"""
n = int(input())
edges = dict()
for i in range(n-1):
[v1,v2] = list(map(int,input().split()))
edges.setdefault(v1,[])
edges[v1].append(v2)
edges.setdefault(v2,[])
edges[v2].append(v1)
vis... | output | 1 | 4,734 | 13 | 9,469 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,735 | 13 | 9,470 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
from collections import defaultdict
from queue import Queue as Q
n = int(input())
e = defaultdict(list)
for i in range(n-1):
x, y = tuple(map(int, input().split()))
e[x].append(y)
e[y].append(x)
def bfs(v):
mark = defaultdict(int)
q = Q()
q.put... | output | 1 | 4,735 | 13 | 9,471 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,736 | 13 | 9,472 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
n = int(input())
adj = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
adj[a - 1].append(b - 1)
adj[b - 1].append(a - 1)
visited = [0] * n
value = [-1] * n
q = [0]
value[0] = 0
while q:
x = q.pop(0)
for u in ad... | output | 1 | 4,736 | 13 | 9,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,737 | 13 | 9,474 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
n = int(input())
e = {}
for i in range(n-1):
a, b = map(int, input().split(' '))
x = e.get(a, [])
x.append(b)
e[a] = x
x = e.get(b, [])
x.append(a)
e[b] = x
c = set()
d = set()
c.add(1)
temp = [1]
seen = set()
while len(temp)... | output | 1 | 4,737 | 13 | 9,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a graph, whose vertices can be partitioned into 2 ... | instruction | 0 | 4,738 | 13 | 9,476 |
Tags: dfs and similar, graphs, trees
Correct Solution:
```
n=int(input())
a=[[]for i in range(n)]
for i in range(n-1):
f,s=map(int,input().split())
a[s-1].append(f)
a[f-1].append(s)
q=[1]
fl=[1]+[0]*n
while len(q)!=0:
x=q.pop()
for i in a[x-1]:
if fl[i-1]==0:
q.append(i)
... | output | 1 | 4,738 | 13 | 9,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,739 | 13 | 9,478 |
Yes | output | 1 | 4,739 | 13 | 9,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,740 | 13 | 9,480 |
Yes | output | 1 | 4,740 | 13 | 9,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,741 | 13 | 9,482 |
Yes | output | 1 | 4,741 | 13 | 9,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,742 | 13 | 9,484 |
Yes | output | 1 | 4,742 | 13 | 9,485 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,743 | 13 | 9,486 |
No | output | 1 | 4,743 | 13 | 9,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,744 | 13 | 9,488 |
No | output | 1 | 4,744 | 13 | 9,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,745 | 13 | 9,490 |
No | output | 1 | 4,745 | 13 | 9,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.
A tree is a connected acyclic graph. A bipartite graph is a g... | instruction | 0 | 4,746 | 13 | 9,492 |
No | output | 1 | 4,746 | 13 | 9,493 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 4,997 | 13 | 9,994 |
"Correct Solution:
```
from collections import deque
class LowestCommonAncestor():
"""根付き木に対して、二頂点の共通の祖先で最も近いところにある頂点を求める
初期化(ダブリング配列parent[k][v]の構築): O(NlogN)
lcaを求めるクエリ: O(logN)
"""
def __init__(self, tree, root):
self.n = len(tree)
self.depth = [0] * self.n
self.log... | output | 1 | 4,997 | 13 | 9,995 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 4,998 | 13 | 9,996 |
"Correct Solution:
```
from collections import deque
import sys
input = sys.stdin.readline
def bfs():
depth[0] = 0
queue = deque([])
queue.append(0)
while queue:
current_node = queue.popleft()
for next_node in adj_list[current_node]:
if depth[next_node] == -1:
... | output | 1 | 4,998 | 13 | 9,997 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 4,999 | 13 | 9,998 |
"Correct Solution:
```
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
n = NI()
m = n.bit_length()+1
root = [[-1] * n for _ in range(m)]
rev = [0] * n
depth = [0] ... | output | 1 | 4,999 | 13 | 9,999 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 5,000 | 13 | 10,000 |
"Correct Solution:
```
class Edge:
def __init__(self, dst, weight):
self.dst, self.weight = dst, weight
def __lt__(self, e):
return self.weight > e.weight
class Graph:
def __init__(self, V):
self.V = V
self.E = [[] for _ in range(V)]
def add_edge(self, src, dst, weigh... | output | 1 | 5,000 | 13 | 10,001 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 5,001 | 13 | 10,002 |
"Correct Solution:
```
import math
def lca(x, y):
if d[x] < d[y]:
x,y = y,x
dy = d[y]
k = d[x]-dy#abs(depth)
#Align depth
while k:
x = p[x][int(math.log(k,2))]
k = d[x]-dy
if x == y:
return x
for i in range(h)[::-1]:
#print(h)
if p[x][i] != ... | output | 1 | 5,001 | 13 | 10,003 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 5,002 | 13 | 10,004 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 2**60
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Doubling():
... | output | 1 | 5,002 | 13 | 10,005 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 5,003 | 13 | 10,006 |
"Correct Solution:
```
class Lca:
def __init__(self, E, root):
import sys
sys.setrecursionlimit(500000)
self.root = root
self.E = E # V<V>
self.n = len(E) # 頂点数
self.logn = 1 # n < 1<<logn ぴったりはだめ
while self.n >= (1<<self.logn):
self.logn += 1
... | output | 1 | 5,003 | 13 | 10,007 |
Provide a correct Python 3 solution for this coding contest problem.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤ n ≤ 100000
* 1 ≤ q ≤ 100000
Input
n
k0 c1 c2 ... ck0... | instruction | 0 | 5,004 | 13 | 10,008 |
"Correct Solution:
```
from math import log2
class LCA:
N = 0
depth = []
table = []
def init(N, par):
LCA.N = N
LCA.depth = [-1] * (N+1)
max_depth = 0
# set depth
for i in range(1, N+1):
if LCA.depth[i] != -1: continue
... | output | 1 | 5,004 | 13 | 10,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤... | instruction | 0 | 5,005 | 13 | 10,010 |
Yes | output | 1 | 5,005 | 13 | 10,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a rooted tree, find the lowest common ancestor of two nodes u and v.
The given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.
Constraints
* 1 ≤... | instruction | 0 | 5,006 | 13 | 10,012 |
Yes | output | 1 | 5,006 | 13 | 10,013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.