33231번 - Coatis and Owls 다국어

문제

The coatis and owls have been at war for a long time already. They are preparing for battle, but given the pandemic, they also want to comply to social distancing. Therefore, they decide to do a digital battle instead, by playing the game Furious Pikemen Combat (FPC) against each other. % Or: Fighting Pikeman Championship

The game features a one-dimensional battlefield. Both players control an army, each consisting of multiple squads of pikemen. The coati army is positioned on the left and the owl army is positioned on the right. During the game, the coati army walks to the right while the owl army walks to the left. When two enemy squads meet, they fight until one of the squads is completely defeated. Since all pikemen are equal in strength, the smaller squad will lose all of its pikemen. The winning squad will lose a number of pikemen depending on the size of the winning squad ($w$) and the size of the losing squad ($l$), equal to $\left\lceil l^2 / w \right\rceil$ (where $\lceil x \rceil$ denotes rounding $x$ up to the nearest integer, or ceiling). If two squads are equal in size, they will fight until both squads are annihilated.

Consider the first sample input as an example. The two squads controlled by the coatis (of 20ドル$ pikemen) walk to the right and the squad controlled by the owls (of 33ドル$ pikemen) walks to the left. When the right-most coati squad meets the owl squad, the coati squad is completely destroyed, while the owl squad loses $\left\lceil 20^2/33 \right\rceil = 13$ pikemen. In other words, the owl squad has 20ドル$ pikemen left. The single remaining squad for both players then consists of exactly 20ドル$ pikemen, so both squads will be annihilated, resulting in a stalemate.

Calculate who wins this digital battle of FPC, and how many pikemen the army of the winning player has left after the battle.

입력

The input consists of:

• A line with two integers $n$ and $m$ (1ドル\leq n,m\leq 2\cdot 10^5$), the number of squads controlled by the coatis and the owls, respectively.
• A line with $n + m$ integers $a$ (1ドル \leq a \leq 10^4$), where each $a$ indicates the size of one squad of pikemen.

출력

If all pikemen from both armies are defeated, output "stalemate".

If one player wins the battle, output:

• A line containing either "coatis" if the coatis win the battle, or "owls" if the owls win the battle.
• A line with the number of pikemen remaining in the army of the winning player.

제한

힌트