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.
Railroad Trip
There are N cities in the JOI country, numbered 1, 2, ..., and N, respectively. In addition, there are N β 1 railroads, which are numbered 1, 2, ..., and N β 1, respectively. The railroad i (1 β€ i β€ N β 1) connects the city i and the c... | instruction | 0 | 101,123 | 1 | 202,246 |
"Correct Solution:
```
n,m=map(int,input().split())
u=[0]*n
a=list(map(int,input().split()))
b=a[0]-1
for x in a[1:]:
x-=1
u[max(b,x)]-=1
u[min(b,x)]+=1
b=x
ans=0
for i in range(n-1):
u[i+1]+=u[i]
d,b,c=map(int,input().split())
ans+=min(d*u[i],b*u[i]+c)
print(ans)
``` | output | 1 | 101,123 | 1 | 202,247 |
Provide a correct Python 3 solution for this coding contest problem.
Railroad Trip
There are N cities in the JOI country, numbered 1, 2, ..., and N, respectively. In addition, there are N β 1 railroads, which are numbered 1, 2, ..., and N β 1, respectively. The railroad i (1 β€ i β€ N β 1) connects the city i and the c... | instruction | 0 | 101,124 | 1 | 202,248 |
"Correct Solution:
```
# AOJ 0614: Railroad Trip
# Python3 2018.7.4 bal4u
import sys
from sys import stdin
input = stdin.readline
n, m = map(int, input().split())
p = list(map(int, input().split()))
tbl = []
for i in range(n-1):
a, b, c = map(int, input().split())
tbl.append((a, b, c))
f = [0]*n
for i in range(m-1)... | output | 1 | 101,124 | 1 | 202,249 |
Provide a correct Python 3 solution for this coding contest problem.
Railroad Trip
There are N cities in the JOI country, numbered 1, 2, ..., and N, respectively. In addition, there are N β 1 railroads, which are numbered 1, 2, ..., and N β 1, respectively. The railroad i (1 β€ i β€ N β 1) connects the city i and the c... | instruction | 0 | 101,125 | 1 | 202,250 |
"Correct Solution:
```
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.t... | output | 1 | 101,125 | 1 | 202,251 |
Provide a correct Python 3 solution for this coding contest problem.
Railroad Trip
There are N cities in the JOI country, numbered 1, 2, ..., and N, respectively. In addition, there are N β 1 railroads, which are numbered 1, 2, ..., and N β 1, respectively. The railroad i (1 β€ i β€ N β 1) connects the city i and the c... | instruction | 0 | 101,126 | 1 | 202,252 |
"Correct Solution:
```
from itertools import accumulate
n, m = map(int, input().split())
cnts = [0] * (n + 1)
cities = map(int, input().split())
prev = next(cities)
for cur in cities:
if prev < cur:
cnts[prev] += 1
cnts[cur] -= 1
else:
cnts[cur] += 1
cnts[prev] -= 1
prev = c... | output | 1 | 101,126 | 1 | 202,253 |
Provide a correct Python 3 solution for this coding contest problem.
Railroad Trip
There are N cities in the JOI country, numbered 1, 2, ..., and N, respectively. In addition, there are N β 1 railroads, which are numbered 1, 2, ..., and N β 1, respectively. The railroad i (1 β€ i β€ N β 1) connects the city i and the c... | instruction | 0 | 101,127 | 1 | 202,254 |
"Correct Solution:
```
import itertools
def main():
n, m = map(int, input().split())
plst = tuple(map(int, input().split()))
abclst = [tuple(map(int, input().split())) for _ in range(n - 1)]
sec = [0] * n
for pi, pi1 in zip(plst, plst[1:]):
p1, p2 = min(pi, pi1) - 1, max(pi, pi1) - 1
sec[p1] += 1
... | output | 1 | 101,127 | 1 | 202,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,561 | 1 | 203,122 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
nl = list(map(int, input().split()))
n = nl[0]
l = nl[1]
a = list(map(int, input().split()))
a.sort()
last = 0
max_dist = max(a[0], l - a[-1])
for elem in a:
if (elem - last) / 2 > max_dist:
max_dist = (elem - last) / 2
last = ele... | output | 1 | 101,561 | 1 | 203,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,562 | 1 | 203,124 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
# You lost the game.
n, l = map(int, input().split())
L = list(map(int, input().split()))
L.sort()
L = [-L[0]]+L+[2*l-L[n-1]]
r = 0
for i in range(n+1):
if (L[i+1]-L[i])/2>r:
r = (L[i+1]-L[i])/2
print(r)
``` | output | 1 | 101,562 | 1 | 203,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,563 | 1 | 203,126 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
n, l = map (int, input().split())
a = sorted(map(int, input().split()))
gap = 0
#print(max([a[0], l - a[n-1]] + [(a[i+1]-a[i])/2 for i in range (n-1)]))
for i in range(n-1):
if gap < (a[i+1]-a[i])/2:
gap = (a[i+1]-a[i])/2
print(max(a... | output | 1 | 101,563 | 1 | 203,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,564 | 1 | 203,128 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
n,l = map(int,input().split())
Line = [int(i) for i in input().split()]
Line.sort()
k = max(Line[0],l-Line[n-1])
for i in range(1,n):
p = Line[i]-Line[i-1]
k = max(k,p/2)
print(k)
``` | output | 1 | 101,564 | 1 | 203,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,565 | 1 | 203,130 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
first = input().split(" ")
n = int(first[0])
l = int(first[1])
second = [int(s) for s in input().split(" ")]
second.sort()
d = 0
for i in range(len(second)-1):
d = max(second[i+1]-second[i], d)
if second[0] != 0 and second[-1] != l:
prin... | output | 1 | 101,565 | 1 | 203,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,566 | 1 | 203,132 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
[n, l] = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a.append(0)
a.append(l)
a.sort()
a = [a[i+1] - a[i] for i in range(len(a) - 1)]
a[0] = a[0] * 2
a[len(a) - 1] = a[len(a) - 1] * 2
print(max(a)/2)
``` | output | 1 | 101,566 | 1 | 203,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,567 | 1 | 203,134 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
n,m=map(int,input().split())
l=sorted(list(map(int,input().split())))
r=[min(l),m-max(l)]
for i in range(1,len(l)):
r.append((l[i]-l[i-1])/2)
print(max(r))
``` | output | 1 | 101,567 | 1 | 203,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vanya walks late at night along a straight street of length l, lit by n lanterns. Consider the coordinate system with the beginning of the street corresponding to the point 0, and its end corresponding to the point l. Then the i-th lantern i... | instruction | 0 | 101,568 | 1 | 203,136 |
Tags: binary search, implementation, math, sortings
Correct Solution:
```
n,l=map(int,input().split())
A=list(map(int,input().split()))
B=sorted(A)
C=[]
if n==1:
print(max(A[0],l-A[0]))
else:
for i in range(1,n):
b=B[i]-B[i-1]
C.append(b)
c=max(C)
d=max(c,2*B[0],2*(l-B[n-1]))
print(f... | output | 1 | 101,568 | 1 | 203,137 |
Provide a correct Python 3 solution for this coding contest problem.
problem
JOI City will hold a large-scale exposition.
There are two themes for this exposition, and each of the N exhibition facilities in JOI City will exhibit on one of the two themes.
The location of the facility is represented by plane coordina... | instruction | 0 | 101,990 | 1 | 203,980 |
"Correct Solution:
```
# AOJ 0552: Exposition
# Python3 2018.7.1 bal4u
import sys
from sys import stdin
input = stdin.readline
x, y = [], []
n = int(input())
for i in range(n):
a, b = map(int, input().split())
x.append(a+b)
y.append(a-b)
xmin, xmax = min(x), max(x)
ymin, ymax = min(y), max(y)
ans1 = ans2 = 0
for i... | output | 1 | 101,990 | 1 | 203,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having problems with tram routes in the morning, Arkady decided to return home by metro. Fortunately for Arkady, there is only one metro line in the city.
Unfortunately for Arkady, the line is ... | instruction | 0 | 102,053 | 1 | 204,106 |
No | output | 1 | 102,053 | 1 | 204,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having problems with tram routes in the morning, Arkady decided to return home by metro. Fortunately for Arkady, there is only one metro line in the city.
Unfortunately for Arkady, the line is ... | instruction | 0 | 102,054 | 1 | 204,108 |
No | output | 1 | 102,054 | 1 | 204,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having problems with tram routes in the morning, Arkady decided to return home by metro. Fortunately for Arkady, there is only one metro line in the city.
Unfortunately for Arkady, the line is ... | instruction | 0 | 102,055 | 1 | 204,110 |
No | output | 1 | 102,055 | 1 | 204,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having problems with tram routes in the morning, Arkady decided to return home by metro. Fortunately for Arkady, there is only one metro line in the city.
Unfortunately for Arkady, the line is ... | instruction | 0 | 102,056 | 1 | 204,112 |
No | output | 1 | 102,056 | 1 | 204,113 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,383 | 1 | 204,766 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n,m = map(int,input().split())
c=[]
for i in range(1,n+1):
c.append(i)
x=[]
for i in range(m):
a,b=map(int,input().split())
x.append(a)
x.append(b)
for i in c:
if i not in set(x):
break
ans=i
a=[]
for i in range(len(c)):
if ... | output | 1 | 102,383 | 1 | 204,767 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,384 | 1 | 204,768 |
Tags: constructive algorithms, graphs
Correct Solution:
```
import sys
sys.setrecursionlimit(10000)
n, m = [int(x) for x in sys.stdin.readline().strip().split()]
index = 1
s = set(range(1,n+1))
for i in range(m):
k = {int(x) for x in sys.stdin.readline().strip().split()}
s=s-k
l=list(s)[0]
print(n-1)
for i in range... | output | 1 | 102,384 | 1 | 204,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,385 | 1 | 204,770 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n, m = map(int, input().split())
t = []
for i in range(m):
t += input().split()
t = set(t)
i = 1
while str(i) in t:
i += 1
print(n-1)
j = 1
while j < i:
print(i, j)
j+=1
j = i+1
while j < n + 1:
print(i, j)
j+=1
... | output | 1 | 102,385 | 1 | 204,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,386 | 1 | 204,772 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n,m = map(int,input().split())
arr = [0] * 1005
i = 1
for k in range(m):
a,b = map(int,input().split())
arr[a] = 1
arr[b] = 1
for i in range(1,n+1):
if arr[i] == 0:
break
print(n-1)
for j in range(1,n+1):
if i != j:
pr... | output | 1 | 102,386 | 1 | 204,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,387 | 1 | 204,774 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n,m=map(int,input().split())
l=[]
for i in range(n):
l.append(0)
for t in range(m):
a,b=map(int,input().split())
l[a-1]=-1
l[b-1]=-1
for y in range(len(l)):
if l[y]!=-1:
o=y
break
print(n-1)
for t in range(n):
if t!=o:
print (t+1,o+1)
``` | output | 1 | 102,387 | 1 | 204,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,388 | 1 | 204,776 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n,m=[int(x) for x in input().split()]
forbidden=set()
for i in range(m):
a,b=[int(x) for x in input().split()]
forbidden.add(a)
forbidden.add(b)
for i in range(1,n+1):
if i not in forbidden:
print(n-1)
for j in range(1,n+1):
if j!=i:
print(j,i)
... | output | 1 | 102,388 | 1 | 204,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,389 | 1 | 204,778 |
Tags: constructive algorithms, graphs
Correct Solution:
```
def roadConstruction():
n,m=map(int,input().split())
lst=[[0 for i in range(n)] for j in range(n)]
for i in range(m):
u,v=map(int,input().split())
lst[u-1][v-1]=-1
lst[v-1][u-1]=-1
flag=False
# The idea is very sim... | output | 1 | 102,389 | 1 | 204,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants those roads to be constructed in such a way that it... | instruction | 0 | 102,390 | 1 | 204,780 |
Tags: constructive algorithms, graphs
Correct Solution:
```
from sys import stdin,stdout
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda: list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()
mod = 1000000007
n, m = iia()
d1 = se... | output | 1 | 102,390 | 1 | 204,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,391 | 1 | 204,782 |
Yes | output | 1 | 102,391 | 1 | 204,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,392 | 1 | 204,784 |
Yes | output | 1 | 102,392 | 1 | 204,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,393 | 1 | 204,786 |
Yes | output | 1 | 102,393 | 1 | 204,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,394 | 1 | 204,788 |
Yes | output | 1 | 102,394 | 1 | 204,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,395 | 1 | 204,790 |
No | output | 1 | 102,395 | 1 | 204,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,396 | 1 | 204,792 |
No | output | 1 | 102,396 | 1 | 204,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,397 | 1 | 204,794 |
No | output | 1 | 102,397 | 1 | 204,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A country has n cities. Initially, there is no road in the country. One day, the king decides to construct some roads connecting pairs of cities. Roads can be traversed either way. He wants thos... | instruction | 0 | 102,398 | 1 | 204,796 |
No | output | 1 | 102,398 | 1 | 204,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street-avenue crossings. They are going to celebrate ... | instruction | 0 | 102,457 | 1 | 204,914 |
Tags: greedy, math
Correct Solution:
```
import sys
input = sys.stdin.readline
N, M = input().split()
a, b, c, d = [int(1e10) for _ in range(4)]
for i in range(int(input())):
x, y = list(map(int, input().split()))
a, b, c, d = min(a, x + y), min(b, x - y), min(c, - x + y), min(d, - x - y)
res, pos = int(1e10), ... | output | 1 | 102,457 | 1 | 204,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street-avenue crossings. They are going to celebrate ... | instruction | 0 | 102,458 | 1 | 204,916 |
Tags: greedy, math
Correct Solution:
```
#!/usr/bin/env python3
n, m = map(int, input().split())
minx = miny = n + m
maxx = maxy = - minx
dist = n + m + 1
c = int(input())
for _ in range(c):
x, y = map(int, input().split())
minx = min(minx, x - y)
miny = min(miny, x + y)
maxx = max(maxx, x - y)
ma... | output | 1 | 102,458 | 1 | 204,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street-avenue crossings. They are going to celebrate ... | instruction | 0 | 102,459 | 1 | 204,918 |
Tags: greedy, math
Correct Solution:
```
N, M = input().split()
a, b, c, d = [int(1e10) for _ in range(4)]
for i in range(int(input())):
x, y = list(map(int, input().split()))
a, b, c, d = min(a, x + y), min(b, x - y), min(c, - x + y), min(d, - x - y)
res, pos = int(1e10), 0
for i in range(int(input())):
x,... | output | 1 | 102,459 | 1 | 204,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street... | instruction | 0 | 102,460 | 1 | 204,920 |
No | output | 1 | 102,460 | 1 | 204,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street... | instruction | 0 | 102,461 | 1 | 204,922 |
No | output | 1 | 102,461 | 1 | 204,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street... | instruction | 0 | 102,462 | 1 | 204,924 |
No | output | 1 | 102,462 | 1 | 204,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Think of New York as a rectangular grid consisting of N vertical avenues numerated from 1 to N and M horizontal streets numerated 1 to M. C friends are staying at C hotels located at some street... | instruction | 0 | 102,463 | 1 | 204,926 |
No | output | 1 | 102,463 | 1 | 204,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,480 | 1 | 204,960 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje
from collections import deque
def idx(i, j):
return i*m + j
def solve():
global n, m
n, m = map(lambda x: int(x), input().split())... | output | 1 | 102,480 | 1 | 204,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,481 | 1 | 204,962 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje
from collections import deque
def idx(i, j):
return i*m + j
def solve():
global n, m
n, m = map(lambda x: int(x), input().split())... | output | 1 | 102,481 | 1 | 204,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,482 | 1 | 204,964 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje
from collections import deque
def idx(i, j):
return i*m + j
def solve():
global n, m
n, m = map(lambda x: int(x), input().split())... | output | 1 | 102,482 | 1 | 204,965 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,483 | 1 | 204,966 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
#!/usr/bin/env python3
#
# Three States
#
import sys, os
from collections import deque
from pprint import pprint
def read_ints(): return list(map(int, input().split()))
def read_str(): return input().strip()
n, m = read_ints()
s = [read_str() for _ i... | output | 1 | 102,483 | 1 | 204,967 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,484 | 1 | 204,968 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
from collections import deque
def idx(i, j):
return i*m + j
def solve():
global n, m
n, m = map(lambda x: int(x), input().split())
global maxVal
maxVal = (n*m)**2
graph = ['']*(n*m)
vrtDst = [[maxVal] * (n*m), [maxVal] *... | output | 1 | 102,484 | 1 | 204,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through the territory of any of them. In addition, it was... | instruction | 0 | 102,485 | 1 | 204,970 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
# lista doble enlazada o(1) operaciones en los bordes es mejor que si se implementa en el propio lenguaje
from collections import deque
n, m = input().split()
n = int(n)
m = int(m)
def idx(i, j):
return i*m + j
max = n*m*2
graph = ""
virtDist =... | output | 1 | 102,485 | 1 | 204,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through th... | instruction | 0 | 102,486 | 1 | 204,972 |
No | output | 1 | 102,486 | 1 | 204,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through th... | instruction | 0 | 102,487 | 1 | 204,974 |
No | output | 1 | 102,487 | 1 | 204,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The famous global economic crisis is approaching rapidly, so the states of Berman, Berance and Bertaly formed an alliance and allowed the residents of all member states to freely pass through th... | instruction | 0 | 102,488 | 1 | 204,976 |
No | output | 1 | 102,488 | 1 | 204,977 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.