Buggy python submission (verdict: Runtime Error):
def dp(i, j, s):
    for ii in range(i):
        if s[j] == "R":
            j = j +1
        else:
            j = j-1
    return j
  
s = list(input())
dic = {}
for x in range(len(s)):
    dic[x] = dp(10**1,x,s)
nwli =[0 for q in range(len(s))]
for t in range(len(s)):
    t2 = t
    for k in range(16):
        t2 = dic[t2]
    nwli[t2]+=1
print(" ".join(map(str,nwli)))
def dp(i, j, s):
    for ii in range(i):
        if s[j] == "R":
            j = j +1
        else:
            j = j-1
    return j
  
s = list(input())
dic = {}
for x in range(len(s)):
    dic[x] = dp(10**1,x,s)
nwli =[0 for q in range(len(s))]
for t in range(len(s)):
    t2 = t
    for k in range(16):
        t2 = dic[t2]
    nwli[t2]+=1
print(" ".join(map(str,nwli)))

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))

Buggy python submission (verdict: Runtime Error):
def dp(i, j, s):
    for ii in range(i):
        if s[j] == "R":
            j = j +1
        else:
            j = j-1
    return j
  
s = list(input())
dic = {}
for x in range(len(s)):
    dic[x] = dp(10**1,x,s)
nwli =[0 for q in range(len(s))]
for t in range(len(s)):
    t2 = t
    for k in range(16):
        t2 = dic[t2]
    nwli[t2]+=1
print(" ".join(map(str,nwli)))
def dp(i, j, s):
    for ii in range(i):
        if s[j] == "R":
            j = j +1
        else:
            j = j-1
    return j
  
s = list(input())
dic = {}
for x in range(len(s)):
    dic[x] = dp(10**1,x,s)
nwli =[0 for q in range(len(s))]
for t in range(len(s)):
    t2 = t
    for k in range(20):
        t2 = dic[t2]
    nwli[t2]+=1
print(" ".join(map(str,nwli)))
提出情報

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))

Buggy python submission (verdict: Time Limit Exceeded):
s = list(input())
def dp(i, j, s):
    for ii in range(i):
        if s[j] == "R":
            j = j +1
        else:
            j = j-1
    return j
dic = {}
for x in range(len(s)):
    dic[x] = dp(10**4,x,s)
nwli =[0 for q in range(len(s))]
for t in range(len(s)):
    nwli[dic[dic[t]]]+=1
print(" ".join(map(str,nwli)))

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))

Buggy python submission (verdict: Time Limit Exceeded):
s = list(input())
def move_children(RL, li):
    newli = li.copy()
    for n, rl in enumerate(RL):
        if rl == "R":
            newli[n]-=li[n]
            newli[n+1]+=li[n]
        elif rl=="L":
            newli[n]-=li[n]
            newli[n-1]+=li[n]
    return newli
nextli = [1 for i in range(len(s))]
 
for f in range(10**3):
    nextli=move_children(s,nextli)
print(" ".join(map(str,nextli)))

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))

Buggy python submission (verdict: Time Limit Exceeded):
s = list(input())
def move_children(RL, li):
    newli = li.copy()
    for n, rl in enumerate(RL):
        if rl == "R":
            newli[n]-=li[n]
            newli[n+1]+=li[n]
        elif rl=="L":
            newli[n]-=li[n]
            newli[n-1]+=li[n]
    return newli
nextli = [1 for i in range(len(s))]
 
for f in range(10**5):
    nextli=move_children(s,nextli)
print(" ".join(map(str,nextli)))

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))

Buggy python submission (verdict: Runtime Error):
s = list(input())
def move_children(RL, li):
    newli = li.copy()
    for n, rl in enumerate(RL):
        if rl == "R":
            newli[n]-=li[n]
            newli[n+1]+=li[n]
        elif rl=="L":
            newli[n]-=li[n]
            newli[n-1]+=li[n]
    return newli
pre = [1 for i in range(len(s))]

for f in range(10**5):
    counter+=1
    nextli=move_children(s,pre)

print(nextli)

Fixed submission:
s = list(input())
output = [0 for i in s]
ruiseki = 0
for p in range(len(s)):
    if s[p] == "R":
        if s[p+1] == "R":
            ruiseki+=1
        else:
            ruiseki+=1
            output[p] += ruiseki//2 + ruiseki%2
            output[p+1] += ruiseki//2
            ruiseki=0
    
ruiseki = 0
for q in range(len(s)-1, -1, -1):
    if s[q] == "L":
        if s[q-1]=="L":
            ruiseki+=1
        else:
            ruiseki+=1
            output[q] += ruiseki//2 + ruiseki%2
            output[q-1] += ruiseki//2
            ruiseki=0
print(" ".join(map(str,output)))