problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02597 | s614784406 | Wrong Answer | n = int(input())
c = input()
r = c.count("R")
cnt = 0
for i, j in enumerate(c):
if i + 1 == r:
break
if j == "W":
cnt += 1
print(cnt)
|
p02597 | s434624158 | Wrong Answer | N = int(input())
mozi = input()
mozi2 = list(mozi)
a = len(mozi2)
num_w = mozi2.count("W"); num_r = mozi2.count("R")
list_w2 = mozi2[(a-num_w+1):]; list_w1 = mozi2[:(a-num_w+1)]
list_r2 = mozi2[(a-num_r+1):]; list_r1 = mozi2[:(a-num_r+1)]
if num_w <= num_r:
if "W" in list_w2:
print(list_w1.count("W"))
else:
print(num_w)
else:
if "R" in list_r1:
print(list_r2.count("R"))
else:
print(num_r) |
p02597 | s092508805 | Wrong Answer | import sys
N = int(input())
c = list(str(input()))
left = None # 一番左の W を記録
right = None # 一番右の R を記録
count = 0
for i in range(len(c)):
if c[i] == 'W':
left = i
if c[len(c) - 1 - i] == 'R':
right = len(c) - 1 - i
if (left is not None) and (right is not None) and (left < right):
# print(f'left{left}, right {right}')
count += 1
left = None
right = None
print(count)
|
p02597 | s181619460 | Wrong Answer | N=int(input())
S=input()
ans=0
i=0
j=N-1
while i<j:
while i<N:
if S[i]=='W':
break
else:
i+=1
while j>0:
if S[j]=='R':
break
else:
j-=1
if i<=j:
ans+=1
i+=1
j-=1
print(ans) |
p02597 | s016195692 | Wrong Answer | N=int(input())
white=0
red=0
W=list(str(input()))
if "W" not in W or "R" not in W:
print("0")
exit()
for i in range(N//2):
if W[i]=="W":
white+=1
for i in range(N//2):
if W[N-1-i]=="R":
red+=1
Z=min(white,red)
rest=abs(white-red)
Z=Z+rest
if (N/2)%1!=0:
if W[N//2+1]=="W":
Z+=1
print(Z) |
p02597 | s324634748 | Wrong Answer | N=int(input())
C=input()
from collections import Counter
count=Counter(C)
#print(count)
countR=count["R"]
countW=count["W"]
missR=0
missW=0
for i in range(N):
now=C[i]
if now=="W" and i<countW:
missW+=1
if now=="R" and i>countR:
missR+=1
# print(countR, countW)
X=min(missW, missR)
if X!=0:
ans=X+abs(missR-missW)
else:
ans=0
print(ans) |
p02597 | s638365695 | Wrong Answer | n = int(input())
c = input()
t = n
lw, rr = 0, c.count('R')
for ci in c:
swap = min(lw, rr)
wtor, rtow = max(0, lw-swap), max(0, rr-swap)
t = min(t, swap + wtor + rtow)
lw = lw + (ci == 'W')
rr = rr - (ci == 'R')
print(t)
|
p02597 | s236391905 | Wrong Answer | n = int(input())
string = input()
count = 0
for i in range(n+1):
left = string[:i]
right = string[i:]
tmp_max = max(left.count("W"), right.count("R"))
if count < tmp_max:
count = tmp_max
print(count) |
p02597 | s550308906 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
n2 = n//2
c = input()
if c.count("R") == n:
print(0)
else:
cnt = c.count("R", n2, n)
print(cnt) |
p02597 | s888314830 | Wrong Answer | N = int(input())
S = input()
count = N
for i in range(1, N):
numW = S[:i].count('W')
numR = S[i:].count('R')
if(max(numW, numR) < count):
count = max(numW, numR)
print(count)
|
p02597 | s462143030 | Wrong Answer | K = int(input())
if K % 2 == 0 or K % 5 ==0:
print(-1)
exit()
else:
n = 7
n_before = 7
count = 0
while True:
count += 1
n = n % K
if n == 0:
print(count)
exit()
else:
n_before = 10 * n_before % K
n = n + n_before
print(count)
|
p02597 | s451559295 | Wrong Answer | #D
import re
N=int(input())
c = (input())
combi=re.findall("WR",c)
print(len(combi)) |
p02597 | s152455720 | Wrong Answer | n = int(input())
stone = input()
red_stone = stone.count("R")
white_stone = n - red_stone
left_red_stone = stone[:red_stone].count("R")
right_white_stone = stone[white_stone:].count("W")
if left_red_stone == red_stone:
print(0)
elif left_red_stone <= right_white_stone:
print(red_stone-left_red_stone)
else:
print(white_stone-right_white_stone) |
p02597 | s009435432 | Wrong Answer | n = int(input())
c = list(input())
ans = 0
x = 0
for i in range(n):
if c[i] == "W":
if i >= 1 and c[i-1] == "R":
x = 0
x += 1
elif c[i] == "R":
if x >= 1:
ans += 1
x -= 1
else:
pass
print(ans) |
p02597 | s555409586 | Wrong Answer | n = int(input())
s = input()
cur = [0, 0]
pref = []
for i in range(n):
if s[i] == 'W':
cur[0] += 1
else:
cur[1] += 1
pref += [cur[:]]
# print(pref)
res = pref[-1][0]
for i in range(1, n):
# print(i, res)
rem = i - pref[i-1][1]
ans = rem
# print('a', ans, rem)
rightred = pref[-1][1] - pref[i-1][1]
if rightred >= rem:
ans += rightred-rem
else:
ans += rem-rightred
res = min(res, ans)
print(res) |
p02597 | s543398224 | Wrong Answer | # -*- coding: utf-8 -*-
n = int(input())
s = list(input())
if s.count("W") == 0:
print(0)
exit()
print(s[:s.count('W')].count("W")) |
p02597 | s763889994 | Wrong Answer | n = int(input())
s = input()
l_1 = []
cnt = 0
for i in s[::-1]:
if i =='R':
cnt += 1
else:
l_1.append(cnt)
l_1.reverse()
def get_res(l_1):
for i,j in enumerate(l_1):
if i+1 >= j:
return j
return len(l_1)
print(get_res(l_1)) |
p02597 | s675918600 | Wrong Answer | N = int(input())
altar = input().rstrip()
alter = 0
for i in range(len(altar)-1):
if altar[i]=='W' and altar[i+1]=='R': alter+=1
print(alter) |
p02597 | s958443959 | Wrong Answer | n = int(input())
li_c = input()
r_index = [i for i,x in enumerate(li_c) if x=="R"]
w_index = [i for i,x in enumerate(li_c) if x=="W"]
r_num = len(r_index)
R = r_num - len([r for r in r_index if r<1])
W = 1-len([r for r in r_index if r<1])
ans = max(R, W)
for i in range(1, n):
if li_c[i]=="R":
R -= 1
else:
W += 1
ans = min(ans, max(R, W))
print(ans) |
p02597 | s560128204 | Wrong Answer | N = int(input())
c = list(input())
if c.count('W') == 0:
print(0)
else:
if len(c)%2 == 0:
print(min(c[0:len(c)//2].count('W'), c[len(c)//2:].count('R')))
else:
print(min(c[0:len(c)//2].count('W'), c[len(c)//2+1:].count('R'))) |
p02597 | s204432210 | Wrong Answer | N = int(input())
c = input()
W = 0
R = c.count('R')
if R == 0 or W == 0:
print(0)
exit()
ans = N
t = 0
for i in range(N):
if c[i] == 'W':
W += 1
else:
R -= 1
t = max(R,W)
ans = min(ans, t)
print(ans) |
p02597 | s043885313 | Wrong Answer | N=int(input())
C=input()
C=[str(c) for c in C]
for i in range(N):
if C[i]=="R":
C=C[i:]
break
print(min(C.count("R"),C.count("W"))) |
p02597 | s076364656 | Wrong Answer | N = int(input())
C = []
for c in list(input()):
a = 0
if c == "R":
a = 1
C.append(a)
L = -1
R = N
cnt = 0
while L < R:
L += 1
if L < R:
break
if C[L] != 0:
continue
while L < R:
R -= 1
if L < R:
break
if C[R] != 1:
continue
cnt += 1
break
print(cnt)
|
p02597 | s596077900 | Wrong Answer | n=int(input())
s=input()
red=s.count('r')
print(red-s[:red].count('r')) |
p02597 | s493399678 | Wrong Answer | N = int(input())
C = input()
mid = N//2
Wcount = C.count("W", 0, mid)
print(Wcount) |
p02597 | s853102929 | Wrong Answer | from bisect import bisect_right as br
n = int(input())
c = list(input())
cFixed = [x for x in c]
cFixed.sort()
ans = 0
for i in range(n):
if c[i] != cFixed[i]:
j = br(c,"R")-1
c[i] = c[j]
c[j] = "W"
ans += 1
print(ans)
|
p02597 | s594210685 | Wrong Answer | input()
l =list(input())
cw = l.count('W')
cr = l.count('R')
if cr < cw:
ans = l[:cr].count('W')
else:
ans = l[cw:].count('R')
print(ans) |
p02597 | s647939972 | Wrong Answer | N = int(input())
list=[]
list = (str(input()))
cnt = 0
R = 0
W = 0
ans = 0
for i in range (N):
if list[i] == "R":
R += 1
W = N-R
cnt = min(R, W)
if R > W:
for i in range(cnt):
if list[N-cnt-1]=="R":
ans +=1
if R<=W:
for j in range(cnt):
if list[j] == "W":
ans +=1
print(ans)
|
p02597 | s212550371 | Wrong Answer | n = int(input())
red = []
white = []
s = input()
for i in range(n):
if s[i] == "R":
red.append(i)
else:
white.append(i)
roop_min_num = min(len(red), len(white))
res = 0
for i in range(roop_min_num):
if white[i] < red[-i]:
res += 1
print(res)
|
p02597 | s486987301 | Wrong Answer | n = int(input())
c = str(input())
# print(list(c))
import collections
a = collections.Counter(c)
t = a["W"]
# print(a)
m = min(a["W"],a["R"])
# print(m)
co = 0
for i,j in enumerate(c):
if co >=m or i>=t:
break
else:
if j == "W":
co +=1
# print(i,j)
# print(m,co)
print(min(m,co))
|
p02597 | s836732430 | Wrong Answer | num = int(input())
wr = str(input())
r_num = wr.count("R")
i_counts = [r_num]
for i in range(num):
rw_count = r_num
wr_count = 0
if wr[i] == "W":
wr_count += 1
else:
rw_count -= 1
i_count = max(wr_count, rw_count)
i_counts.append(i_count)
ans = min(i_counts)
print(ans) |
p02597 | s772689014 | Wrong Answer | from collections import Counter
N = int(input())
C = input()
l = 0
r = N - 1
cnt = 0
while l < r:
while l < r and C[l] == 'R':
l += 1
while l < r and C[r] == 'W':
r -= 1
cnt += 1
l += 1
r -= 1
d = Counter(C)
min_ = min(d['W'], d['R'])
print(min(min_, cnt))
|
p02597 | s930913898 | Wrong Answer | N=int(input())
S=str(input())
start=0
end=N-1
count=0
flag=0
while flag==0 and start<N:
if S[start]=="W":
for i in range(end,start,-1):
if i==start+1:
flag=1
if S[i]=="R":
end=i-1
start+=1
break
count+=1
else:
start+=1
print(count) |
p02597 | s993191419 | Wrong Answer | n = int(input())
string = list(input())
def change(string):
result = 0
while len(string) > 0:
while "W" in string:
if string.pop(0) == "W":
break
while("R" in string):
if string.pop(-1) == "R":
break
result += 1
return result
if string.count("R") == 0 or string.count("R") == len(string):
print(0)
elif string.index("W") not in range(0, string.count("R")):
print(0)
else:
print(change(string)) |
p02597 | s697378682 | Wrong Answer | n = input()
s = input()
L = 0
r = len(s)
cnt = 0
while True:
L = s.find('W')
if L == -1:
break
r = s.rfind('R')
if r == -1:
break
if (L > r):
break
s = s[L + 1:r].lstrip('R').rstrip('W')
cnt += 1
if L != -1 and L > r:
cnt += L + 1
print(cnt) |
p02597 | s701641148 | Wrong Answer | N = int(input())
c = list(map(str,input()))
if c.count('W') == 0 or c.count('R') == 0:
print(0)
exit()
count_W = 0
count_R = 0
for i in range(N):
if i < N/2:
if c[i] == 'W':
count_W += 1
else:
if c[i] == 'R':
count_R += 1
if count_W > count_R:
print(count_W)
else:
print(count_R)
|
p02597 | s533451277 | Wrong Answer | n = int(input())
c = input()
ans = 0
s = c.count('R')
e = n // 2
f = c.count('WR')
if f == 0:
ans = 0
elif n % 2 == 0:
sr = c.count('W',0,e)
sw = c.count('R',e,n)
if sr >= sw:
ans = sr
else:
ans = sw
else:
sr = c.count('W',0,e)
sw = c.count('R',e+1,n)
if sr >= sw:
ans = sr
else:
ans = sw
print(ans)
|
p02597 | s216960085 | Wrong Answer | N = int(input())
C = input()
w = C.count("W")
ans = min(w, N-w)
left = 0
right = N-1
while C[left] != "W" and left < N-1:
left += 1
while C[right] != "R" and 1 <= right:
right -= 1
m = 0
while left < right:
while C[left] != "W" and left < N-1:
left += 1
while C[right] != "R" and 1 <= right:
right -= 1
m += 1
left += 1
right -= 1
print(min(ans, m)) |
p02597 | s894504809 | Wrong Answer | n = int(input())
cl = input()
print(min(cl[:n//2].count('W'), cl.count('W'), cl.count('R')))
|
p02597 | s073728135 | Wrong Answer | n = int(input())
s = input()
nw = len(s.replace('R',''))
nr = n - nw
tmp_w = 0
ret = n
w_left = 0
for i, c in enumerate(s):
if c == 'W':
w_left += 1
r_right = nr + w_left - i - 1
ret = min(ret, max(r_right, w_left))
print(ret)
|
p02597 | s200653008 | Wrong Answer | import sys
import math
n = 8
c = list('WRWRRWWR')
ans = 0
left, right = 0, n-1
while(left < right):
while(c[left] == 'R'):
left += 1
if left >= n:
break
while(c[right] == 'W'):
right -= 1
if right < 0:
break
if (left < right):
c[left], c[right] = c[right], c[left]
ans += 1
else:
break
print(ans) |
p02597 | s870087874 | Wrong Answer | N=int(input())
c=input()
mid=len(c)//2
rl=c[mid:].count('R')
wf=c[:mid].count('W')
if rl<wf:
print(rl)
else:
print(wf) |
p02597 | s004661120 | Wrong Answer | ans = 0
n = int(input())
c = input()
print(c)
check = c[0]
count = 0
flag=0
for i in c:
if(i=="R"):
count+=1
for i,k in enumerate(c):
print(check,k)
if check=="W" and k=="R":
ans+=1
check = "W"
if i<count:
flag+=1
else:
check = k
print(ans-flag)
|
p02597 | s577608734 | Wrong Answer | N = int(input())
c = list(map(str,input()))
if c.count('W') == 0 or c.count('R') == 0:
print(0)
exit()
count_W = 0
count_R = 0
for i in range(N):
if i < N/2:
if c[i] == 'W':
count_W += 1
else:
if c[i] == 'R':
count_R += 1
if count_W < count_R:
print(count_W)
else:
print(count_R)
|
p02597 | s092209943 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
N = int(input())
word = input()
count = 0
res = 0
if word[0] == 'R':
is_red = True
else:
is_red = False
count_white = 0
count_red = 0
for i in range(N):
if i < N // 2 and word[i] == 'W':
count_white += 1
elif i >= N // 2 and word[i] == 'R':
count_red += 1
res = min(count_white, count_red)
print(res)
|
p02597 | s800502622 | Wrong Answer | n = int(input())
s = input()
a = [c for c in s]
ans = 0
t1 = a.count('W')
t2 = a.count('R')
ans += (t1*t2)//n
if(ans != 0):
ans += 1
print(ans) |
p02597 | s241010715 | Wrong Answer | n = int(input())
s = input()
l = 0
r = n-1
ans = 0
while(True):
while(s[l]=='R' and l<n-1):
l+=1
while(s[r]=='W' and r<0):
r-=1
if l < r:
ans += 1
l += 1
r -= 1
else:
break
print(ans) |
p02597 | s172151996 | Wrong Answer | c = list(input())
# print(c)
R_c = c.count('R')
ans = 0
# W_c = c.count('W')
# print(R_c,W_c)
for i in range(R_c):
if c[i]=='W':
ans += 1
print(ans) |
p02597 | s793200669 | Wrong Answer | N = int(input())
S = input()
Cnt = 0
if S == "W"*N:
print(0)
else:
for i in range(N//2):
if S[i] == "W":
Cnt += 1
print(Cnt) |
p02597 | s334603534 | Wrong Answer | N=int(input())
C=input()
from collections import Counter
count=Counter(C)
#print(count)
countR=count["R"]
countW=count["W"]
missR=0
missW=0
for i in range(N):
now=C[i]
if now=="W" and i<countW:
missW+=1
if now=="R" and i>countR:
missR+=1
# print(countR, countW)
ans=min(missW, missR)+abs(missR-missW)
print(ans) |
p02597 | s164941482 | Wrong Answer | n = int(input())
s = input()
res = 0
tem = s.find('WR')
if tem == -1:
print(res)
else:
i, j = 0, len(s)-1
while i<=j:
while i <= j and s[i] != 'W': i+=1
while i <= j and s[j] != 'R':j -= 1
if s[i] == 'W' and s[j] == 'R':
res += 1
i += 1
j -= 1
print(res)
|
p02597 | s550786864 | Wrong Answer | n = int(input())
c = input()
r_num = c.count("R")
for i in range(n):
if c[i] == "W":
break
print(max(c[i:].count("R")-c[:r_num].count("R"), 0))
|
p02597 | s393650778 | Wrong Answer | n = int(input())
c = input()
y = (n + 1) // 2
x = 0
for i in range(y):
if c[i] == "W":
x += 1
print(x) |
p02597 | s826789389 | Wrong Answer | from collections import deque
N = int(input())
C = deque(input())
ans = 0
while len(C)>1:
a,b = C.popleft(), C.popleft()
if b=="R" and a=="W":
C.appendleft("W")
ans += 1
C.appendleft(b)
print(ans) |
p02597 | s930021282 | Wrong Answer | import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
n = int(readline())
s = readline().rstrip().decode('utf-8')
#全白
res = s.count("R")
ans = min(res,len(s)-res)
count = 0
res = 0
for i in range(n-1,-1,-1):
if count and s[i] == "W":
res += count
count = 0
elif s[i] == "R":
count += 1
ans = min(ans,res)
print(ans) |
p02597 | s537053780 | Wrong Answer | N = int(input())
stones = input()
count_R = stones.count('R')
if N == count_R:
answer = 0
elif N - count_R >= count_R:
answer = count_R
else:
answer = count_R - 1
print(answer)
|
p02597 | s047111910 | Wrong Answer | from heapq import heappop
def main():
N = int(input())
S = input()
W = []
R = []
ans = 0
for i,s in enumerate(S):
if s == 'W':
W.append(i)
else:
R.append(-i)
while (W and R):
l = heappop(W)
r = -heappop(R)
if l <= r:
ans += 1
else:
break
print(ans)
if __name__ == "__main__":
main() |
p02597 | s879734195 | Wrong Answer | n = int(input())
c = input()
h = (n + 1) // 2
print(min(c[:h].count('W'), c[h:].count('R'))) |
p02597 | s669052211 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
n2 = n//2
c = input()
if c.count("R") == n:
print(0)
elif n%2 == 0:
cnt = c.count("R", n2, n)
print(cnt)
else:
cnt = c.count("R", n2+1, n)
print(cnt) |
p02597 | s071267338 | Wrong Answer | n = int(input())
A = input()
a = A.count('W')
b = A.count('R')
c = A[:n//2]
d = A[n//2:]
e = c.count('W')
f = d.count('R')
g = max(e,f)
print(min(a,b,g)) |
p02597 | s649968884 | Wrong Answer | n = int(input())
c = input()
c = list(c)
r = 0
w = 0
for i in range(n):
if c[i] == 'R':
r += 1
else:
w += 1
ans = min(r,w)
t = 0
for i in range(ans):
if c[i] == 'R':
t -= 1
ans = ans + t
print(ans) |
p02597 | s990038870 | Wrong Answer | N = int(input())
S = input()
countW = S.count('W')
leftW = S[:countW].count('W')
rightR = S[countW:].count('R')
print(max(leftW, rightR)) |
p02597 | s534117840 | Wrong Answer | n = int(input())
c = list(input())
cnt = 0
start = False
for i in range(1,n-1):
if c[i] + c[i+1] == 'WR':
cnt+=1
start = True
elif c[i] + c[i+1] == 'RR' and start:
cnt+=1
else:
start = False
if c[0]+c[1] == 'WR' and cnt ==0:
cnt+=1
allw =0
for i in c:
if i == 'W':
allw+=1
if cnt<allw:
print(cnt)
else:
print(allw) |
p02597 | s709553073 | Wrong Answer | n = int(input())
c = input()
cnt1 = 0
for v in c[: n // 2 + 1]:
if v == "W":
cnt1 += 1
print(cnt1)
|
p02597 | s424088314 | Wrong Answer | N = int(input())
stones = list(input())
W_left = 0
W_right = 0
R = 0
count = 0
for i in range(N // 2):
if stones[i] == 'W':
W_left += 1
for j in reversed(range(N)):
if stones[j] == 'R':
if W_left > 0:
count += 1
W_left -= 1
else:
R += 1
elif stones[j] == 'W' and R > 0:
W_right += 1
if W_right > count:
print(count + R)
else:
print(count)
|
p02597 | s013911443 | Wrong Answer | N=int(input())
rw=input()
count=0
s=len(rw)
i=0
j=s-1
while i<=j:
while (rw[i]=='R' and i<s-1):
i+=1
while (rw[j]=='W' and j>0):
j-=1
if rw[i]=='W' and rw[j]=='R':
count+=1
i+=1
j-=1
print(count)
|
p02597 | s194188290 | Wrong Answer | N = int(input())
s = input() #s_1 s_2を分割して取得し、sに値を入れる
count_white = 0
white_flag = 0
white_renzoku = 0
count_red = 0
red_flag = 0
red_renzoku = 0
for i in range(int(N/2)):
if s[i]=='W':
count_white = count_white+1
if s[N-1-i]=='R':
count_red = count_red+1
white_irekae = count_white
red_irekae = count_red
if white_irekae >= red_irekae:
print(white_irekae)
else:
print(red_irekae) |
p02597 | s911891981 | Wrong Answer | N = int(input())
list=[]
list = (str(input()))
cnt = 0
for i in range(N-1):
if list[i] == 'W':
for j in range(N-1):
if list[N-j-1] == 'R' and (N-j-1) > i:
cnt +=1
break
ans = cnt
for k in range (cnt-1):
if list[N-k-1] == 'W':
ans -= 1
print(ans)
|
p02597 | s616912354 | Wrong Answer | N = int(input())
seq = input()
left = 0
right = N-1
c = 0
for _ in range(int(N/2)+1):
if left >= N or right < 0:
break
if seq[left] == "R":
left += 1
continue
if seq[right] == "W":
right -= 1
continue
left += 1
right -= 1
c += 1
print(c) |
p02597 | s011347487 | Wrong Answer | def main():
input() # n
stones = input()
white_counter = []
white_stones = 0
red_stones = 0
for color in stones:
if color == 'W':
white_stones += 1
else:
red_stones += 1
white_counter.append(white_stones)
print(white_counter[red_stones - 1])
if __name__ == '__main__':
main()
|
p02597 | s439051970 | Wrong Answer | ma = lambda :map(int,input().split())
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
n = ni()
cs = input()
r = cs.count("R")
print(cs[:r].count("R"))
|
p02597 | s459517991 | Wrong Answer | n=int(input())
c=input()
n_R=c.count('R')
n_W=0
temp=n_R
ans=1000000007
for i in range(n):
if c[i]=='W':
n_W+=1
else:
n_R-=1
temp=max(n_W,n_R)
ans=min(temp,ans)
ans=min(ans,c.count('W'))
print(ans)
|
p02597 | s656336293 | Wrong Answer | N = int(input())
S = input()
prev = S[0]
cur = 'R'
count = 0
wNum = 0
changedPoint = 0
for i in range(N-1, -1, -1):
cur = S[i]
if cur == 'R':
for j in range(wNum, i):
if S[j] == 'W':
wNum = j + 1
changedPoint = j
break
if wNum != 0:
count += 1
prev = cur
if changedPoint >= i:
break
print(count)
|
p02597 | s254501155 | Wrong Answer | N = int(input())
A = list(input())
a = 0
B = []
for i in range(N):
if A[i] == 'W':
a += 1
B.append(a)
if a >= N - a:
ans = min(N - a, B[N - a])
else:
ans = min(a, B[a])
print(ans) |
p02597 | s437769631 | Wrong Answer | n=int(input())
a=list(input())
b=0
c=0
d=0
for i in range(-1,-(n+1),-1):
if a[i]=="R":
c=i+n
break
for i in range(c,n):
if a[i]=="W":
d+=1
for i in range(len(a)):
if a[i]=="W":
b=i
break
del a[:b]
print(min(d,a.count("R")))
|
p02597 | s133760229 | Wrong Answer | def checkFunction(c):
count = 0
while True:
# print(count, c)
if not ('WR' in c):
return count
while c[0] == 'R':
c = c[1:]
while c[-1] == 'W':
c = c[:-1]
if c.index('R') == len(c) - 1:
return count + 1
else:
c = c.replace('WR', 'RR',1)[:-1]
count += 1
N = int(input())
c= input()
print(checkFunction(c))
|
p02597 | s086941630 | Wrong Answer | a = int(input())
s = input()
ns = a//2
new = s[0:ns]
ans = 0
for i in range(ns):
if s[i] == 'W':
ans += 1
print(ans) |
p02597 | s347504260 | Wrong Answer | N=int(input())
c=list(input())
R=c.count('R')
W=0
ans=10**10
for i in range(N):
if c[i]=='W':
W+=1
else:
R-=1
ans=min(ans,max(W,R))
print(ans) |
p02597 | s906022406 | Wrong Answer | n = int(input())
c = str(input())
# c = [1 if i == 'R' else 0 for i in input()]
cnt = 0
while 'WR' in c:
c = c.replace('WR', 'RR', 1)
idx = c.rfind('R')
c = c[:idx]
cnt += 1
print(cnt) |
p02597 | s160290566 | Wrong Answer | n = int(input())
c = input()
wi = c.find('W')
ri = c.rfind('R')
if wi == -1 or ri == -1:
print(0)
else:
ans = 0
while wi < ri:
wi += 1
wi = c[wi:].find('W')
ri = c[:ri].rfind('R')
ans += 1
print(ans, c) |
p02597 | s671209084 | Wrong Answer | N = int(input())
S = input()
countW = S.count('W')
if countW==0:
print(0)
exit()
if countW==N:
print(0)
exit()
leftW = S[:countW].count('W')
rightR = S[countW:].count('R')
print(max(leftW, rightR)) |
p02597 | s689526042 | Wrong Answer | n = int(input())
c = input()
count = 0
while "wr" in c:
c = c.replace("w", "r", 1)
c = c.replace("wr", "ww", 1)
count += 1
print(count) |
p02597 | s713496441 | Wrong Answer | n = int(input())
line = list(input())
if 'W' not in line or 'R' not in line:
print(0)
else:
a = line.index('R')
w = line[:a].count('W')
r = line[a+1:].count('R')
plan1 = abs(w-r)+min(w,r)
plan2 = min(line.count('W'),line.count('R'))
print(min(plan1,plan2)) |
p02597 | s592489221 | Wrong Answer | N=int(input())
ls=list(input())
left=0
right=N-1
count=0
while True:
while left<N and ls[left]=='R':
left+=1
while right>0 and ls[right]=='W':
right-=1
if left>right:
break
left+=1
right-=1
count+=1
print(count) |
p02597 | s921979028 | Wrong Answer | n = int(input())
A = list(input())
if A.count('R')==n:
print(0)
elif A.count('W')==n:
print(0)
else:
w = A[:0].count('W')
r = A[0:].count('R')
mini = min(w,r)
for i in range(1,n-1):
if A[i] == 'W':
w += 1
mini = min(w,r)
else:
r -= 1
mini = min(w,r)
print(mini) |
p02597 | s779732663 | Wrong Answer | n = int(input())
c = input()
ans = 0
for i in range(1, len(c)//2+1):
s = "W" * i + "R" * i
num = c.count(s)
if num == 0:
break
else:
ans += num
print(ans)
|
p02597 | s490617094 | Wrong Answer | N = int(input())
c = input()
ans = 0
fs = 0
ls = N - 1
for _ in range(N):
for i, ci in enumerate(c[fs:ls]):
if ci == 'W':
break
fs += 1
for i , ci in enumerate(c[fs:ls:-1]):
if ci == 'R':
break
ls -= 1
if fs >= ls:
break
ans += 1
fs += 1
ls -= 1
#print(c[fs:ls] + 1)
if len(c[fs:ls + 1]) <= 1:
break
print(ans)
|
p02597 | s065598742 | Wrong Answer | import sys
n = int(input())
c = list(input())
pos_w=0
pos_r=n-1
count = 0
for i in range(pos_w, n):
if c[i] != 'W':
continue
pos_w = i
for j in range(pos_r, -1, -1):
if c[j] != 'R':
continue
pos_r = j
if pos_w > pos_r:
print(count)
sys.exit()
c[i] = 'R'
c[j] = 'W'
count += 1
break |
p02597 | s714636548 | Wrong Answer | n = int(input())
stone = input()
s = list(stone)
score = 0
if 'W' not in stone:
print(0)
exit()
else:
for i in range (n-1):
if (s[i] == "W") and (s[i+1] == "R"):
s[i], s[i+1] = s[i+1], s[i]
score += 1
print(score) |
p02597 | s558232669 | Wrong Answer | n = int(input())
C = input()
A = [0]*(n+1)
cnt = 0
for i, c in enumerate(C):
if c == "R":
cnt += 1
A[i+1] = 1
A[i+1] += A[i]
ans = float("inf")
for i in range(1, n+1):
W_l = i - A[i]
R_r = cnt - A[i]
temp = min(W_l, R_r) + abs(W_l-R_r)
ans = min(ans, temp)
print(ans) |
p02597 | s438683326 | Wrong Answer | n=int(input())
a=list(input())
# あかのインデックス
RR=[-1]
# しろのインデックス
WW=[]
for i in range(n):
if a[i]=='R':
RR.append(i)
else:
WW.append(i)
WW.append(float('inf'))
if a.count('R')==0 or a.count('R')==n:
print(0)
exit()
if a.count('W')==1:
print(1)
exit()
for i in range(len(RR)-1):
if RR[-2-i]<WW[i+1]:
print(i+1)
exit() |
p02597 | s128661280 | Wrong Answer | N = int(input())
c = input()
w = []
r = []
for i, ci in enumerate(c):
if ci == 'W':
w.append(i)
if ci == 'R':
r.append(i)
# print(w, r)
answer = 0
lenw = len(w)
lenr = len(r)
while answer < min(lenr, lenw) and w[answer] < r[-answer]:
answer += 1
print(answer) |
p02597 | s191235200 | Wrong Answer | n=int(input())
s=input()
l=[0]
for i in range(n):
l.append(l[i]+(s[i]=="R"))
ans=n
print(l)
for i in range(n+1):
ans=min(ans,abs(l[i]-i)+abs(l[-1]-l[i]))
#print(ans,i)
if i==l[-1]:
ans=min(ans,abs(l[i]-i))
#print(ans)
print(ans) |
p02597 | s181482767 | Wrong Answer | N = int(input())
C = list(input())
CC = C[::-1]
RC = C.count('W')
WC = C.count('R')
ans = min(WC, RC)
XC = 0
if ans==0:
print(0)
else:
while ans > XC:
l = C.index('W')
r = CC.index('R')
if l > N-1-r:
ans = min(XC, ans)
break
C[l],C[N-1-r] = C[N-1-r],C[l]
CC[r],CC[N-l-1] = CC[N-l-1],CC[r]
XC += 1
print(ans) |
p02597 | s591965305 | Wrong Answer | N=int(input())
c=list(input())
k=0
for i in range(N):
if c[i]!='R':
k=i
break
R=c[k:].count('R')
W=c[k:k+R+1].count('W')
print(W) |
p02597 | s565050830 | Wrong Answer | N = int(input())
c = list(input())
w = c.count("W")
wr = c[w:].count("W")
print(w - wr)
|
p02597 | s625240397 | Wrong Answer | n=int(input())
c=list(input())
rc=c.count('R')
mini=min(rc,n-rc)
for i in range(n):
if c[i]=='R':
rc-=1
mini=min(mini,max(rc,n-rc))
print(mini)
|
p02597 | s187476247 | Wrong Answer | from itertools import accumulate
N = int(input())
S = list(input())
W = [0]*N
R = [0]*N
ans = N
for i in range(N):
if S[i] == "W":
W[i] = 1
else:
R[i] = 1
R.reverse()
R = list(accumulate(R))
W = list(accumulate(W))
if R[0] == 0 or W[N-1] == 0:
ans = 0
else:
sakai = R[N-1]
ans = max(W[sakai-1], R[N-sakai-1])
print(ans)
|
p02597 | s275869178 | Wrong Answer | n = int(input())
c = input()
cnt = 0
for i in range(n):
if c[i] == 'W' and i > c.find('R') and c.find('R') != -1:
r = c.find('R')
l = list(c)
l[i] = 'R'
l[r] = 'W'
cnt += 1
c = ''.join(l)
print(cnt) |
p02597 | s084238078 | Wrong Answer | N = int(input())
c = list(input())
count = 0
if len(c) % 2 == 1:
c.append('W')
l = c[0:len(c)//2]
if c.count('W') == 0 or c.count('R') == 0:
print(0)
else:
print(l.count('W'))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.