|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||42||21||18||46.154%|
Alice and Bob created a new game while at the beach this summer. All they need is a set of numbered playing cards. They start by creating P piles with all cards faceup and select a non-negative number K. After that, they take turns like this:
Whoever doesn’t have more cards to remove, or whoever is forced to remove more cards than those available on a pile, loses the game.
In the figure, you can see an example with two piles and K = 1. The player to move might:
Alice has realized that Bob is very good at this game and will always win if he has the chance. Luckily, this time Alice is first to play. Is Alice able to win this game?
Given the description of the piles with all the cards and the maximum number of cards they can start to remove, your goal is to find out whether Alice can win the game if she is the first to play.
The first line contains 2 space separated integers, P, the number of piles, and K, the maximum number of cards they can start to remove on their turn. The next P lines start with an integer N, indicating the number of cards on a pile. N space separated integers follow, representing the cards on that pile from the bottom to the top.
A single string, stating “Alice can win.” or “Bob will win.”, as appropriate.
4 1 4 1 1 1 1 6 2 1 2 1 2 1 4 1 1 1 1 6 2 1 2 1 2 1
Bob will win.
2 1 1 1 3 1 2 1
Alice can win.
2 2 5 3 2 1 2 1 5 5 4 3 2 1
Alice can win.
Output 1 Explanation
The piles are the same, so Bob will always be able to mirror whatever move Alice makes.
Output 2 Explanation
Alice can start by removing 0 cards from the second pile and then 1 card from its top. Two legal moves will be possible next, Bob will make one and Alice the other.