message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that use only the Shinkansen, one ticket can be used as both a... | instruction | 0 | 52,957 | 1 | 105,914 |
"Correct Solution:
```
b1,b2,b3=map(int,input().split())
if (b1==1 and b2==1 and b3==0) or (b1==0 and b2==0 and b3==1):
print("Open")
else:
print("Close")
``` | output | 1 | 52,957 | 1 | 105,915 |
Provide a correct Python 3 solution for this coding contest problem.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that use only the Shinkansen, one ticket can be used as both a... | instruction | 0 | 52,958 | 1 | 105,916 |
"Correct Solution:
```
b1, b2, b3 = map(int,input().split())
if b1 == 1 and b2 == 1:
print('Open')
elif b3 == 1:
print('Open')
else:
print('Close')
``` | output | 1 | 52,958 | 1 | 105,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,959 | 1 | 105,918 |
Yes | output | 1 | 52,959 | 1 | 105,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,960 | 1 | 105,920 |
Yes | output | 1 | 52,960 | 1 | 105,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,961 | 1 | 105,922 |
Yes | output | 1 | 52,961 | 1 | 105,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,962 | 1 | 105,924 |
Yes | output | 1 | 52,962 | 1 | 105,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,963 | 1 | 105,926 |
No | output | 1 | 52,963 | 1 | 105,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,964 | 1 | 105,928 |
No | output | 1 | 52,964 | 1 | 105,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
To get on the Shinkansen, you need two tickets, a "ticket" and a "limited express ticket". These are separate tickets because some of the routes may not use the Shinkansen, but for routes that u... | instruction | 0 | 52,965 | 1 | 105,930 |
No | output | 1 | 52,965 | 1 | 105,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,202 | 1 | 106,404 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import sys
from collections import deque
input=sys.stdin.readline
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
a=[a[i]-1 for i in range(k)]
edge=[[] for i in range(n)]
for i in ran... | output | 1 | 53,202 | 1 | 106,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,203 | 1 | 106,406 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
def bfs(V):
q = deque()
q.append(V)
distance = [-1] * n
distance[V]=0
while len(q) > 0 :
v = q.popleft()
for u in g[v]:
if distance[u]!=-1:
... | output | 1 | 53,203 | 1 | 106,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,204 | 1 | 106,408 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
from math import factorial
from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE =... | output | 1 | 53,204 | 1 | 106,409 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,205 | 1 | 106,410 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
from collections import deque
import sys
input=sys.stdin.readline
n,m,k=map(int,input().split())
A=list(map(int,input().split()))
E=[[] for _ in range(n)]
for _ in range(m):
x,y=map(int,input().spli... | output | 1 | 53,205 | 1 | 106,411 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,206 | 1 | 106,412 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
n,m,K = map(int,input().split())
sp = list(map(lambda x:int(x)-1 ,input().split()))
peer = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split()... | output | 1 | 53,206 | 1 | 106,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,207 | 1 | 106,414 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
import heapq
from heapq import heappop, heappush
INF = 10**9
class Dijkstra:
def __init__(self, adj):
self.n = len(adj)
... | output | 1 | 53,207 | 1 | 106,415 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,208 | 1 | 106,416 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
#Pye
from sys import stdin, stdout
from os import path
from collections import deque
from heapq import heappop, heappush
maxn = 200005
mark = [0 for i in range(maxn)]
f = [0 for i in range(maxn)]
g = [... | output | 1 | 53,208 | 1 | 106,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The Cowfederation of Barns has ordered Farmer John ... | instruction | 0 | 53,209 | 1 | 106,418 |
Tags: binary search, data structures, dfs and similar, graphs, greedy, shortest paths, sortings
Correct Solution:
```
def bfs(adj, root):
q = [(root, 0)]
dist = [0] * len(adj)
vis = {root}
i = 0
while i < len(q):
u, d = q[i]
i += 1
dist[u] = d
for v in adj[u]:
... | output | 1 | 53,209 | 1 | 106,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,210 | 1 | 106,420 |
Yes | output | 1 | 53,210 | 1 | 106,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,211 | 1 | 106,422 |
Yes | output | 1 | 53,211 | 1 | 106,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,212 | 1 | 106,424 |
Yes | output | 1 | 53,212 | 1 | 106,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,213 | 1 | 106,426 |
Yes | output | 1 | 53,213 | 1 | 106,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,214 | 1 | 106,428 |
No | output | 1 | 53,214 | 1 | 106,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,215 | 1 | 106,430 |
No | output | 1 | 53,215 | 1 | 106,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,216 | 1 | 106,432 |
No | output | 1 | 53,216 | 1 | 106,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bessie is out grazing on the farm, which consists of n fields connected by m bidirectional roads. She is currently at field 1, and will return to her home at field n at the end of the day.
The ... | instruction | 0 | 53,217 | 1 | 106,434 |
No | output | 1 | 53,217 | 1 | 106,435 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,783 | 1 | 107,566 |
"Correct Solution:
```
n, D = map(int, input().split())
x = list(map(int, input().split()))
Q = int(input())
q = list(map(int, input().split()))
ind = [D]
for i in range(n):
ind.append(min(ind[-1], abs(ind[-1] - x[i])))
#print(ind)
l = [1]
for i in range(n-1, -1, -1):
if x[i] < 2*l[-1]:
l.append(x[i] + l[-1])
el... | output | 1 | 53,783 | 1 | 107,567 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,784 | 1 | 107,568 |
"Correct Solution:
```
N,D=map(int,input().split())
d=list(map(int,input().split()))
dp=[D]*N
if abs(D-d[0])<D:
dp[0]=abs(D-d[0])
for i in range(1,N):
dp[i]=min(dp[i-1],abs(dp[i-1]-d[i]))
ans=["NO"]*N
data=[0]*(N+1)
for i in range(N-1,0,-1):
if d[i]//2>data[i+1]:
data[i]=data[i+1]
else:
... | output | 1 | 53,784 | 1 | 107,569 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,785 | 1 | 107,570 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,X = map(int,readline().split())
D = [0] + list(map(int,readline().split()))
readline()
Q = list(map(int,read().split()))
# 各日の出発座標
start = [X] * (N+2)
for n,d in enumerate(D[1:]... | output | 1 | 53,785 | 1 | 107,571 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,786 | 1 | 107,572 |
"Correct Solution:
```
N, D = map( int, input().split() )
d = list( map( int, input().split() ) )
Q = int( input() )
q = list( map( int, input().split() ) )
dis = [ 0 for i in range( N + 1 ) ]
dis[ 0 ] = D
for i in range( N ):
dis[ i + 1 ] = min( dis[ i ], abs( dis[ i ] - d[ i ] ) )
dp = [ 0 for i in range( N + 1 )... | output | 1 | 53,786 | 1 | 107,573 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,787 | 1 | 107,574 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return ... | output | 1 | 53,787 | 1 | 107,575 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,788 | 1 | 107,576 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
"""
後ろから、到達不可能距離の集合を見ていきたい。
集合を持つと厳しいが、最小値だけ持っておけばよい。
"""
N,dist = map(int,input().split())
D = [int(x) for x in input().split()]
# 各ターンの出発位置
start_dist = [dist]
for d in D:
x = start_dist[-1]
y = min(abs(x - d), x)
start_dist.append(y)
ng_dis... | output | 1 | 53,788 | 1 | 107,577 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,789 | 1 | 107,578 |
"Correct Solution:
```
N, D = map(int, input().split())
ds = list(map(int, input().split()))
Q = int(input())
querys = list(map(lambda x: int(x) - 1, input().split()))
# ps[i]: i回目の移動後の位置（目的地までの距離）
ps = [0] * (N + 1)
ps[0] = D
for i in range(N):
ps[i + 1] = min(abs(ps[i] - ds[i]), ps[i])
if ps[N] != 0:
print(... | output | 1 | 53,789 | 1 | 107,579 |
Provide a correct Python 3 solution for this coding contest problem.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it will travel in the direction of the destination by a dis... | instruction | 0 | 53,790 | 1 | 107,580 |
"Correct Solution:
```
N,start = map(int,input().split())
D = list(map(int,input().split()))
input()
Q = list(map(int,input().split()))
Q = [(k-1,i) for i,k in enumerate(Q)]
Q.sort()
P = [start]
for d in D:
a = P[-1]
b = abs(a-d)
P.append(min(a,b))
result = [None]*len(Q)
x = 1
for i,d in zip(reversed(range(l... | output | 1 | 53,790 | 1 | 107,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,791 | 1 | 107,582 |
Yes | output | 1 | 53,791 | 1 | 107,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,792 | 1 | 107,584 |
Yes | output | 1 | 53,792 | 1 | 107,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,793 | 1 | 107,586 |
Yes | output | 1 | 53,793 | 1 | 107,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,794 | 1 | 107,588 |
Yes | output | 1 | 53,794 | 1 | 107,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,795 | 1 | 107,590 |
No | output | 1 | 53,795 | 1 | 107,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,796 | 1 | 107,592 |
No | output | 1 | 53,796 | 1 | 107,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,797 | 1 | 107,594 |
No | output | 1 | 53,797 | 1 | 107,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alice lives on a line. Today, she will travel to some place in a mysterious vehicle. Initially, the distance between Alice and her destination is D. When she input a number x to the vehicle, it ... | instruction | 0 | 53,798 | 1 | 107,596 |
No | output | 1 | 53,798 | 1 | 107,597 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are N villages. Each village is numbered from 1 to N. Due to the recent merger boom, several villages have been merged. Two or more merged villages will become one new city, and villages that are not merged with any village will remain... | instruction | 0 | 53,869 | 1 | 107,738 |
"Correct Solution:
```
n, m = map(int, input().split())
q = []
for _ in range(m):
a, b = map(int, input().split())
i, j = -1, -1
for k in range(len(q)):
if i == -1:
if a in q[k]:
i = k
if j == -1:
if b in q[k]:
j = k
if i >= 0 a... | output | 1 | 53,869 | 1 | 107,739 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are N villages. Each village is numbered from 1 to N. Due to the recent merger boom, several villages have been merged. Two or more merged villages will become one new city, and villages that are not merged with any village will remain... | instruction | 0 | 53,871 | 1 | 107,742 |
"Correct Solution:
```
[m,n] = map(int,input().split())
def find(v,cs):
for c in cities:
if v in c:
return (True,c)
return (False,set([v]))
cities = []
for _ in range(n):
[a,b] = map(int,input().split())
(ra,fa) = find(a,cities)
(rb,fb) = find(b,cities)
mg = fa | fb
... | output | 1 | 53,871 | 1 | 107,743 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are N villages. Each village is numbered from 1 to N. Due to the recent merger boom, several villages have been merged. Two or more merged villages will become one new city, and villages that are not merged with any village will remain... | instruction | 0 | 53,872 | 1 | 107,744 |
"Correct Solution:
```
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import array
class UnionFind(object):
def __init__(self, number_of_nodes, typecode="L"):
self.typecode = typecode
self.par = array.array(typecode, range(number_of_nodes))
self.rank = array.array(typecode, (0 for i in r... | output | 1 | 53,872 | 1 | 107,745 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
There are N villages. Each village is numbered from 1 to N. Due to the recent merger boom, several villages have been merged. Two or more merged villages will become one new city, and villages that are not merged with any village will remain... | instruction | 0 | 53,873 | 1 | 107,746 |
"Correct Solution:
```
n, m = map(int, input().split())
parent = [i for i in range(n)]
def get_par(x):
if x == parent[x]:return x
parent[x] = get_par(parent[x])
return parent[x]
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
pa, pb = get_par(a), get_par(b)
parent[pb]... | output | 1 | 53,873 | 1 | 107,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Farmer John has a farm that consists of n pastures connected by one-directional roads. Each road has a weight, representing the time it takes to go from the start to the end of the road. The roads could have negative weight, where the cows g... | instruction | 0 | 54,200 | 1 | 108,400 |
Tags: constructive algorithms, graphs, greedy, shortest paths, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
#<fast I/O>
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
se... | output | 1 | 54,200 | 1 | 108,401 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Farmer John has a farm that consists of n pastures connected by one-directional roads. Each road has a weight, representing the time it takes to go from the start to the end of the road. The roads could have negative weight, where the cows g... | instruction | 0 | 54,201 | 1 | 108,402 |
Tags: constructive algorithms, graphs, greedy, shortest paths, sortings
Correct Solution:
```
"""
ID: happyn61
LANG: PYTHON3
PROB: loan
"""
from itertools import product
import itertools
#from collections import defaultdict
import sys
import heapq
from collections import deque
MOD=1000000000007
#fin = open ('loan.in', ... | output | 1 | 54,201 | 1 | 108,403 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Farmer John has a farm that consists of n pastures connected by one-directional roads. Each road has a weight, representing the time it takes to go from the start to the end of the road. The roads could have negative weight, where the cows g... | instruction | 0 | 54,202 | 1 | 108,404 |
Tags: constructive algorithms, graphs, greedy, shortest paths, sortings
Correct Solution:
```
'''
Rohit Kumar Vishwas
13th June 2021
'''
import sys
import math
import os.path
from collections import *
from queue import *
from bisect import *
from heapq import *
# sys.setrecursionlimit(10 ** 6)
MOD = int(1e9 + ... | output | 1 | 54,202 | 1 | 108,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Farmer John has a farm that consists of n pastures connected by one-directional roads. Each road has a weight, representing the time it takes to go from the start to the end of the road. The roads could have negative weight, where the cows g... | instruction | 0 | 54,203 | 1 | 108,406 |
Tags: constructive algorithms, graphs, greedy, shortest paths, sortings
Correct Solution:
```
'''
Auther: ghoshashis545 Ashis Ghosh
College: Jalpaiguri Govt Enggineering College
'''
from os import path
from io import BytesIO, IOBase
import sys
from heapq import heappush,heappop
from functools import cmp_to_key... | output | 1 | 54,203 | 1 | 108,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Farmer John has a farm that consists of n pastures connected by one-directional roads. Each road has a weight, representing the time it takes to go from the start to the end of the road. The roads could have negative weight, where the cows g... | instruction | 0 | 54,204 | 1 | 108,408 |
Tags: constructive algorithms, graphs, greedy, shortest paths, sortings
Correct Solution:
```
# Author Name: Ajay Meena
# Codeforce : https://codeforces.com/profile/majay1638
import sys
import math
import bisect
import heapq
from bisect import bisect_right
from sys import stdin, stdout
# -------------- INPUT FUNCTIONS... | output | 1 | 54,204 | 1 | 108,409 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.