#PU1400. USACO 2024 February Contest, Silver — Problem 3. Moorbles

USACO 2024 February Contest, Silver — Problem 3. Moorbles

USACO 2024 February Contest, Silver — Problem 3. Moorbles

题目描述

Bessie and Elsie are playing a game of Moorbles. The game works as follows: Bessie and Elsie each start out with some amount of marbles. Bessie holds out AA of her marbles in her hoof and Elsie guesses if AA is Even or Odd. If Elsie is correct, she wins the AA marbles from Bessie and if she guesses incorrectly, she loses AA of her marbles to Bessie (if Elsie has less than AA marbles, she loses all her marbles). A player loses when they lose all of their marbles. After some amount of turns in the game, Elsie has NN (1≤N≤109)(1 \leq N \leq 10^9) marbles. She thinks it is hard to win, but she is playing to not lose. After being around Bessie enough, Elsie has a good read on Bessie's habits and recognizes that on turn ii, there are only KK (1≤K≤4)(1 \leq K \leq 4) different amounts of marbles that Bessie may put out. There are only MM (1≤M≤3⋅105)(1 \leq M \leq 3 \cdot 10^5) turns before Bessie gets bored and stops playing. Can you identify a lexicographically minimum turn sequence such that Elsie will not lose, regardless of how Bessie plays?

输入格式

The first line contains a single integer TT (1≤T≤101 \leq T \leq 10) representing the number of test cases. Each test case is described as follows: First, one line containing three integers NN, MM, and KK, representing the number of marbles Elsie has, the number of turns, and the number of potential moves Bessie can make respectively. Then, MM lines where line ii contains KK distinct space separated integers ai,1  ai,2…ai,Ka_{i,1} \; a_{i,2} \ldots a_{i,K} (1≤ai,j≤1031 \leq a_{i, j} \leq 10^3) representing the possible amounts of marbles that Bessie might play on turn ii. It is guaranteed that the sum of MM over all test cases is at most 3⋅1053 \cdot 10^5.

输出格式

For each test case, output the lexicographically minimum move sequence for Elsie to guarantee not losing, or −1-1 if she will lose. The move sequence should be on a single line and consist of MM space-separated tokens each equal to either "Even" or "Odd".

数据范围

(见题面原文)

样例

样例 1

2
10 3 2
2 5
1 3
1 3
10 3 3
2 7 5
8 3 4
2 5 6
Even Even Odd
-1
In the first case, the only lexicographically smaller sequence of moves is "Even
Even Even", but Bessie can make Elsie lose in that case by first playing $5$,
which reduces Elsie's number of marbles from $10$ to $5$, then playing $3$, which
reduces Elsie's number of marbles from $5$ to $2$, then playing $3$, which wipes out
all of her marbles.
If Elsie instead plays the correct move sequence "Even Even Odd", then if Bessie
plays the same way, at the end when she plays $3$, Elsie will gain those $3$
marbles, increasing her number of marbles to $5$. It can further be shown that
Bessie cannot play in a different way to take all of Elsie's marbles given that
Elsie plays "Even Even Odd".
In the second case, it can be shown that for any move sequence that Elsie could
choose, Bessie can play in a way to take all of Elsie's marbles.

样例 2

1
20 8 2
3 5
3 5
3 5
3 5
3 5
3 5
3 5
3 5
Even Even Even Odd Even Odd Even Odd