|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|5 초||512 MB||7||3||3||42.857%|
While on a break from making the problems for Regional Finals, the South Pacific Programming Judges frequently like to play their favourite card game, Uno. In the current game, there are just two players left, Malcolm and Richard, who are trying to figure out the optimal strategy to win. In this version of Uno, each player has a hand consisting of cards, each of which has a colour: red (R), green (G), blue (B) or yellow (Y) and a numeric value 1 − 9.
The players alternate taking turns to play one card from their hand. On any turn, the card played must either be the same colour as the previous card that was played or have the same numeric value, or both (there may be duplicates of the same card). The first player who does not have any cards that can be played (nothing in their hand has the same colour or numeric value as the previous card that was played) loses. Since the judges prefer games of skill to games of chance, they have decided to play the game with a rule such that every player can see every player’s hand. It is currently Malcolms’s turn to play. Given the current card on the table (the most recently played card), determine who will win the game if both Malcolm and Richard play optimally.
The first line of input contains two integers m (1 ≤ m ≤ 1 000), which is the number of cards in Malcolm’s hand, and r (1 ≤ r ≤ 1 000), which is the number of cards in Richard’s hand.
The second line describes Malcolm’s hand. This line contains m strings describing the cards in Malcolm’s hand. Each card has a colour (either R, G, B or Y) and a numeric value (either 1, . . . , 8 or 9).
The third line describes Richard’s hand. This line contains r strings describing the cards in Richard’s hand. Each card is described in the same way as above.
The fourth line of input contains a single string which describes the most recently played card in the same way as above.
Display the winner of the game assuming both players play optimally.
3 2 B4 B5 Y2 B3 B7 B2
4 5 G1 Y3 R3 R9 B3 B9 G4 R8 Y1 R5
1 1 B1 G7 R5