message stringlengths 2 67k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 463 109k | cluster float64 19 19 | __index_level_0__ int64 926 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed graph consisting of n vertices and m edges. One of the vertices contains a chip. Initially the chip... | instruction | 0 | 73,050 | 19 | 146,100 |
No | output | 1 | 73,050 | 19 | 146,101 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,185 | 19 | 146,370 |
"Correct Solution:
```
#####segfunc#####
def segfunc(x, y):
return min(x,y)
#################
#####ide_ele#####
ide_ele = float("inf")
#################
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(logN)
query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
... | output | 1 | 73,185 | 19 | 146,371 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,186 | 19 | 146,372 |
"Correct Solution:
```
n,e,t=map(int,input().split())
a,f,l,c=[0]+list(map(int,input().split())),[0]*(n+1),1,int(1e18)
for i in range(1,n+1):
while 2*(a[i]-a[l])>=t:
c=min(c,f[l-1]-2*a[l])
l+=1
f[i]=min(f[l-1]+t,c+2*a[i])
print(f[n]+e)
``` | output | 1 | 73,186 | 19 | 146,373 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,187 | 19 | 146,374 |
"Correct Solution:
```
import sys
from bisect import bisect, bisect_left
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.INF = 10 ** 18
self.tree = [self.INF] * (n + 1)
def get_min(self, i):
s = self.INF
while i > 0:
s = min(s, self.tree[... | output | 1 | 73,187 | 19 | 146,375 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,188 | 19 | 146,376 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from bisect import bisect_left
N,E,T = map(int,readline().split())
X = [0] + list(map(int,read().split()))
half = T//2
I = [bisect_left(X,x-half) for x in X]
INF = 10**18
def b... | output | 1 | 73,188 | 19 | 146,377 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,189 | 19 | 146,378 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
class Segtree:
def __init__(self, A, intv, initialize = True, segf = max):
self.N = len(A)
self.N0 = 2**(self.N-1).bit_length()
self.intv = intv
self.segf = segf
if initialize:
self.data = [intv]*sel... | output | 1 | 73,189 | 19 | 146,379 |
Provide a correct Python 3 solution for this coding contest problem.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear is located at x_i. The maximum moving speed of the play... | instruction | 0 | 73,190 | 19 | 146,380 |
"Correct Solution:
```
"""
Writer: SPD_9X2
https://atcoder.jp/contests/agc007/tasks/agc007_d
まぁdpだよね
選択は
1.前の奴から引き継ぐ
2.新たに始める
の2択か？
ABCDの4つを同時に回収するとき
Aアメ→Dコインまでの時間は
max(3*(D-A),T+D-A)
待ち時間がちょうどないくらいが望ましいはず
すなわち、2*(D-A)と Tの差が小さくなるように選ぶべき？
左から歩いて行き、毎回止まって待つ場合
時間はE+NTである
ここからどれだけ減らせるかを基準に考えてみよう
T以内にx個追加で回ってこれた場合、減少す... | output | 1 | 73,190 | 19 | 146,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear... | instruction | 0 | 73,191 | 19 | 146,382 |
No | output | 1 | 73,191 | 19 | 146,383 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear... | instruction | 0 | 73,192 | 19 | 146,384 |
No | output | 1 | 73,192 | 19 | 146,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear... | instruction | 0 | 73,193 | 19 | 146,386 |
No | output | 1 | 73,193 | 19 | 146,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Imagine a game played on a line. Initially, the player is located at position 0 with N candies in his possession, and the exit is at position E. There are also N bears in the game. The i-th bear... | instruction | 0 | 73,194 | 19 | 146,388 |
No | output | 1 | 73,194 | 19 | 146,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi.
Sq... | instruction | 0 | 73,611 | 19 | 147,222 |
No | output | 1 | 73,611 | 19 | 147,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi.
Sq... | instruction | 0 | 73,612 | 19 | 147,224 |
No | output | 1 | 73,612 | 19 | 147,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi.
Sq... | instruction | 0 | 73,613 | 19 | 147,226 |
No | output | 1 | 73,613 | 19 | 147,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n balls. They are arranged in a row. Each ball has a color (for convenience an integer) and an integer value. The color of the i-th ball is ci and the value of the i-th ball is vi.
Sq... | instruction | 0 | 73,614 | 19 | 147,228 |
No | output | 1 | 73,614 | 19 | 147,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,658 | 19 | 147,316 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
m, n = map(int, input().split())
if m == 1:
print(1)
else:
print(1/m + (m-1)/m*(n-1)/(n*m-1))
``` | output | 1 | 73,658 | 19 | 147,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,659 | 19 | 147,318 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
n,m=map(int,input().split())
if n*m==1:
print(1)
else:
print(1/n+(n-1)*(m-1)/(n*(n*m-1)))
``` | output | 1 | 73,659 | 19 | 147,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,660 | 19 | 147,320 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
# https://codeforces.com/problemset/problem/452/C
n, m = map(int, input().split())
if n*m==1:
print(1)
else:
print(1/n + (m-1)*(n-1) / ((m*n-1) * n))
``` | output | 1 | 73,660 | 19 | 147,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,661 | 19 | 147,322 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
def main():
n, m = map(int, input().split())
if n == 1 == m:
res = 1.
else:
res = (2 * n * m - n - m) / (n * m - 1) / n
print('{:.16f}'.format(res))
if __name__ == '__main__':
main()
``` | output | 1 | 73,661 | 19 | 147,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,662 | 19 | 147,324 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
import math
import decimal
import functools
@functools.lru_cache(maxsize=None)
def factorial(n):
return math.factorial(n)
@functools.lru_cache(maxsize=None)
def binomial(k, n):
if k > n // 2:
return product(range(k + 1, n + 1)) / factori... | output | 1 | 73,662 | 19 | 147,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,663 | 19 | 147,326 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
S=str(input())
l=list(map(int, S.split(' ')))
n,m=l[0],l[1]
S=0
t=1/n
l=m*n-m-n
y=min(n,m)
z=max(n,m)
for i in range(1,y+1):
if i>1:
t=t*i*(m+1-i)*(m*n-z-i+2)*(n+1-i)/((i-1)*(i-1)*(l+i)*(n*m-i+1))
S=S*(m*n-z-i+2)/(n*m-i+1)+t
print(S)
``` | output | 1 | 73,663 | 19 | 147,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,664 | 19 | 147,328 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
def cal(m,n,i):
tot=1
for j in range(1,n-i+1):
tot=tot*(n*m-m-n+i+j)/(n*m-n+i+j)
for j in range(1,i+1):
tot=tot*(m-i+j)*(n-i+j)/(n*m-n+j)/j
return tot
n,m = input().split()
n = int(n)
m = int(m)
ans = 0
for i in range(1, min(... | output | 1 | 73,664 | 19 | 147,329 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perform the trick, he grabs n cards at random and pe... | instruction | 0 | 73,665 | 19 | 147,330 |
Tags: combinatorics, math, probabilities
Correct Solution:
```
n,m = map(float, input().split())
if n==1:print(1)
else:print((1+(n-1)*(m-1)/(n*m-1))/n)
``` | output | 1 | 73,665 | 19 | 147,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,666 | 19 | 147,332 |
Yes | output | 1 | 73,666 | 19 | 147,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,667 | 19 | 147,334 |
Yes | output | 1 | 73,667 | 19 | 147,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,668 | 19 | 147,336 |
Yes | output | 1 | 73,668 | 19 | 147,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,669 | 19 | 147,338 |
Yes | output | 1 | 73,669 | 19 | 147,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,670 | 19 | 147,340 |
No | output | 1 | 73,670 | 19 | 147,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,671 | 19 | 147,342 |
No | output | 1 | 73,671 | 19 | 147,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,672 | 19 | 147,344 |
No | output | 1 | 73,672 | 19 | 147,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Alex enjoys performing magic tricks. He has a trick that requires a deck of n cards. He has m identical decks of n different cards each, which have been mixed together. When Alex wishes to perfo... | instruction | 0 | 73,673 | 19 | 147,346 |
No | output | 1 | 73,673 | 19 | 147,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess, and so does his friend Danik.
Once they have played n games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.
Now Anton wonders, who won more games, he or... | instruction | 0 | 73,799 | 19 | 147,598 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input().upper()
if s.count('A')>s.count('D'):
print('Anton')
elif s.count('A') == s.count('D'):
print('Friendship')
else:
print('Danik')
``` | output | 1 | 73,799 | 19 | 147,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will ... | instruction | 0 | 73,824 | 19 | 147,648 |
Tags: bitmasks, brute force, dfs and similar, expression parsing, implementation
Correct Solution:
```
f = {'OR': lambda x, y: x | y, 'AND': lambda x, y: x & y, 'XOR': lambda x, y: x ^ y}
n, m = map(int, input().split())
p, u, v = [], [], []
l = {'?': n}
for i in range(n):
q, s = input().split(' := ')
if ' ' in... | output | 1 | 73,824 | 19 | 147,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will ... | instruction | 0 | 73,825 | 19 | 147,650 |
Tags: bitmasks, brute force, dfs and similar, expression parsing, implementation
Correct Solution:
```
n, m = map(int, input().split())
vars = {}
def mxor(a, b):
if a == b:
return '0'
elif (a == '0' and b == '1') or (a == '1' and b =='0'):
return '1'
elif (a == '0' and b == 'x') or (a == '... | output | 1 | 73,825 | 19 | 147,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will ... | instruction | 0 | 73,826 | 19 | 147,652 |
Tags: bitmasks, brute force, dfs and similar, expression parsing, implementation
Correct Solution:
```
f = {'OR': lambda x, y: x | y, 'AND': lambda x, y: x & y, 'XOR': lambda x, y: x ^ y}
n, m = map(int, input().split())
u, v = [], []
d = {'?': n}
for i in range(n):
q, s = input().split(' := ')
if ' ' in s:
... | output | 1 | 73,826 | 19 | 147,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Bob recently read about bitwise operations used in computers: AND, OR and XOR. He have studied their properties and invented a new game.
Initially, Bob chooses integer m, bit depth of the game, which means that all numbers in the game will ... | instruction | 0 | 73,827 | 19 | 147,654 |
Tags: bitmasks, brute force, dfs and similar, expression parsing, implementation
Correct Solution:
```
n, m = map(int, input().split())
v = [('?', '')]
temp = [(0, 1)]
d = {}
d['?'] = 0
mn, mx = '', ''
for i in range(n):
name, val = input().split(' := ')
v.append((name, val.split()))
temp.append((-1, -1)... | output | 1 | 73,827 | 19 | 147,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,884 | 19 | 147,768 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
n, m, c = map(int, input().split())
a = [0] * n
while a.count(0):
x = int(input())
if x > c // 2:
i = n - 1
while a[i] >= x:
i -= 1
a[i] = x
else:
i = 0
while a[... | output | 1 | 73,884 | 19 | 147,769 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,885 | 19 | 147,770 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
import sys
def output(n):
print(n)
sys.stdout.flush()
n, m, c = map(int, input().split())
arr = [0 for _ in range(n)]
l = -1
r = n
while 1 < r - l:
p = int(input())
if p <= (c + 1) // 2:
for i in r... | output | 1 | 73,885 | 19 | 147,771 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,886 | 19 | 147,772 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
import sys
n, m, c = map(int, input().split())
l = [0 for _ in range(n)]
for j in range(m):
p = int(input())
if p>c//2:
i = n-1
while (i>0 and p<=l[i]):
i-=1
l[i] = p
else:
i = 0
while (l[i]!=0 and i<n-1 and... | output | 1 | 73,886 | 19 | 147,773 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,887 | 19 | 147,774 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
import sys
from bisect import bisect_left, bisect_right
from itertools import *
class Antiint:
def __init__(self, i):
self.i = i
def __lt__(self, other):
return self.i > other.i
def __eq__(self... | output | 1 | 73,887 | 19 | 147,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,888 | 19 | 147,776 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
def main():
n, m, c = map(int, input().split())
middle = ((c + 1) // 2) * 2 + 1
xs = [middle for _ in range(n)]
def value(a, b):
# moving from a to b. What is the value of that?
if a > middle:... | output | 1 | 73,888 | 19 | 147,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,889 | 19 | 147,778 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
def get_int(string, n):
i = j = k = 0
for s in string:
k += 1
for s in string:
if i == n - 1:
break
if s == ' ':
i += 1
j += 1
i = 0
while j < k:
if string[j] == ' ':
break
i = 10 * i + int(string[j]... | output | 1 | 73,889 | 19 | 147,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,890 | 19 | 147,780 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
import bisect
import sys
def output(n):
print(n)
sys.stdout.flush()
n, m, c = map(int, input().split())
al = [c + 1 for _ in range(n)]
ar = [0 for _ in range(n)]
l = -1
r = n
while 1 < r - l:
p = int(input())
... | output | 1 | 73,890 | 19 | 147,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem. Refer to the Interaction section below for better understanding.
Ithea and Chtholly want to play a game in order to determine who can use the kitchen tonight.
<image>
Initially, Ithea puts n clear sheets of... | instruction | 0 | 73,891 | 19 | 147,782 |
Tags: binary search, constructive algorithms, games, greedy, interactive
Correct Solution:
```
import sys
n, m, c = map(int, input().split())
free = n
nums = [0] * n
for i in range(m):
pi = int(input())
if(pi > c//2):
current = n - 1
while(nums[current] > 0 and nums[current] >= pi and current ... | output | 1 | 73,891 | 19 | 147,783 |
Provide a correct Python 3 solution for this coding contest problem.
A Bingo game is played by one gamemaster and several players. At the beginning of a game, each player is given a card with M × M numbers in a matrix (See Figure 10).
<image>
As the game proceeds, the gamemaster announces a series of numbers one by ... | instruction | 0 | 74,127 | 19 | 148,254 |
"Correct Solution:
```
def solve():
from itertools import product
from sys import stdin
f_i = stdin
while True:
P, M = map(int, f_i.readline().split())
if P == 0:
break
bingo = []
for i in range(P):
b = []
card = list(map(... | output | 1 | 74,127 | 19 | 148,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves playing cards.
One day she was playing cards but found that the cards were mixed with some empty ones.
There are n cards numbered from 1 to n, and they were mixed with another n empty cards. She piled up the 2n ca... | instruction | 0 | 74,223 | 19 | 148,446 |
Tags: greedy, implementation
Correct Solution:
```
N = int(input())
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
getting = [0] * (N + 1)
flg = False
for i in range(N):
b = b_list[i]
getting[b] = i + 1
if flg and b_list[i - 1] != b - 1:
flg = False
if b == 1... | output | 1 | 74,223 | 19 | 148,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves playing cards.
One day she was playing cards but found that the cards were mixed with some empty ones.
There are n cards numbered from 1 to n, and they were mixed with another n empty cards. She piled up the 2n ca... | instruction | 0 | 74,224 | 19 | 148,448 |
Tags: greedy, implementation
Correct Solution:
```
from sys import stdin
from collections import deque
n = int(stdin.readline())
hand = [int(x) for x in stdin.readline().split()]
deck = [int(x) for x in stdin.readline().split()]
ind = {}
for i,x in enumerate(deck):
if x != 0:
ind[x] = i
offset = sorte... | output | 1 | 74,224 | 19 | 148,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves playing cards.
One day she was playing cards but found that the cards were mixed with some empty ones.
There are n cards numbered from 1 to n, and they were mixed with another n empty cards. She piled up the 2n ca... | instruction | 0 | 74,225 | 19 | 148,450 |
Tags: greedy, implementation
Correct Solution:
```
from sys import stdin, exit
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [0] * (n + 1)
for i in a:
p[i] = 0
for i, v in enumerate(b):
p[v] = i + 1
ans = 0
if p[1] > 0:
i = 2
wh... | output | 1 | 74,225 | 19 | 148,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves playing cards.
One day she was playing cards but found that the cards were mixed with some empty ones.
There are n cards numbered from 1 to n, and they were mixed with another n empty cards. She piled up the 2n ca... | instruction | 0 | 74,226 | 19 | 148,452 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
l = -1
r = n
moment = [0] * (n + 1)
max_post = 1
while b[(-max_post - 1)%n] != 0 and b[(-max_post - 1)%n ] + 1 == b[-max_post]:
max_post += 1
if b[-max_post] != 1:
max_post... | output | 1 | 74,226 | 19 | 148,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nauuo is a girl who loves playing cards.
One day she was playing cards but found that the cards were mixed with some empty ones.
There are n cards numbered from 1 to n, and they were mixed with another n empty cards. She piled up the 2n ca... | instruction | 0 | 74,227 | 19 | 148,454 |
Tags: greedy, implementation
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
p = [0 for i in range(n+1)]
for i in range(n):
p[b[i]] = i + 1
... | output | 1 | 74,227 | 19 | 148,455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.