101363: [AtCoder]ABC136 D - Gathering Children

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $400$ points

Problem Statement

Given is a string $S$ consisting of L and R.

Let $N$ be the length of $S$. There are $N$ squares arranged from left to right, and the $i$-th character of $S$ from the left is written on the $i$-th square from the left.

The character written on the leftmost square is always R, and the character written on the rightmost square is always L.

Initially, one child is standing on each square.

Each child will perform the move below $10^{100}$ times:

  • Move one square in the direction specified by the character written in the square on which the child is standing. L denotes left, and R denotes right.

Find the number of children standing on each square after the children performed the moves.

Constraints

  • $S$ is a string of length between $2$ and $10^5$ (inclusive).
  • Each character of $S$ is L or R.
  • The first and last characters of $S$ are R and L, respectively.

Input

Input is given from Standard Input in the following format:

$S$

Output

Print the number of children standing on each square after the children performed the moves, in order from left to right.


Sample Input 1

RRLRL

Sample Output 1

0 1 2 1 1
  • After each child performed one move, the number of children standing on each square is $0, 2, 1, 1, 1$ from left to right.
  • After each child performed two moves, the number of children standing on each square is $0, 1, 2, 1, 1$ from left to right.
  • After each child performed $10^{100}$ moves, the number of children standing on each square is $0, 1, 2, 1, 1$ from left to right.

Sample Input 2

RRLLLLRLRRLL

Sample Output 2

0 3 3 0 0 0 1 1 0 2 2 0

Sample Input 3

RRRLLRLLRRRLLLLL

Sample Output 3

0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0

Input

题意翻译

给定一个长为 $n$ 的只有 $L$ 和 $R$ 的字符串 $S$ ,字符串每一个字符上都有一个点。 现在开始 $10^{100}$ 轮移动,每一轮移动,每个字符上的点按照它当前字符上的字母来决定向左还是向右移动,如果为 $L$ 则向左移动一格, $R$ 则向右移动一格。保证字符串开头字符为 $R$ ,末尾字符为 $L$ 。 输出经过 $10^{100}$ 轮移动后每个字符上点的个数。 $\ $ 对于样例一, 第一次移动后个字符上点的个数为 $0,2,1,1,1$ 第二次移动后个字符上点的个数为 $0,1,2,1,1$ 最后一次移动每个字符上点的个数 $0,1,2,1,1$

加入题单

上一题 下一题 算法标签: