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.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,850 | 13 | 141,700 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
class BIT():
def __init__(self, n):
self.n = n
self.tree = [0] * n
def _F(self, i):
return i & (i + 1)
def _getSum(self, r):
result = 0
while r >= 0:
result += self.tree... | output | 1 | 70,850 | 13 | 141,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,851 | 13 | 141,702 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
from heapq import heapify, heappush, heappop
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i i... | output | 1 | 70,851 | 13 | 141,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,852 | 13 | 141,704 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
input = sys.stdin.readline
def main():
N = int(input())
LR = [list(map(int, input().split())) for _ in range(N)]
A = [None]*(2*N+1)
for i, (l, r) in enumerate(LR):
A[l] = i
A[r] = i
graph = [[] for _ in ra... | output | 1 | 70,852 | 13 | 141,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,853 | 13 | 141,706 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
class segmTree():
def __init__(self, size=None, array=None):
if array is not None:
size = len(array)
N = 1
while N < size:
N <<= 1
self.N = N
self.tree = [0] * (2*self.N)
... | output | 1 | 70,853 | 13 | 141,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,854 | 13 | 141,708 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
class segmTree():
def __init__(self, size=None, array=None):
if array is not None:
size = len(array)
N = 1
while N < size:
N <<= 1
self.N = N
self.tree = [0] * (2*self.N)
... | output | 1 | 70,854 | 13 | 141,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,855 | 13 | 141,710 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
class BIT_RSQ():
def __init__(self, n):
self.n = n
self.data = [0]*(n+2)
def add(self, i, v):
while i <= self.n:
self.data[i] += v
... | output | 1 | 70,855 | 13 | 141,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,856 | 13 | 141,712 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
class segmTree():
def __init__(self, size=None, array=None):
if array is not None:
size = len(array)
N = 1
while N < size:
N <<= 1
self.N = N
self.tree = [0] * (2*self.N)
... | output | 1 | 70,856 | 13 | 141,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between every pair of its vertices.
You are given n segme... | instruction | 0 | 70,857 | 13 | 141,714 |
Tags: data structures, dsu, graphs, trees
Correct Solution:
```
import sys
from array import array # noqa: F401
from typing import Dict, List, Tuple, TypeVar, Generic, Sequence, Union # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
class UnionFind(object):
__slots__ = ['nodes'... | output | 1 | 70,857 | 13 | 141,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between eve... | instruction | 0 | 70,858 | 13 | 141,716 |
No | output | 1 | 70,858 | 13 | 141,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between eve... | instruction | 0 | 70,859 | 13 | 141,718 |
No | output | 1 | 70,859 | 13 | 141,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between eve... | instruction | 0 | 70,860 | 13 | 141,720 |
No | output | 1 | 70,860 | 13 | 141,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As the name of the task implies, you are asked to do some work with segments and trees.
Recall that a tree is a connected undirected graph such that there is exactly one simple path between eve... | instruction | 0 | 70,861 | 13 | 141,722 |
No | output | 1 | 70,861 | 13 | 141,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,264 | 13 | 142,528 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, 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
imp... | output | 1 | 71,264 | 13 | 142,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,265 | 13 | 142,530 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
def main():
n = int(input())
graph = [[] for i in range(n)]
ans = [(0,0)] * n
for _ in range(n - 1):
u, v = [int(el) for el in input().split()]
u -= 1
v -= 1
graph[u].append(v)
graph[v].append(u)
for l in grap... | output | 1 | 71,265 | 13 | 142,531 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,266 | 13 | 142,532 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
#!/usr/bin/env python3
from collections import *
def ri():
return map(int, input().split())
d = [[1,0], [0, 1], [-1, 0], [0, -1]]
def bfs(s, adj, v, l):
if v[s] == 1:
return 0
q = deque()
q.append(s)
... | output | 1 | 71,266 | 13 | 142,533 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,267 | 13 | 142,534 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
n = int(input())
p = [set() for i in range(n)]
for k in range(n - 1):
u, v = map(int, input().split())
p[u - 1].add(v - 1)
p[v - 1].add(u - 1)
s = [(0, 0)] * n
t = [(0, 1 << 30, 7)]
l = [1, 0, -1, 0, 1]
while t:
... | output | 1 | 71,267 | 13 | 142,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,268 | 13 | 142,536 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
def dfs(v, x, y, t, l, pr):
ans[v] = x, y
nx = [(l, 0), (0, -l), (-l, 0), (0, l)]
if t == 0: p = 0, 1, 3
if t == 1: p = 0, 1, 2
if t == 2: p = 1, 2, 3
if t == 3: p = 0, 2, 3
listv = [u for u in g[v] i... | output | 1 | 71,268 | 13 | 142,537 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,269 | 13 | 142,538 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
n = int(input())
adj = [[] for _ in range(n)]
for _ in range(n - 1):
u, v = map(int, input().split())
adj[u - 1].append(v - 1)
adj[v - 1].append(u - 1)
from collections import deque
def bfs(v):
vis = [i == v fo... | output | 1 | 71,269 | 13 | 142,539 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,270 | 13 | 142,540 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
from collections import deque
n = int(input())
dx = [-1, 0, 1, 0]
dy = [0, -1, 0, 1]
gr = [[] for i in range(n)]
for i in range(n - 1):
a, b = [int(i) for i in input().split()]
a -= 1
b -= 1
gr[a].append(b)
... | output | 1 | 71,270 | 13 | 142,541 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a non-oriented connected graph without cycles. I... | instruction | 0 | 71,271 | 13 | 142,542 |
Tags: constructive algorithms, dfs and similar, graphs, greedy, trees
Correct Solution:
```
def dfs(v, x, y, t, l, pr):
ans[v] = x, y
p = [(0, 1, 3), (0, 1, 2), (1, 2, 3), (0, 2, 3)][t]
g[v] = [u for u in g[v] if u != pr]
for i in range(min(len(p), len(g[v]))):
newx = x + nx[p[i]][0] * l
... | output | 1 | 71,271 | 13 | 142,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a... | instruction | 0 | 71,272 | 13 | 142,544 |
Yes | output | 1 | 71,272 | 13 | 142,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a... | instruction | 0 | 71,273 | 13 | 142,546 |
No | output | 1 | 71,273 | 13 | 142,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a... | instruction | 0 | 71,274 | 13 | 142,548 |
No | output | 1 | 71,274 | 13 | 142,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a... | instruction | 0 | 71,275 | 13 | 142,550 |
No | output | 1 | 71,275 | 13 | 142,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dasha decided to have a rest after solving the problem. She had been ready to start her favourite activity — origami, but remembered the puzzle that she could not solve.
<image>
The tree is a... | instruction | 0 | 71,276 | 13 | 142,552 |
No | output | 1 | 71,276 | 13 | 142,553 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,455 | 13 | 142,910 |
"Correct Solution:
```
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.st... | output | 1 | 71,455 | 13 | 142,911 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,456 | 13 | 142,912 |
"Correct Solution:
```
n = int(input())
ab = [list(map(int,input().split())) for i in range(n-1)]
graph = [[] for i in range(n+1)]
for a,b in ab:
graph[a].append(b)
graph[b].append(a)
ansls = []
for i in range(1,n+1):
root = i
stack = [i]
dist = [-1 for i in range(n+1)]
dist[root] = 0
while stack:
x =... | output | 1 | 71,456 | 13 | 142,913 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,457 | 13 | 142,914 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(pow(10, 6))
from collections import deque
edges = []
def solve(u, v=-1):
global edges
que = deque([u])
if v != -1:
que.append(v)
used = set([u, v])
D = {u: 0, v: 0}
E = {}
if v != -1:
E[0] = max(len(edges[v]), le... | output | 1 | 71,457 | 13 | 142,915 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,458 | 13 | 142,916 |
"Correct Solution:
```
from collections import deque
N = int(input())
ab = []
dic = {}
for i in range(N-1):
a,b = map(int,input().split())
a -= 1
b -= 1
ab.append([a,b])
if a not in dic:
dic[a] = []
if b not in dic:
dic[b] = []
dic[a].append(b)
dic[b].append(a)
ans... | output | 1 | 71,458 | 13 | 142,917 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,459 | 13 | 142,918 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
"""
・中心が同型不変であることを利用して考える。
・カラフル度はだいたい直径の半分。
・中心が頂点になる場合は、中心を隣接する辺に持ってこれる。Nが小さいので全部計算してもよい
・そもそもすべての辺、頂点に対して、そこを中心とする場合の(色数、葉数)を計算してもよい
"""
N,*AB = ... | output | 1 | 71,459 | 13 | 142,919 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,460 | 13 | 142,920 |
"Correct Solution:
```
import sys
N=int(input())
edge=[[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
ans=(10**15,10**15)
root=-1
depth=[0]*N
Mdata=[0]*100
def dfs(v,pv):
for nv in edge[v]:
if nv!=pv:
depth[nv]=... | output | 1 | 71,460 | 13 | 142,921 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,461 | 13 | 142,922 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N=int(input())
E=[tuple(map(int,input().split())) for i in range(N-1)]
ELIST=[[] for i in range(N+1)]
EDEG=[0]*(N+1)
for x,y in E:
ELIST[x].append(y)
ELIST[y].append(x)
EDEG[x]+=1
EDEG[y]+=1
from collections import deque
Q=deque()
Q.appen... | output | 1 | 71,461 | 13 | 142,923 |
Provide a correct Python 3 solution for this coding contest problem.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would result in isomorphic rooted trees.
Also, the colorfulness of... | instruction | 0 | 71,462 | 13 | 142,924 |
"Correct Solution:
```
n = int(input())
sus = [[] for i in range(n)]
edges = []
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
sus[a].append(b)
sus[b].append(a)
edges.append((a, b))
def probaj(korijen):
bio = [False for i in range(n)]
maks = [0 for i in range(n)]
... | output | 1 | 71,462 | 13 | 142,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,463 | 13 | 142,926 |
Yes | output | 1 | 71,463 | 13 | 142,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,464 | 13 | 142,928 |
Yes | output | 1 | 71,464 | 13 | 142,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,465 | 13 | 142,930 |
Yes | output | 1 | 71,465 | 13 | 142,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,466 | 13 | 142,932 |
Yes | output | 1 | 71,466 | 13 | 142,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,467 | 13 | 142,934 |
No | output | 1 | 71,467 | 13 | 142,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,468 | 13 | 142,936 |
No | output | 1 | 71,468 | 13 | 142,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,469 | 13 | 142,938 |
No | output | 1 | 71,469 | 13 | 142,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Coloring of the vertices of a tree G is called a good coloring when, for every pair of two vertices u and v painted in the same color, picking u as the root and picking v as the root would resul... | instruction | 0 | 71,470 | 13 | 142,940 |
No | output | 1 | 71,470 | 13 | 142,941 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,471 | 13 | 142,942 |
"Correct Solution:
```
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,op... | output | 1 | 71,471 | 13 | 142,943 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,472 | 13 | 142,944 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
class UnionFind(object):
def __init__(self, N):
self.parent = [-1] * N #parent[i] は(i+1)番目の要素が含まれる要素数の(-1)倍
#要素が負-->その数を親とするグループに属する要素の数×(-1)
#要素が正-->親のindex
#Aがどのグループに属しているかを調べる
d... | output | 1 | 71,472 | 13 | 142,945 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,473 | 13 | 142,946 |
"Correct Solution:
```
n,m=map(int,input().split())
a=[i for i in range(n+1)]
b=[0]*(n+1)
def f(x):
if a[x]==x:
return x
x=a[x]
return(f(x))
def s(x,y):
x=f(x)
y=f(y)
if x!=y:
if b[x]<b[y]:
a[x]=y
b[y]+=1
else:
a[y]=x
b[x]+=... | output | 1 | 71,473 | 13 | 142,947 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,474 | 13 | 142,948 |
"Correct Solution:
```
class UnionFindTree():
def __init__(self, N):
self.N = N
self.__parent_of = [None] * N
self.__rank_of = [0] * N
self.__size = [1] * N
def root(self, value):
if self.__parent_of[value] is None:
return value
else:
self... | output | 1 | 71,474 | 13 | 142,949 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,475 | 13 | 142,950 |
"Correct Solution:
```
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,op... | output | 1 | 71,475 | 13 | 142,951 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,476 | 13 | 142,952 |
"Correct Solution:
```
def root(x):
while p[x]>=0:x=p[x]
return x
def unite(a,b):
a,b=root(a),root(b)
if a!=b:
if p[a]>p[b]:a,b=b,a
p[a]+=p[b]
p[b]=a
n,m,*t=map(int,open(0).read().split())
p=[-1]*n
c=[0]*n
for a,b in zip(*[iter(t)]*2):
a-=1
b-=1
unite(a,b)
c[a]+=1
c[b]+=1
a=root(0),root(1)... | output | 1 | 71,476 | 13 | 142,953 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,477 | 13 | 142,954 |
"Correct Solution:
```
def examA():
bit = 41
N, K = LI()
A = LI()
B = [0]*bit
for a in A:
for j in range(bit):
if a&(1<<j)>0:
B[j] += 1
ans = 0
cnt = 0
for i in range(bit)[::-1]:
if N-B[i]<=B[i]:
ans += (1 << i) * B[i]
else:... | output | 1 | 71,477 | 13 | 142,955 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an undirected graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loops and multiple edges.
You can repeatedly perform the o... | instruction | 0 | 71,478 | 13 | 142,956 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
N,M=map(int,input().split())
P=[i for i in range(N+1)]
size=[1 for i in range(N+1)]
def find(a):
if a==P[a]:
return a
else:
return find(P[a])
def union(b,c):
B=find(b)
C=find(c)
if P[B]<P[C]:
P[C]=P[B]
e... | output | 1 | 71,478 | 13 | 142,957 |
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 graph G. G has N vertices and M edges. The vertices are numbered from 1 through N, and the i-th edge (1 ≤ i ≤ M) connects Vertex a_i and b_i. G does not have self-loo... | instruction | 0 | 71,479 | 13 | 142,958 |
Yes | output | 1 | 71,479 | 13 | 142,959 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.