{"problem":{"name":"Gathering Children","description":{"content":"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$\\-","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc136_d"},"statements":[{"statement_type":"Markdown","content":"Given is a string $S$ consisting of `L` and `R`.\nLet $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.\nThe character written on the leftmost square is always `R`, and the character written on the rightmost square is always `L`.\nInitially, one child is standing on each square.\nEach child will perform the move below $10^{100}$ times:\n\n*   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.\n\nFind the number of children standing on each square after the children performed the moves.\n\n## Constraints\n\n*   $S$ is a string of length between $2$ and $10^5$ (inclusive).\n*   Each character of $S$ is `L` or `R`.\n*   The first and last characters of $S$ are `R` and `L`, respectively.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc136_d","tags":[],"sample_group":[["RRLRL","0 1 2 1 1\n\n*   After each child performed one move, the number of children standing on each square is $0, 2, 1, 1, 1$ from left to right.\n*   After each child performed two moves, the number of children standing on each square is $0, 1, 2, 1, 1$ from left to right.\n*   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."],["RRLLLLRLRRLL","0 3 3 0 0 0 1 1 0 2 2 0"],["RRRLLRLLRRRLLLLL","0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0"]],"created_at":"2026-03-03 11:01:13"}}