message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caisa solved the problem with the sugar and now he is on the way back to home.
Caisa is playing a mobile game during his path. There are (n + 1) pylons numbered from 0 to n in this game. The p... | instruction | 0 | 9,453 | 8 | 18,906 |
No | output | 1 | 9,453 | 8 | 18,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Caisa solved the problem with the sugar and now he is on the way back to home.
Caisa is playing a mobile game during his path. There are (n + 1) pylons numbered from 0 to n in this game. The p... | instruction | 0 | 9,454 | 8 | 18,908 |
No | output | 1 | 9,454 | 8 | 18,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tarly has two different type of items, food boxes and wine barrels. There are f food boxes and w wine barrels. Tarly stores them in various stacks and each stack can consist of either food boxes or wine barrels but not both. The stacks are p... | instruction | 0 | 9,562 | 8 | 19,124 |
Tags: brute force, combinatorics, math, number theory, probabilities
Correct Solution:
```
def build_fac():
global mod
fac = [1] * int(3e5 + 1)
for i in range(1, int(3e5)):
fac[i] = i*fac[i-1] % mod
return fac
def inv(x):
global mod
return pow(x, mod-2, mod)
def ncr(n, r):
global fac
if ... | output | 1 | 9,562 | 8 | 19,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Tarly has two different type of items, food boxes and wine barrels. There are f food boxes and w wine barrels. Tarly stores them in various stacks and each stack can consist of either food boxes or wine barrels but not both. The stacks are p... | instruction | 0 | 9,563 | 8 | 19,126 |
Tags: brute force, combinatorics, math, number theory, probabilities
Correct Solution:
```
import sys
def factorial():
global mod
fac = [1] * int(3e5 + 1)
for i in range(1, int(3e5)):
fac[i] = i*fac[i-1] % mod
return fac
def inverse(x):
global mod
return pow(x, mod-2, mod)
def C(n, r):
... | output | 1 | 9,563 | 8 | 19,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tarly has two different type of items, food boxes and wine barrels. There are f food boxes and w wine barrels. Tarly stores them in various stacks and each stack can consist of either food boxes... | instruction | 0 | 9,564 | 8 | 19,128 |
No | output | 1 | 9,564 | 8 | 19,129 |
Provide a correct Python 3 solution for this coding contest problem.
An angel lives in the clouds above the city where Natsume lives. The angel, like Natsume, loves cats and often comes down to the ground to play with cats. To get down to the ground, the angel made a long, long staircase leading from the clouds to the... | instruction | 0 | 9,865 | 8 | 19,730 |
"Correct Solution:
```
dic = {"C":0, "C#":1, "D":2, "D#":3,
"E":4, "F":5, "F#":6, "G":7,
"G#":8, "A":9, "A#":10, "B":11}
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
t_lst = [-100] + list(map(lambda x:dic[x],input().split()))
s_lst = list(map(lambda x:dic[x],input().split()))... | output | 1 | 9,865 | 8 | 19,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,902 | 8 | 19,804 |
Tags: math
Correct Solution:
```
n, h, a, b, k = map(int, input().split())
res = []
for i in range(k):
count = 0
ta, fa, tb, fb = map(int, input().split())
if ta == tb:
count += abs(fa-fb)
else:
if fa<a:
count += a-fa+ abs(ta-tb)+abs(a-fb)
elif fa>b:
coun... | output | 1 | 9,902 | 8 | 19,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,903 | 8 | 19,806 |
Tags: math
Correct Solution:
```
n,h,a,b,k = map(int, input().split())
for i in range(k):
ta,fa,tb,fb = map(int, input().split())
if ta == tb: print(abs(fa-fb))
else:
if fa in range(a,b+1):
print(abs(tb-ta) + abs(fb-fa))
else:
ans = (min(abs(fa-a),abs(fa-b)) + abs(tb-... | output | 1 | 9,903 | 8 | 19,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,904 | 8 | 19,808 |
Tags: math
Correct Solution:
```
n,h,a,b,k=map(int,input('').split())
for i in range (k) :
s=0
ta,fa,tb,fb=map(int,input('').split())
if ta==tb:
print(abs(fb-fa))
else:
if fa<a:
s+=a-fa
s+=abs(tb-ta)
s+=abs(fb-a)
elif fa>b:
s+=fa-b
s+=abs(tb-ta)
s+=abs(fb-b)
else:
s+=abs... | output | 1 | 9,904 | 8 | 19,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,905 | 8 | 19,810 |
Tags: math
Correct Solution:
```
n,h,a,b,k=map(int,input().split())
for i in range (k):
ta,fa,tb,fb=map(int,input().split())
x=abs(ta-tb)
if (x==0) or (fa<=b and fa>=a):
x+=abs(fa-fb)
elif fa<a:
x+=(a-fa)+abs(a-fb)
else :
x+=(fa-b)+abs(b-fb)
print(x)
``` | output | 1 | 9,905 | 8 | 19,811 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,906 | 8 | 19,812 |
Tags: math
Correct Solution:
```
n, h, a, b, k = map(int, input().split())
for i in range(k):
ta, fa, tb, fb = map(int, input().split())
res = abs(ta-tb)
if ta == tb:
res += abs(fa-fb)
print(res)
else:
if a <= fa and fa <= b:
res += abs(fa-fb)
print(res)
else:
if fa < a:
... | output | 1 | 9,906 | 8 | 19,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,907 | 8 | 19,814 |
Tags: math
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI():... | output | 1 | 9,907 | 8 | 19,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,908 | 8 | 19,816 |
Tags: math
Correct Solution:
```
inputA = [int(i) for i in input().split()]
queries = []
for i in range(inputA[4]):
queries.append([int(j) for j in input().split()])
for i in range(inputA[4]):
if queries[i][0] == queries[i][2]:
print(abs(queries[i][1]-queries[i][3]))
else:
if queries[i][1] >... | output | 1 | 9,908 | 8 | 19,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is important to know how long it would take to get fr... | instruction | 0 | 9,909 | 8 | 19,818 |
Tags: math
Correct Solution:
```
n, h, a, b, k = [int(i) for i in input().split()]
for ii in range(k):
t1, f1, t2, f2 = [int(i) for i in input().split()]
ans = abs(t2 - t1)
if t2 != t1:
if f1 < a:
ans += a - f1
f1 = a
elif f1 > b:
ans += f1 - b
f1 = b
if f2 < a:
ans +... | output | 1 | 9,909 | 8 | 19,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,910 | 8 | 19,820 |
Yes | output | 1 | 9,910 | 8 | 19,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,911 | 8 | 19,822 |
Yes | output | 1 | 9,911 | 8 | 19,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,912 | 8 | 19,824 |
Yes | output | 1 | 9,912 | 8 | 19,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,913 | 8 | 19,826 |
Yes | output | 1 | 9,913 | 8 | 19,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,914 | 8 | 19,828 |
No | output | 1 | 9,914 | 8 | 19,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,915 | 8 | 19,830 |
No | output | 1 | 9,915 | 8 | 19,831 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,916 | 8 | 19,832 |
No | output | 1 | 9,916 | 8 | 19,833 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are looking at the floor plan of the Summer Informatics School's new building. You were tasked with SIS logistics, so you really care about travel time between different locations: it is imp... | instruction | 0 | 9,917 | 8 | 19,834 |
No | output | 1 | 9,917 | 8 | 19,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,934 | 8 | 19,868 |
Tags: greedy, two pointers
Correct Solution:
```
n, r = map(int, input().split())
a = list(map(int, input().split()))
last = -1
ans = 0
while(last < n-1):
for i in range(n-1, max(-1, last-r+1), -1):
pos = -1
if(a[i] == 1 and i <= last+r):
pos = i
last = pos + r - 1
... | output | 1 | 9,934 | 8 | 19,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,935 | 8 | 19,870 |
Tags: greedy, two pointers
Correct Solution:
```
n, r = list(map(int, input().split()))
a = list(map(int, input().split()))
i = 0
ok = True
ans = 0
while i < n:
#print(i)
z = min(i + r - 1, n - 1)
j = max(i - r + 1, 0)
p = -1
for k in range(z, j - 1, -1):
if a[k] == 1:
p = k
... | output | 1 | 9,935 | 8 | 19,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,936 | 8 | 19,872 |
Tags: greedy, two pointers
Correct Solution:
```
""" 616C """
""" 1152B """
import math
# import sys
def main():
# n ,m= map(int,input().split())
# arr = list(map(int,input().split()))
# b = list(map(int,input().split()))
# n = int(input())
# string = str(input())
# TODO:
# 1> LEETCODE FIRST PROBLEM WRITE
# 2> ... | output | 1 | 9,936 | 8 | 19,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,937 | 8 | 19,874 |
Tags: greedy, two pointers
Correct Solution:
```
R=lambda:map(int,input().split())
n,r=R()
a=[*R()]+[0]*(r-1)
p=q=-r
c=0
for i in range(n+r-1):
if a[i]:p=i
if i-q==2*r-1:
if p==q:c=-1;break
q=p;c+=1
print(c)
#JSR
``` | output | 1 | 9,937 | 8 | 19,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,938 | 8 | 19,876 |
Tags: greedy, two pointers
Correct Solution:
```
n, r = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
k = -1
for i in range(n):
if (a[i] == 1):
if (i - r > k):
ans = 0
break
tmp = 0
for j in range(i, n):
if (a[j] == 1):
if (j - r <= k):
tmp = j + r - 1
else:
bre... | output | 1 | 9,938 | 8 | 19,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,939 | 8 | 19,878 |
Tags: greedy, two pointers
Correct Solution:
```
R=lambda:map(int,input().split())
n,r=R()
p=q=-r
r-=1
c=0
for i,x in enumerate(R()):
if x:p=i
if i-q>2*r:
if p==q:c=-1;break
q=p;c+=1
print((c,c+1,-1)[(i-p>r)+(i-q>r)])
``` | output | 1 | 9,939 | 8 | 19,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,940 | 8 | 19,880 |
Tags: greedy, two pointers
Correct Solution:
```
def get_max(x, y):
if x>y:
return x
else:
return y
def get_min(x, y):
if x<y:
return x
else:
return y
seg=[]
n, r=map(int, input().split())
ar=list(map(int, input().split()))
for i in range(len(ar)):
if ar[i]==0: continue
seg.append((get_max(0, i-r+1), -ge... | output | 1 | 9,940 | 8 | 19,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element of the array is 1 if there is a heater in the ... | instruction | 0 | 9,941 | 8 | 19,882 |
Tags: greedy, two pointers
Correct Solution:
```
import sys
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n,r = inpl()
a = inpl()
b = [False] * n
res = 0
for i in range(n):
if b[i]: continue
for j in range(-r+1,r)[::... | output | 1 | 9,941 | 8 | 19,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,942 | 8 | 19,884 |
Yes | output | 1 | 9,942 | 8 | 19,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,943 | 8 | 19,886 |
Yes | output | 1 | 9,943 | 8 | 19,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,944 | 8 | 19,888 |
Yes | output | 1 | 9,944 | 8 | 19,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,945 | 8 | 19,890 |
Yes | output | 1 | 9,945 | 8 | 19,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,946 | 8 | 19,892 |
No | output | 1 | 9,946 | 8 | 19,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,947 | 8 | 19,894 |
No | output | 1 | 9,947 | 8 | 19,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,948 | 8 | 19,896 |
No | output | 1 | 9,948 | 8 | 19,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova's house is an array consisting of n elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The i-th element... | instruction | 0 | 9,949 | 8 | 19,898 |
No | output | 1 | 9,949 | 8 | 19,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* Let the red-green tower consist of n levels, the... | instruction | 0 | 10,344 | 8 | 20,688 |
Tags: dp
Correct Solution:
```
# by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
from collections import Counter
def main():
mod = 10**9+7
r,g = map(int,input().split())
n = 1
while r+g >= (n*(n+1))//2:
n += 1
n -= 1
tot = n*(n+1)... | output | 1 | 10,344 | 8 | 20,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* Let the red-green tower consist of n levels, the... | instruction | 0 | 10,345 | 8 | 20,690 |
Tags: dp
Correct Solution:
```
"""
#If FastIO not needed, used this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
import bisect
from types import GeneratorType
BUFSIZE = 8192
class SortedList:
def __init__(self... | output | 1 | 10,345 | 8 | 20,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* L... | instruction | 0 | 10,346 | 8 | 20,692 |
No | output | 1 | 10,346 | 8 | 20,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* L... | instruction | 0 | 10,347 | 8 | 20,694 |
No | output | 1 | 10,347 | 8 | 20,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* L... | instruction | 0 | 10,348 | 8 | 20,696 |
No | output | 1 | 10,348 | 8 | 20,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules:
* Red-green tower is consisting of some number of levels;
* L... | instruction | 0 | 10,349 | 8 | 20,698 |
No | output | 1 | 10,349 | 8 | 20,699 |
Provide a correct Python 3 solution for this coding contest problem.
Matryoshka
Matryoshka is a famous Russian folk craft doll. Matryoshka can be divided into upper and lower parts, and when opened, there is another smaller doll inside. The nesting structure is such that when the small doll that appears is opened, a ... | instruction | 0 | 11,597 | 8 | 23,194 |
"Correct Solution:
```
import heapq
class MinCostFlow:
class Edge:
def __init__(self,to,cap,rev,cost):
self.to = to
self.cap = cap
self.rev = rev
self.cost = cost
def __init__(self,n,inf=1000000007):
self.n = n
self.inf = inf
self... | output | 1 | 11,597 | 8 | 23,195 |
Provide a correct Python 3 solution for this coding contest problem.
Matryoshka
Matryoshka is a famous Russian folk craft doll. Matryoshka can be divided into upper and lower parts, and when opened, there is another smaller doll inside. The nesting structure is such that when the small doll that appears is opened, a ... | instruction | 0 | 11,598 | 8 | 23,196 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
from heapq import heappush, heappop
class MinCostFlow:
INF = 10**18
def __init__(self, N):
self.N = N
self.G = [[] for i in range(N)]
def add_edge(self, fr, to, cap, cost):
G = self.G
... | output | 1 | 11,598 | 8 | 23,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m cells). The goal of the game is to build your ... | instruction | 0 | 11,976 | 8 | 23,952 |
Tags: constructive algorithms, dfs and similar, graphs
Correct Solution:
```
#Connected component
import sys
from collections import deque
sys.setrecursionlimit(501 * 501)
n,m = [int(i) for i in input().split()]
a=[[0 for i in range(m)] for i in range(n)]
d=[(0,1),(0,-1),(1,0),(-1,0)]
q=deque()
def main():
gl... | output | 1 | 11,976 | 8 | 23,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m... | instruction | 0 | 11,977 | 8 | 23,954 |
No | output | 1 | 11,977 | 8 | 23,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m... | instruction | 0 | 11,978 | 8 | 23,956 |
No | output | 1 | 11,978 | 8 | 23,957 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
After too much playing on paper, Iahub has switched to computer games. The game he plays is called "Block Towers". It is played in a rectangular grid with n rows and m columns (it contains n × m... | instruction | 0 | 11,979 | 8 | 23,958 |
No | output | 1 | 11,979 | 8 | 23,959 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.