message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,262 | 15 | 6,524 |
"Correct Solution:
```
from heapq import heappush, heappop
INF = 10 ** 10
direct = ((0, -1), (0, 1), (-1, 0), (1, 0))
def dist(fr, to, mp):
que = []
heappush(que, (0, fr))
visited = [[False] * len(mp[0]) for _ in range(len(mp))]
visited[fr[1]][fr[0]] = True
while que:
d, point = heappop(que)
x, y = ... | output | 1 | 3,262 | 15 | 6,525 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,263 | 15 | 6,526 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
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(): return [int... | output | 1 | 3,263 | 15 | 6,527 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,264 | 15 | 6,528 |
"Correct Solution:
```
import sys
from heapq import heappush, heappop
sys.setrecursionlimit(100000)
INF = 10 ** 10
direct = ((0, -1), (0, 1), (-1, 0), (1, 0))
def dist(fr, to, mp):
que = []
heappush(que, (0, fr))
visited = [[False] * len(mp[0]) for _ in range(len(mp))]
visited[fr[1]][fr[0]] = True
while que... | output | 1 | 3,264 | 15 | 6,529 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,265 | 15 | 6,530 |
"Correct Solution:
```
from heapq import heappush, heappop
INF = 10 ** 10
direct = ((0, -1), (0, 1), (-1, 0), (1, 0))
def dist(fr, to, mp):
que = []
heappush(que, (0, fr))
visited = [[False] * len(mp[0]) for _ in range(len(mp))]
visited[fr[1]][fr[0]] = True
while que:
d, point = heappop(que)
x, y = ... | output | 1 | 3,265 | 15 | 6,531 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,266 | 15 | 6,532 |
"Correct Solution:
```
import sys
import math
import bisect
import heapq
import copy
sys.setrecursionlimit(1000000)
from collections import deque
from itertools import permutations
dy = [-1,0,1,0]
dx = [0,1,0,-1]
def main():
m,n = 0,0
grid = []
inf = 1000000007
def in_the_grid(h,w):
return 0<... | output | 1 | 3,266 | 15 | 6,533 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,267 | 15 | 6,534 |
"Correct Solution:
```
#!/usr/bin/env python3
#AOJ F
from collections import deque
from itertools import permutations
dx = [1,0,-1,0]
dy = [0,1,0,-1]
def bfs(sy,sx):
dist = [[-1]*w for _ in range(h)]#初期化
que = deque()
que.append((sy,sx))
dist[sy][sx] = 0
while que:
y,x = que.popleft()
... | output | 1 | 3,267 | 15 | 6,535 |
Provide a correct Python 3 solution for this coding contest problem.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 × 1). There are 'clean tiles' and 'dirty tiles', and the ... | instruction | 0 | 3,268 | 15 | 6,536 |
"Correct Solution:
```
import sys
from collections import deque
d = [(1,0),(-1,0),(0,1),(0,-1)]
def bfs(sy,sx): #スタートまたは各汚れ間の最短路を計算
dist = [[-1]*w for i in range(h)]
dist[sy][sx] = 0
q = deque([(sy,sx)])
while q:
y,x = q.popleft()
for dy,dx in d:
y_ = y+dy
x_ = x+... | output | 1 | 3,268 | 15 | 6,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 ×... | instruction | 0 | 3,269 | 15 | 6,538 |
No | output | 1 | 3,269 | 15 | 6,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 ×... | instruction | 0 | 3,270 | 15 | 6,540 |
No | output | 1 | 3,270 | 15 | 6,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 ×... | instruction | 0 | 3,271 | 15 | 6,542 |
No | output | 1 | 3,271 | 15 | 6,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Here, we want to solve path planning for a mobile robot cleaning a rectangular room floor with furniture.
Consider the room floor paved with square tiles whose size fits the cleaning robot (1 ×... | instruction | 0 | 3,272 | 15 | 6,544 |
No | output | 1 | 3,272 | 15 | 6,545 |
Provide a correct Python 3 solution for this coding contest problem.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-dimensional grid. The first place you occupy is a square... | instruction | 0 | 3,277 | 15 | 6,554 |
"Correct Solution:
```
a=sorted([int(input()) for _ in [0]*int(input())])
c=b=0
for i in range(len(a)-1,-1,-1):
if a[i]<c//4:continue
else:b+=a[i]-c//4
c+=1
print(b+1)
``` | output | 1 | 3,277 | 15 | 6,555 |
Provide a correct Python 3 solution for this coding contest problem.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-dimensional grid. The first place you occupy is a square... | instruction | 0 | 3,278 | 15 | 6,556 |
"Correct Solution:
```
a=sorted([int(input()) for _ in [0]*int(input())])
c=b=0
for i in range(len(a)-1,-1,-1):
if a[i]>=c//4:b+=a[i]-c//4
c+=1
print(b+1)
``` | output | 1 | 3,278 | 15 | 6,557 |
Provide a correct Python 3 solution for this coding contest problem.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-dimensional grid. The first place you occupy is a square... | instruction | 0 | 3,279 | 15 | 6,558 |
"Correct Solution:
```
# AOJ 1502: War
# Python3 2018.7.13 bal4u
n = int(input())
ans = 1
h = [0]*126
for i in range(n):
v = int(input())
if v <= 125: h[v] += 1
ans += v
s = 0
for i in range(1, 126):
s += h[i-1]
if n > s+4*i: ans -= n-(s+4*i)
print(ans)
``` | output | 1 | 3,279 | 15 | 6,559 |
Provide a correct Python 3 solution for this coding contest problem.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-dimensional grid. The first place you occupy is a square... | instruction | 0 | 3,280 | 15 | 6,560 |
"Correct Solution:
```
# Edit: 2014/09/14
# Lang: Python3
# Time: .00s
if __name__ == "__main__":
n = int(input())
# print("n:",n)
hl = []
for i in range(n):
hl.append(int(input()))
# print(hl)
# hl = [5, 5]
# hl = [10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
# hl = [1,2,3,4,5]
... | output | 1 | 3,280 | 15 | 6,561 |
Provide a correct Python 3 solution for this coding contest problem.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-dimensional grid. The first place you occupy is a square... | instruction | 0 | 3,281 | 15 | 6,562 |
"Correct Solution:
```
n = int(input())
h_lst = sorted([int(input()) for _ in range(n)])
def solve():
ans = 1
cnt = 0
while h_lst:
for _ in range(4):
if h_lst:
add = h_lst.pop() - cnt
if add <= 0:return ans
ans += add
else:
... | output | 1 | 3,281 | 15 | 6,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-... | instruction | 0 | 3,282 | 15 | 6,564 |
No | output | 1 | 3,282 | 15 | 6,565 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two countries, Country A and Country B, are at war. As a soldier in Country A, you will lead n soldiers to occupy the territory of Country B.
The territory of Country B is represented by a two-... | instruction | 0 | 3,283 | 15 | 6,566 |
No | output | 1 | 3,283 | 15 | 6,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,565 | 15 | 7,130 |
Tags: graphs, implementation
Correct Solution:
```
from collections import Counter
t = int(input())
for h in range(t):
h = int(input())
lis = list(input())
s = set(lis)
if len(s) == 1:
print(h)
elif len(s) == 2:
if (s == {"<" , ">"}) or (s == {">" , "<"}):
print(0)
... | output | 1 | 3,565 | 15 | 7,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,566 | 15 | 7,132 |
Tags: graphs, implementation
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
import math
from decimal import *
getcontext().prec = 25
from itertools import permutations
MOD = pow(10, 9) + 7
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._f... | output | 1 | 3,566 | 15 | 7,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,567 | 15 | 7,134 |
Tags: graphs, implementation
Correct Solution:
```
def main():
t = int(input())
for _ in range(t):
n = int(input())
s = input()
if ">" not in s or "<" not in s:
print(n)
else:
s += s[0]
ans = 0
for i in range(n):
if ... | output | 1 | 3,567 | 15 | 7,135 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,568 | 15 | 7,136 |
Tags: graphs, implementation
Correct Solution:
```
def main():
n = int(input())
s = input()
s = s + s[0]
c = 0
f, b, both = 0, 0, 0
for i in range(n):
if s[i] == ">":
f = 1
elif s[i] == "<":
b = 1
if f and b:
for i in range(n):
if s... | output | 1 | 3,568 | 15 | 7,137 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,569 | 15 | 7,138 |
Tags: graphs, implementation
Correct Solution:
```
def comp(a,b):
if(a == '>' and b == '<'):
return 0
elif(a == '<' and b =='>'):
return 0
elif(a =='<' and b == '<'):
return 0
elif(a == '>' and b == '>'):
return 0
else:
return 1
for _ in range(int(input())):
... | output | 1 | 3,569 | 15 | 7,139 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,570 | 15 | 7,140 |
Tags: graphs, implementation
Correct Solution:
```
from collections import defaultdict
cases = int(input())
for _ in range(cases):
n = int(input())
belt = input()
si = 0
circle = False
while belt[si] != '<':
si = (si + 1) % n
if si == 0:
print(n)
circle... | output | 1 | 3,570 | 15 | 7,141 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,571 | 15 | 7,142 |
Tags: graphs, implementation
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
belts=input()
if '>' in belts and '<' in belts:
result=0
for i in range(n):
if belts[i]=='-' or belts[(i+1)%n]=='-':
result+=1
else:
result=n
print(re... | output | 1 | 3,571 | 15 | 7,143 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In the snake exhibition, there are n rooms (numbered 0 to n - 1) arranged in a circle, with a snake in each room. The rooms are connected by n conveyor belts, and the i-th conveyor belt connects the rooms i and (i+1) mod n. In the other word... | instruction | 0 | 3,572 | 15 | 7,144 |
Tags: graphs, implementation
Correct Solution:
```
def testcase():
n = int(input())
s = input()
vi = [False for _ in s]
for i in range(n):
if s[i] == '-':
vi[i] = True
vi[(i + 1) % n] = True
if '>' not in s:
for i in range(n):
if s[i] == '<':
... | output | 1 | 3,572 | 15 | 7,145 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0, 0), (1, 0)], [(1, 0), (1, 1)], [(1, 1), ( - 1, 1)], [( - 1, 1... | instruction | 0 | 4,500 | 15 | 9,000 |
Tags: brute force, geometry, implementation
Correct Solution:
```
x,y = map(int,input().split())
sx=sy=0
c=0
i=j=1
while(1):
p=sx
q=sy
if i%2==0:
sy=sy+((-1)**(j-1))*j
j+=1
else:
sx=sx+((-1)**(j-1))*j
if (min(p,sx)<= x and x<=max(p,sx)) and (min(q,sy)<=y and y<=max(q,sy)) and... | output | 1 | 4,500 | 15 | 9,001 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0, 0), (1, 0)], [(1, 0), (1, 1)], [(1, 1), ( - 1, 1)], [( - 1, 1... | instruction | 0 | 4,502 | 15 | 9,004 |
Tags: brute force, geometry, implementation
Correct Solution:
```
def main():
x, y = map(int, input().split())
r, t = max(abs(x), abs(y)), 0
if x == r == 1 - y:
t = 4
elif x == r > -y:
t = 3
elif y == r > x:
t = 2
elif -x == r > y:
t = 1
print({(0, 0): 0, (1, ... | output | 1 | 4,502 | 15 | 9,005 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0, 0), (1, 0)], [(1, 0), (1, 1)], [(1, 1), ( - 1, 1)], [( - 1, 1... | instruction | 0 | 4,504 | 15 | 9,008 |
Tags: brute force, geometry, implementation
Correct Solution:
```
from math import floor
def main(xx, yy):
if xx == 0 and yy == 0:
return 0
if xx == 1 and yy == 0:
return 0
x = 0
y = 0
i = 0
g = [(1, 0), (0, 1), (-1, 0), (0, -1)]
while not (x == xx and y == yy):
prev... | output | 1 | 4,504 | 15 | 9,009 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0, 0), (1, 0)], [(1, 0), (1, 1)], [(1, 1), ( - 1, 1)], [( - 1, 1... | instruction | 0 | 4,506 | 15 | 9,012 |
Tags: brute force, geometry, implementation
Correct Solution:
```
'''l = [[(0, 0), (1, 0)],
[(1, 0), (1, 1)],
[(1, 1), (-1, 1)],
[(-1, 1), (-1, -1)],
[(-1, - 1), (2, -1)],
[(2, -1), (2, 2)]]
'''
'''
pattern er shudhone na paria
last e net theke copy marcha
pattern copy marcha re.
'''
x,y = map(... | output | 1 | 4,506 | 15 | 9,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Valera the horse lives on a plane. The Cartesian coordinate system is defined on this plane. Also an infinite spiral is painted on the plane. The spiral consists of segments: [(0, 0), (1, 0)], [(1, 0), (1, 1)], [(1, 1), ( - 1, 1)], [( - 1, 1... | instruction | 0 | 4,507 | 15 | 9,014 |
Tags: brute force, geometry, implementation
Correct Solution:
```
m,n = map(int,input().split())
x = 1
y = 0
count = 0
# print(0,0)
if 0<=m<=1 and n == 0:
print(0)
else:
while True:
a1,a2 = x,y
b1,b2 = a1,abs(a2)+1
if (a1 == m and a2 < n<=b2):
count+=1
break
e... | output | 1 | 4,507 | 15 | 9,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,751 | 15 | 9,502 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
n,d = map(int,input().split())
s = input()
dp = [100000]*n
dp[0] = 0
for i in range(n):
if s[i] == '1':
for j in range(max(0,i-d),i):
dp[i] = min(dp[i],dp[j]+1)
print([-1,dp[n-1]][dp[n-1]!=100000])
``` | output | 1 | 4,751 | 15 | 9,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,752 | 15 | 9,504 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
n, d = map(int, input().split())
s = input()
nodes = [i for i in range(n) if s[i] == '1']
best = [None] * len(nodes)
def find_best(node_idx):
if best[node_idx]:
return best[node_idx]
if node_idx == len(nodes) - 1:
return... | output | 1 | 4,752 | 15 | 9,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,753 | 15 | 9,506 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
from queue import Queue
BigNum = 10 ** 10
n, d = map(int, input().split(' '))
gs = [False] + [c == '1' for c in input()]
ds = [BigNum] * len(gs)
q = Queue()
q.put((1, 0))
while not q.empty():
v, dist = q.get()
if not gs[v]:
conti... | output | 1 | 4,753 | 15 | 9,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,754 | 15 | 9,508 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
n,d = list(map(int,input().split()))
word = input()
if "0"*d in word:
print(-1)
else:
cnt=0
i=0
while i<n-1:
if word[i]=="1":
i+=d
cnt+=1
else:
i-=1
print(cnt)
``` | output | 1 | 4,754 | 15 | 9,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,755 | 15 | 9,510 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
n,d = [int(x) for x in input().split()]
s=input()
ptr=d
jump=0
flag=0
frog=0
while flag==0 and frog!=n-1:
c=0
while s[ptr]=='0':
ptr-=1
c+=1
if c==d:
flag=1
break
else:
jump+=1
frog=ptr
if ptr+d<n:
ptr+=d
else:
ptr=n-1
if ... | output | 1 | 4,755 | 15 | 9,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,756 | 15 | 9,512 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
line = input()
pui = line.split()
n = int(pui[0])
d = int(pui[1])
st = input()
pos = 1
j = 0
while True :
temp = False
i = pos + d
if i >= n :
j = j+1
temp = True
break
while i != pos :
if st[i-1]... | output | 1 | 4,756 | 15 | 9,513 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,757 | 15 | 9,514 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
a,b=map(int,input().split())
s=list(int(i) for i in input())
p=[0 for i in range(a)]
#print(s)
for i in range(a):
if (i==0) or (i!=0 and s[i]>1):
for j in range(i+1,i+b+1):
if j>=a:
break
if s[j]... | output | 1 | 4,757 | 15 | 9,515 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A frog lives on the axis Ox and needs to reach home which is in the point n. She starts from the point 1. The frog can jump to the right at a distance not more than d. So, after she jumped from the point x she can reach the point x + a, wher... | instruction | 0 | 4,758 | 15 | 9,516 |
Tags: dfs and similar, dp, greedy, implementation
Correct Solution:
```
def Frog(n,d,arr):
index = 0
count = 0
original = 1
while index < n-1 and index != original:
if arr[index] != "1":
index -= 1
elif arr[index] == "1":
original = index
index += d
... | output | 1 | 4,758 | 15 | 9,517 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
N ignited fuses and one bomb for each are placed on a vertical H x horizontal W grid. Each fuse and bomb is placed on a pathi consisting of Li cells, and the jth cell of pathi is (pxij, pyij). Each bomb is in the last square of pathi (pxiLi,... | instruction | 0 | 4,983 | 15 | 9,966 |
"Correct Solution:
```
from collections import deque
def main():
w, h, n = map(int, input().split())
sx, sy = map(int, input().split())
sx -= 1
sy -= 1
limits = []
paths = []
bombs = set()
for _ in range(n):
line = list(map(int, input().split()))
limit = line[0]
... | output | 1 | 4,983 | 15 | 9,967 |
Provide a correct Python 3 solution for this coding contest problem.
Alternate Escape
Alice House
Alice and Bob are playing board games. This board game is played using a board with squares in rows H and columns and one frame. In this game, the upper left square of the board is set as the 1st row and 1st column, and... | instruction | 0 | 4,989 | 15 | 9,978 |
"Correct Solution:
```
from collections import deque
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
H, W, R, C = map(int, readline().split()); R -= 1; C -= 1
if H == W == 0:
return False
G0 = [[] for i in range(H*W+1)]
G1 = [[] for i in range(H*W+1)]
g = H*W
... | output | 1 | 4,989 | 15 | 9,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number between 0 and m - 1 (inclusive, each number appeared exactly once). Let's consider a coordinate system such that the OX is the ground, and the OY is... | instruction | 0 | 5,423 | 15 | 10,846 |
Tags: games, greedy, implementation
Correct Solution:
```
import heapq
def coor_neighbor(coor, dxs, dys):
x, y = coor
for dx in dxs:
for dy in dys:
yield x + dx, y + dy
def coor_bottoms(coor):
return coor_neighbor(coor, (-1, 0, 1), (-1, ))
def coor_tops(coor):
return coor_neighb... | output | 1 | 5,423 | 15 | 10,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number between 0 and m - 1 (inclusive, each number appeared exactly once). Let's consider a coordinate syste... | instruction | 0 | 5,424 | 15 | 10,848 |
No | output | 1 | 5,424 | 15 | 10,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number between 0 and m - 1 (inclusive, each number appeared exactly once). Let's consider a coordinate syste... | instruction | 0 | 5,425 | 15 | 10,850 |
No | output | 1 | 5,425 | 15 | 10,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number between 0 and m - 1 (inclusive, each number appeared exactly once). Let's consider a coordinate syste... | instruction | 0 | 5,426 | 15 | 10,852 |
No | output | 1 | 5,426 | 15 | 10,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Vasya and Petya assembled a figure of m cubes, each of them is associated with a number between 0 and m - 1 (inclusive, each number appeared exactly once). Let's consider a coordinate syste... | instruction | 0 | 5,427 | 15 | 10,854 |
No | output | 1 | 5,427 | 15 | 10,855 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Gaccho owns a field separated by W horizontal x H vertical squares. The cell in the x-th column and the y-th row is called the cell (x, y). Only one plant with a height of 0 cm is planted on the land of some trout, and nothing is planted on ... | instruction | 0 | 6,531 | 15 | 13,062 |
"Correct Solution:
```
w, h, t = map(int, input().split())
p = int(input())
c = [tuple(map(int, input().split())) for _ in range(p)]
area = [tuple(map(int, input().split())) for _ in range(h)]
print(sum([area[i[1]][i[0]] for i in c]))
``` | output | 1 | 6,531 | 15 | 13,063 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Gaccho owns a field separated by W horizontal x H vertical squares. The cell in the x-th column and the y-th row is called the cell (x, y). Only one plant with a height of 0 cm is planted on the land of some trout, and nothing is planted on ... | instruction | 0 | 6,532 | 15 | 13,064 |
"Correct Solution:
```
w, h, t = map(int, input().split())
p = int(input())
hiryo = []
for i in range(p):
x, y, t = list(map(int, input().split()))
hiryo.append([x, y, t])
hatake = [[0 for i in range(w)] for j in range(h)]
hatake_boolean = []
for i in range(h):
row = list(map(int, input().split()))
row_... | output | 1 | 6,532 | 15 | 13,065 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Gaccho owns a field separated by W horizontal x H vertical squares. The cell in the x-th column and the y-th row is called the cell (x, y). Only one plant with a height of 0 cm is planted on the land of some trout, and nothing is planted on ... | instruction | 0 | 6,533 | 15 | 13,066 |
"Correct Solution:
```
#!/usr/bin/env python3
import itertools
import math
def main():
w, h, t = map(int, input().split())
p = int(input())
fert = []
for _ in range(p):
x, y, _ = map(int, input().split())
fert.append((y, x))
stage = [list(map(int, input().split())) for _ in range(... | output | 1 | 6,533 | 15 | 13,067 |
Provide a correct Python 3 solution for this coding contest problem.
Problem
Gaccho owns a field separated by W horizontal x H vertical squares. The cell in the x-th column and the y-th row is called the cell (x, y). Only one plant with a height of 0 cm is planted on the land of some trout, and nothing is planted on ... | instruction | 0 | 6,534 | 15 | 13,068 |
"Correct Solution:
```
w, h, t = map(int, input().split())
c = [tuple(map(int, input().split())) for _ in range(int(input()))]
area = [tuple(map(int, input().split())) for _ in range(h)]
print(sum([area[i[1]][i[0]] for i in c]))
``` | output | 1 | 6,534 | 15 | 13,069 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.