message stringlengths 2 28.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 21 109k | cluster float64 7 7 | __index_level_0__ int64 42 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,443 | 7 | 216,886 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
MOD = 10**9+7
n = int(input())
s = input()
if s[0]=="W" or s[-1]=="W":
print(0)
exit()
lr = ["L"]
for i in range(1,2*n):
if s[i-1]==s[i]:
if lr[i-1]=="L":
lr.append("R")
else:
lr.append("L")
else:
lr.append... | output | 1 | 108,443 | 7 | 216,887 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,444 | 7 | 216,888 |
"Correct Solution:
```
#各マスがちょうど 1 回ずつ選ばれる
n=int(input())
s=input()
d=[False]
for i in range(1,n*2):
d.append((s[i]==s[i-1])^d[-1])
from collections import Counter
cd =Counter(d)
if not cd[True] or cd[0]!=cd[1] or s[0]=="W":
print(0)
exit()
st=d.index(True)
l=st
ans=1;mod=10**9+7
for i in range(st,2*n):
... | output | 1 | 108,444 | 7 | 216,889 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,445 | 7 | 216,890 |
"Correct Solution:
```
from itertools import groupby
import heapq
N=int(input())
S=input()
mod=10**9+7
fact=[i for i in range(2*N+1)]
fact[0]=1
for i in range(1,2*N+1):
fact[i]*=fact[i-1]
fact[i]%=mod
inverse=[pow(fact[i],mod-2,mod) for i in range(2*N+1)]
data=["" for i in range(2*N)]
for i in range(2*N):
... | output | 1 | 108,445 | 7 | 216,891 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,446 | 7 | 216,892 |
"Correct Solution:
```
n = int(input())
S = [v for v in input()]
# determine L or R
lst = [0 for i in range(2 * n)]
for i in range(2 * n):
if S[i] == 'W' and (2 * n - i - 1) % 2 == 0:
lst[i] = 'L'
elif S[i] == 'W' and (2 * n - i - 1) % 2 == 1:
lst[i] = 'R'
elif S[i] == 'B' and (2 * n - i - ... | output | 1 | 108,446 | 7 | 216,893 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,447 | 7 | 216,894 |
"Correct Solution:
```
# c
M = 10**9+7
n = int(input())
s = input()
if (s[0] != 'B') | (s[-1] != 'B'): print(0); exit()
a = [1]+[0]*(2*n-1)
b = [0]*2*n
for i in range(1, 2*n):
if s[i] == s[i-1]:
a[i] = 1^a[i-1]
b[i] = 1^b[i-1]
else:
a[i] = a[i-1]
b[i] = b[i-1]
if (sum(a) != sum(b... | output | 1 | 108,447 | 7 | 216,895 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,448 | 7 | 216,896 |
"Correct Solution:
```
import sys
import math
from pprint import pprint
def solve(n, s):
ans = 0
if s[0] == "W" or s[2*n-1] == "W":
return ans
l_c = 0
r_c = 0
o_c = 1
mod = 10**9 + 7
for s_i in s:
if s_i == "B" and (l_c - r_c) % 2 == 0:
l_c += 1
elif s_... | output | 1 | 108,448 | 7 | 216,897 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,449 | 7 | 216,898 |
"Correct Solution:
```
import bisect
N = int(input())
S = input()
mod = 10 ** 9 + 7
small = []
large = []
for i in range(N * 2):
if S[i] == 'B':
if i % 2 == 0:
small.append(i)
else:
large.append(i)
else:
if i % 2 == 0:
large.append(i)
else:
... | output | 1 | 108,449 | 7 | 216,899 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i-th character of S is `B`, and white if that character i... | instruction | 0 | 108,450 | 7 | 216,900 |
"Correct Solution:
```
import math
N = int(input())
S = input()
mod = 10**9 + 7
left = 0
ret = 1
for i in range(len(S)):
if S[i] == 'W':
if left % 2 == 1:
left += 1
else:
if left > 0:
ret *= left
ret %= mod
left -= 1
... | output | 1 | 108,450 | 7 | 216,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,451 | 7 | 216,902 |
Yes | output | 1 | 108,451 | 7 | 216,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,452 | 7 | 216,904 |
Yes | output | 1 | 108,452 | 7 | 216,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,453 | 7 | 216,906 |
Yes | output | 1 | 108,453 | 7 | 216,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,454 | 7 | 216,908 |
Yes | output | 1 | 108,454 | 7 | 216,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,455 | 7 | 216,910 |
No | output | 1 | 108,455 | 7 | 216,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,456 | 7 | 216,912 |
No | output | 1 | 108,456 | 7 | 216,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,457 | 7 | 216,914 |
No | output | 1 | 108,457 | 7 | 216,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N squares arranged from left to right. You are given a string of length 2N representing the color of each of the squares.
The color of the i-th square from the left is black if the i... | instruction | 0 | 108,458 | 7 | 216,916 |
No | output | 1 | 108,458 | 7 | 216,917 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,491 | 7 | 216,982 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
def main():
inf = 5000
n = int(input()[:-1])
# iより前に色cのj以上が何個あるかがcnts[c][i][j]
cnts = [[[0] * (n + 1) for _ in range(2 * n + 1)] for __ in range(2)]
pos = [[0] * n for _ in range(2)]
for i in range(n * 2):... | output | 1 | 108,491 | 7 | 216,983 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,492 | 7 | 216,984 |
"Correct Solution:
```
class BIT():#1-indexed
def __init__(self, size):
self.table = [0 for _ in range(size+2)]
self.size = size
def Sum(self, i):#1からiまでの和
s = 0
while i > 0:
s += self.table[i]
i -= (i & -i)
return s
def Add(self, i, x):#
while i <= self.size:
self.table[i] += x
i += (i & -... | output | 1 | 108,492 | 7 | 216,985 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,493 | 7 | 216,986 |
"Correct Solution:
```
N = int(input())
X = [i for i in range(N+1)]
Y = [[] for _ in range(N)]
B, W = [], []
ans = 0
for i in range(2 * N):
c, a = input().split()
a = int(a) - 1
if c == "B":
X = [X[i] + 1 if i <= a else X[i] - 1 for i in range(N+1)]
B.append(a)
ans += len([b for b in... | output | 1 | 108,493 | 7 | 216,987 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,494 | 7 | 216,988 |
"Correct Solution:
```
from itertools import accumulate
def solve(n, rev):
def existence_right(rev_c):
n2 = n * 2
acc = [[0] * n2]
row = [0] * n2
for x in rev_c:
row[n2 - x - 1] += 1
acc.append(list(reversed(list(accumulate(row)))))
return acc
#... | output | 1 | 108,494 | 7 | 216,989 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,495 | 7 | 216,990 |
"Correct Solution:
```
# copy
# https://beta.atcoder.jp/contests/arc097/submissions/2509168
N = int(input())
balls = []
for _ in range(2 * N):
c, a = input().split()
balls += [(c, int(a))]
# numB[i][b]: 初期状態において、i番目の玉より右にある、1～bが書かれた黒玉の数
numB = [[0] * (N + 1) for _ in range(2 * N)]
numW = [[0] * (N + 1) for _ ... | output | 1 | 108,495 | 7 | 216,991 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,496 | 7 | 216,992 |
"Correct Solution:
```
def examC():
ans = 0
print(ans)
return
def examD():
ans = 0
print(ans)
return
# 解説AC
def examE():
N = I()
Bnum = [-1]*N
Wnum = [-1]*N
B = {}
W = {}
for i in range(2*N):
c, a = LSI()
a = int(a)-1
if c=="W":
W[i] ... | output | 1 | 108,496 | 7 | 216,993 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,497 | 7 | 216,994 |
"Correct Solution:
```
def main():
from sys import stdin
input = stdin.readline
n = int(input())
ab = [list(input().split()) for _ in [0]*(2*n)]
ab = [(a == "B", int(b)-1) for a, b in ab]
dct_b = [0]*n
dct_w = [0]*n
for i, (a, b) in enumerate(ab):
if a:
dct_b[b] = i
... | output | 1 | 108,497 | 7 | 216,995 |
Provide a correct Python 3 solution for this coding contest problem.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball. The integer written on the i-th ball from the ... | instruction | 0 | 108,498 | 7 | 216,996 |
"Correct Solution:
```
N = int(input())
MB = {}; MW = {}
for i in range(2*N):
c, a = input().split()
c = "BW".index(c); a = int(a)
if c:
MW[a-1] = i
else:
MB[a-1] = i
P = [[0]*(N+1) for i in range(N+1)]
Q = [[0]*(N+1) for i in range(N+1)]
for p in range(N):
cnt = MW[p] - sum(MW[p0]... | output | 1 | 108,498 | 7 | 216,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,499 | 7 | 216,998 |
Yes | output | 1 | 108,499 | 7 | 216,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,500 | 7 | 217,000 |
Yes | output | 1 | 108,500 | 7 | 217,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,501 | 7 | 217,002 |
Yes | output | 1 | 108,501 | 7 | 217,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,502 | 7 | 217,004 |
Yes | output | 1 | 108,502 | 7 | 217,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,503 | 7 | 217,006 |
No | output | 1 | 108,503 | 7 | 217,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,504 | 7 | 217,008 |
No | output | 1 | 108,504 | 7 | 217,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,505 | 7 | 217,010 |
No | output | 1 | 108,505 | 7 | 217,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on e... | instruction | 0 | 108,506 | 7 | 217,012 |
No | output | 1 | 108,506 | 7 | 217,013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.