
ZOJ Problem Set  3666
"Alice and Bob take turns choosing one of the numbers, and replace it with one of its positive factor but not itself. The one who makes the product of all numbers become 1 wins." Alice and Bob meet again this week, they played the game as description above last week. But Bob is so stupid that he had to spend lots of time on picking up "one of the number's factor but not itself". So Alice puts up a new game which needn't deal with the number. Here comes the problem. Alice and Bob take turns choosing one of the toys to move on the map, at the beginning of the game, they have M toys to choose. At each turn, they must choose one toy on the map, and make it move, the toy which the player chooses to move would not stay in the same place as last turn. There are N places on the map, naming 1, 2, 3, ..., N1, N, the initial places of M toys are among these 1, 2, 3, ..., N1 places, except the place N. Each of the M toys has a distinct initial place. If two different toys arrive at the same place, the operation is also valid. Finally, the place N is the terminal place. After the toy is moved to the place N, it will be eliminated from the map. Of course the eliminated toys cannot be moved again. And notice that we assume Alice takes the first turn. The one who has no toys to move is the loser. Notice that even there are toys remaining on the map, it has the possibility that the player cannot move any toys forward. The player would lose in this situation. See the Case 2 in the Sample Input section. The map is assured to be a directed acyclic graph and the map would not change in the game. As the one of the cleverest programmers in the world, you are asked to place the toys on the map (That means that you decide the value of M and the initial places of these M toys). So, you want to know that who will win in your arrangement, assuming both of them are clever enough to play this game. The number of the edges between places is no more than 100000. InputThere are multiple test cases. Each case begins with an integer N (1 ≤ N ≤ 10000) in one line. In the following N1 lines, ith(1≤ i ≤N1) line describe the places where place naming i can arrive. "C_{i} p_{1} p_{2} ... p_{Ci}" implies that the number of places i can arrive totally C_{i} places, p_{1}, p_{2}, ..., p_{Ci} respectively. Then input comes with an integer Q in one line. In the fowllowing Q(1≤ Q ≤ 100) lines, it containes an integer M(1≤ M ≤ N1) and the name of M distinct places, which are the initial places of M toys at the beginning of the game.There would not be any empty lines between cases. OutputFor each case, the output begins with "Case c:" in one line, where c indicates the case number. Then print exactly one line for each query in each test case. If the winner would be Alice, print "Alice", otherwise print "Bob". Sample Input4 2 2 3 1 4 1 4 3 1 1 1 2 2 1 2 4 2 2 3 1 4 0 2 1 3 2 3 1 10 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 3 1 1 5 1 2 3 4 5 9 1 2 3 4 5 6 7 8 9 Sample OutputCase 1: Bob Alice Alice Case 2: Bob Alice Case 3: Alice Alice Alice HintIn the query 1 of case 2, the initial place of the toy is place 3, and it cannot arrive any other places in the map. So Alice cannot move any toys on the first turn and Bob wins.Author: XU, Zhongwen Contest: ZOJ Monthly, November 2012 