\(4^{th}\) round, December \(19^{th}\) 2015
On the fore\(st-fi\)lled moon of Endor there is, if we are to believe the Guinness Book of Records, the
longest stick in the whole galaxy. On that stick of \(L\) meters in length there are \(N\) cheerful chameleons.
Each chameleon is moving along the stick with constant speed of 1 \(m/s\) in one of two possible directions
(left or right) and is colored in one of the possible \(K\) colors.
It is known that the chameleons of Endor worship the ancient ant laws that dictate that the walk
along the stick must be continued until the end of the stick is reached (which means getting offit),
and when a collision with another chameleon takes place, you must turn 180 degrees and continue
the walk in the opposite direction. Additionally, after a chameleon colored in \(a\) moving to the left
collides with a chameleon colored in \(b\) moving to the right, the chameleon moving to the left before the
collision takes the color of the chameleon moving to the right before the collision (so, color \(b\)), while
the chameleon moving to the right before the collision takes a new color (\(a + b\)) mod \(K\).
If you are given the initial positions, colors and directions of movement of all the chameleons, for each
color determine the total trip taken by the chameleons in that color before getting offthe stick.

In test cases worth 50% of total points, it will additionally hold (1 ⩽\(N\) ⩽3 000).

The first line of input contains the integers \(N\), \(K\) and \(L\) (1 ⩽\(N\) ⩽100 000, 1 ⩽\(K\) ⩽40, 1 ⩽\(L\) ⩽
1 000 000) from the task. The \(i\)^{th} of the following \(N\) lines contains the integer \(d@@RISE_MATH_BLOCK_0@@i\) ⩽\(L\)) that
denotes the distance between the \(i\)^{th} chameleon and the left end of the stick, then the integer \(b_{i}\)
(0 ⩽\(b_{i}\) ⩽\(K - 1\)) that denotes the color of the \(i\)^{th} chameleon and the character ‘L’ (left) or ‘D’ (right)
that denote the direction of movement of the \(i\)^{th} chameleon. All integers \(d\)\(i\) will be unique and given
in strictly ascending order.

The output must contain \(K\) lines, the \(i\)^{th} line containing the total trip taken by the chameleons in
color \(i\).

생성자가 기록되지 않았습니다.

출처 COCI 2015/2016 Contest 4