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.
In this problem you have to build tournament graph, consisting of n vertices, such, that for any oriented pair of vertices (v, u) (v ≠ u) there exists a path from vertex v to vertex u consisting... | instruction | 0 | 16,292 | 13 | 32,584 |
No | output | 1 | 16,292 | 13 | 32,585 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,679 | 13 | 33,358 |
"Correct Solution:
```
import sys
imput = sys.stdin.readline
N,M = map(int,input().split())
V = [0 for _ in range(N)]
for _ in range(M):
a,b = map(int,input().split())
V[a-1] += 1
V[b-1] += 1
print('YES' if all([v%2==0 for v in V]) else 'NO')
``` | output | 1 | 16,679 | 13 | 33,359 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,680 | 13 | 33,360 |
"Correct Solution:
```
n, m = map(int, input().split())
cnt = [0 for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
cnt[a] = (cnt[a] + 1) % 2
cnt[b] = (cnt[b] + 1) % 2
if 1 in cnt:
print("NO")
else:
print("YES")
``` | output | 1 | 16,680 | 13 | 33,361 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,681 | 13 | 33,362 |
"Correct Solution:
```
n,m = map(int,input().split())
s = [0]*(n)
for i in range(m):
a,b = map(int,input().split())
s[a-1] += 1
s[b-1] += 1
for i in s:
if i%2 != 0:
print("NO")
exit()
print("YES")
``` | output | 1 | 16,681 | 13 | 33,363 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,682 | 13 | 33,364 |
"Correct Solution:
```
# 2019/10/05
n,m=map(int,input().split())
res=[0]*n
for _ in range(m):
a,b=(map(int,input().split()))
res[a-1]+=1
res[b-1]+=1
for e in res:
if e%2:
print('NO')
exit()
else:
print('YES')
``` | output | 1 | 16,682 | 13 | 33,365 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,683 | 13 | 33,366 |
"Correct Solution:
```
N,M = map(int,input().split())
V = [0]*(N+1)
for i in range(M):
a,b = map(int,input().split())
V[a] +=1
V[b] +=1
bool = True
for i in range(N+1):
if V[i] % 2 ==1:
bool = False
break
if bool:
print("YES")
else:
print("NO")
``` | output | 1 | 16,683 | 13 | 33,367 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,684 | 13 | 33,368 |
"Correct Solution:
```
n,m=map(int,input().split())
l=[0]*n
for i in range(m):
a,b=map(int,input().split())
l[a-1]+=1
l[b-1]+=1
k=0
while k<n:
if l[k]%2==0:
k+=1
continue
else:
print("NO")
exit()
print("YES")
``` | output | 1 | 16,684 | 13 | 33,369 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,685 | 13 | 33,370 |
"Correct Solution:
```
n,m=map(int,input().split())
l=[0 for _ in range(n)]
for i in range(m):
for j in map(int,input().split()):
l[j-1]+=1
c=0
for i in range(n):
if l[i]%2==1:
c+=1
break
if c==0:
print("YES")
else:
print("NO")
``` | output | 1 | 16,685 | 13 | 33,371 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.
Then, Aoki gave him M queries. The i-th of them... | instruction | 0 | 16,686 | 13 | 33,372 |
"Correct Solution:
```
n,m=map(int,input().split())
d=[0]*(n+1)
for i in range(m):
a,b=map(int,input().split())
d[a]=(d[a]+1)%2
d[b]=(d[b]+1)%2
print("NO" if any(d) else "YES")
``` | output | 1 | 16,686 | 13 | 33,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,687 | 13 | 33,374 |
Yes | output | 1 | 16,687 | 13 | 33,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,688 | 13 | 33,376 |
Yes | output | 1 | 16,688 | 13 | 33,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,689 | 13 | 33,378 |
Yes | output | 1 | 16,689 | 13 | 33,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,690 | 13 | 33,380 |
Yes | output | 1 | 16,690 | 13 | 33,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,691 | 13 | 33,382 |
No | output | 1 | 16,691 | 13 | 33,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,692 | 13 | 33,384 |
No | output | 1 | 16,692 | 13 | 33,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,693 | 13 | 33,386 |
No | output | 1 | 16,693 | 13 | 33,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.
First, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at eac... | instruction | 0 | 16,694 | 13 | 33,388 |
No | output | 1 | 16,694 | 13 | 33,389 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,796 | 13 | 33,592 |
"Correct Solution:
```
import heapq
def prim_heap():
used = [True] * n #True:不使用
edgelist = []
for e in edge[0]:
heapq.heappush(edgelist,e)
used[0] = False
res = 0
while len(edgelist) != 0:
minedge = heapq.heappop(edgelist)
if not used[minedge[1]]:
continue
... | output | 1 | 16,796 | 13 | 33,593 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,797 | 13 | 33,594 |
"Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
6 9
0 1 1
0 2 3
1 2 1
1 3 7
2 4 1
1 4 3
3 4 1
3 5 1
4 5 6
output:
5
"""
import sys
import heapq as hp
WHITE, GRAY, BLACK = 0, 1, 2
def generate_adj_table(v_table):
for each in v_table:
v_from, v_to, edge_weight = map(int, ... | output | 1 | 16,797 | 13 | 33,595 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,798 | 13 | 33,596 |
"Correct Solution:
```
v, e = map(int, input().split())
p = [i for i in range(v)]
E = [list(map(int, input().split())) for _ in range(e)]
E = sorted(E, key=lambda x: x[2])
def root(x):
if p[x]==x:
return x
p[x] = root(p[x])
return p[x]
ans = 0
for edg in E:
a, b, w = edg
if root(a)!=root(b):
... | output | 1 | 16,798 | 13 | 33,597 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,799 | 13 | 33,598 |
"Correct Solution:
```
import sys
from heapq import heappush, heappop, heapify
V, E = map(int, sys.stdin.readline().strip().split())
graph = [[] for _ in range(V)]
for _ in range(E):
s, t, w = map(int, sys.stdin.readline().strip().split())
graph[s].append((w, t))
graph[t].append((w, s))
used = set()
q = []
for i... | output | 1 | 16,799 | 13 | 33,599 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,800 | 13 | 33,600 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
from operator import itemgetter
import sys
sys.setrecursionlimit(10000)
def inpl(): return tuple(map(int, input().split()))
V, E = inpl()
edges = []
graph = [[] for _ in range(V)] # [target, cost]
total_cost = 0
for _ in range(E):
edges.append(inpl())
gw = itemge... | output | 1 | 16,800 | 13 | 33,601 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,801 | 13 | 33,602 |
"Correct Solution:
```
from heapq import heappush, heappop
line = input()
v, e = list(map(int, line.split()))
edge = {}
edge[0] = [[0, 0]]
for _ in range(0, e):
line = input()
s, t, w = list(map(int, line.split()))
if s not in edge:
edge[s] = [[t, w]]
else:
edge[s] += [[t, w]]
if t... | output | 1 | 16,801 | 13 | 33,603 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,802 | 13 | 33,604 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
from operator import itemgetter
class UnionFind:
__slots__ = ['p', 'rank']
def __init__(self, n):
self.p = list(range(n))
self.rank = [0] * n
def find_root(self, x):
if x != self.p[x]:
self.p[x] = self.find_r... | output | 1 | 16,802 | 13 | 33,605 |
Provide a correct Python 3 solution for this coding contest problem.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph is connected
* There are no parallel edges
* There are ... | instruction | 0 | 16,803 | 13 | 33,606 |
"Correct Solution:
```
import sys
def kruskal(v_count: int, edges: list) -> int:
tree = [-1]*v_count
def get_root(x):
if tree[x] < 0:
return x
tree[x] = get_root(tree[x])
return tree[x]
def unite(x, y):
x, y = get_root(x), get_root(y)
if x != y:
... | output | 1 | 16,803 | 13 | 33,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,804 | 13 | 33,608 |
Yes | output | 1 | 16,804 | 13 | 33,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,805 | 13 | 33,610 |
Yes | output | 1 | 16,805 | 13 | 33,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,806 | 13 | 33,612 |
Yes | output | 1 | 16,806 | 13 | 33,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,807 | 13 | 33,614 |
Yes | output | 1 | 16,807 | 13 | 33,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,808 | 13 | 33,616 |
No | output | 1 | 16,808 | 13 | 33,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,809 | 13 | 33,618 |
No | output | 1 | 16,809 | 13 | 33,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,810 | 13 | 33,620 |
No | output | 1 | 16,810 | 13 | 33,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Find the sum of weights of edges of the Minimum Spanning Tree for a given weighted undirected graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 10,000
* 0 ≤ |E| ≤ 100,000
* 0 ≤ wi ≤ 10,000
* The graph... | instruction | 0 | 16,811 | 13 | 33,622 |
No | output | 1 | 16,811 | 13 | 33,623 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,948 | 13 | 33,896 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
e = [tuple(map(int, input().split())) for _ in range(m)]
g = [[] for _ in range(n + 1)]
for u, v in e:
g[u].append(v)
g[v].append(u)
req = 1
while req * r... | output | 1 | 16,948 | 13 | 33,897 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,949 | 13 | 33,898 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
from collections import *
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return... | output | 1 | 16,949 | 13 | 33,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,950 | 13 | 33,900 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m = map(int, input().split())
e = [tuple(map(int, input().split())) for _ in range(m)]
g = [[] for _ in range(n + 1)]
for u, v in e:
g[u].append(v)
g[v].append(u)
req = 1
while req * req < n... | output | 1 | 16,950 | 13 | 33,901 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,951 | 13 | 33,902 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
from collections import *
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return... | output | 1 | 16,951 | 13 | 33,903 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,952 | 13 | 33,904 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
from collections import *
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return... | output | 1 | 16,952 | 13 | 33,905 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,953 | 13 | 33,906 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
from math import sqrt
n,m=map(int,input().split())
k=int(-(-sqrt(n)//1))
E=[[] for i in range(n+1)]
D=[0]*(n+1)
for i in range(m):
x,y=map(int,input().split())
E[x].append(y)
E[y].app... | output | 1 | 16,953 | 13 | 33,907 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,954 | 13 | 33,908 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return [i for i in input().rstri... | output | 1 | 16,954 | 13 | 33,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected graph with n vertices, you can choose to either:
... | instruction | 0 | 16,955 | 13 | 33,910 |
Tags: constructive algorithms, dfs and similar, graphs, greedy
Correct Solution:
```
from collections import deque
from sys import stdin
import sys
from math import ceil
sys.setrecursionlimit(3*10**5)
n,m = map(int,stdin.readline().split())
rn = ceil(n**0.5)
lis = [ [] for i in range(n) ]
for i in range(m):
u,v =... | output | 1 | 16,955 | 13 | 33,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,956 | 13 | 33,912 |
Yes | output | 1 | 16,956 | 13 | 33,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,957 | 13 | 33,914 |
Yes | output | 1 | 16,957 | 13 | 33,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,958 | 13 | 33,916 |
No | output | 1 | 16,958 | 13 | 33,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,959 | 13 | 33,918 |
No | output | 1 | 16,959 | 13 | 33,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,960 | 13 | 33,920 |
No | output | 1 | 16,960 | 13 | 33,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's the year 5555. You have a graph, and you want to find a long cycle and a huge independent set, just because you can. But for now, let's just stick with finding either.
Given a connected gr... | instruction | 0 | 16,961 | 13 | 33,922 |
No | output | 1 | 16,961 | 13 | 33,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given m sets of integers A_1, A_2, …, A_m; elements of these sets are integers between 1 and n, inclusive.
There are two arrays of positive integers a_1, a_2, …, a_m and b_1, b_2, …, b_n.
In one operation you can delete an element... | instruction | 0 | 16,979 | 13 | 33,958 |
Tags: data structures, dsu, graphs, greedy, sortings, trees
Correct Solution:
```
import sys
#from bisect import *
#from collections import deque
pl=1
#from math import *
#from copy import *
if pl:
input=sys.stdin.readline
else:
sys.stdin=open('input.txt', 'r')
sys.stdout=open('outpt.txt','w')
def li():
return [... | output | 1 | 16,979 | 13 | 33,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given m sets of integers A_1, A_2, …, A_m; elements of these sets are integers between 1 and n, inclusive.
There are two arrays of positive integers a_1, a_2, …, a_m and b_1, b_2, …, b_n.
In one operation you can delete an element... | instruction | 0 | 16,980 | 13 | 33,960 |
Tags: data structures, dsu, graphs, greedy, sortings, trees
Correct Solution:
```
import sys;input=sys.stdin.readline
def root(x):
if x == p[x]:
return x
p[x] = y = root(p[x])
return y
def unite(x, y):
px = root(x); py = root(y)
if px == py:
return 0
rx = rank[px]; ry = rank[py]
... | output | 1 | 16,980 | 13 | 33,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given m sets of integers A_1, A_2, …, A_m; elements of these sets are integers between 1 and n, inclusive.
There are two arrays of positive integers a_1, a_2, …, a_m and b_1, b_2, …, b_n.
In one operation you can delete an element... | instruction | 0 | 16,981 | 13 | 33,962 |
Tags: data structures, dsu, graphs, greedy, sortings, trees
Correct Solution:
```
import sys; input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**7)
def getlist():
return list(map(int, input().split()))
class UnionFind:
def __init__(self, N):
self.par = [i for i in range(N)]
self.rank = [0] * N
def ... | output | 1 | 16,981 | 13 | 33,963 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.