Score : $200$ points

问题描述

$N$ 名玩家（编号为 $1$、$2$、$\ldots$、$N$）正在玩轮盘赌。每次旋转的结果是 $37$ 个整数之一，从 $0$ 到 $36$。对于每个 $i = 1, 2, \ldots, N$，第 $i$ 名玩家在 $37$ 种可能的结果中押注了其中的 $C_i$ 项：$A_{i, 1}$、$A_{i, 2}$、$\ldots$、$A_{i, C_i}$。

现在轮盘已经转动并产生了结果 $X$。请按 升序 打印所有以最少押注数押中 $X$ 的玩家编号。

更正式地讲，请按照 升序 打印所有满足以下两个条件的 $1$ 到 $N$ 之间的整数 $i$：

• 玩家 $i$ 押中了结果 $X$。
• 对于每个 $j = 1, 2, \ldots, N$，如果玩家 $j$ 也押中了结果 $X$，则有 $C_i \leq C_j$。

请注意，可能存在没有数字需要打印的情况（参见示例输入 2）。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

$N$ people, person $1$, person $2$, $\ldots$, person $N$, are playing roulette. The outcome of a spin is one of the $37$ integers from $0$ to $36$. For each $i = 1, 2, \ldots, N$, person $i$ has bet on $C_i$ of the $37$ possible outcomes: $A_{i, 1}, A_{i, 2}, \ldots, A_{i, C_i}$.

The wheel has been spun, and the outcome is $X$. Print the numbers of all people who have bet on $X$ with the fewest bets, in ascending order.

More formally, print all integers $i$ between $1$ and $N$, inclusive, that satisfy both of the following conditions, in ascending order:

• Person $i$ has bet on $X$.
• For each $j = 1, 2, \ldots, N$, if person $j$ has bet on $X$, then $C_i \leq C_j$.

Note that there may be no number to print (see Sample Input 2).

Constraints

• $1 \leq N \leq 100$
• $1 \leq C_i \leq 37$
• $0 \leq A_{i, j} \leq 36$
• $A_{i, 1}, A_{i, 2}, \ldots, A_{i, C_i}$ are all different for each $i = 1, 2, \ldots, N$.
• $0 \leq X \leq 36$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$

$C_1$

$A_{1, 1}$ $A_{1, 2}$ $\ldots$ $A_{1, C_1}$

$C_2$

$A_{2, 1}$ $A_{2, 2}$ $\ldots$ $A_{2, C_2}$

$\vdots$

$C_N$

$A_{N, 1}$ $A_{N, 2}$ $\ldots$ $A_{N, C_N}$

$X$

Output

Let $B_1, B_2, \ldots, B_K$ be the sequence of numbers to be printed in ascending order. Using the following format, print the count of numbers to be printed, $K$, on the first line, and $B_1, B_2, \ldots, B_K$ separated by spaces on the second line:

$K$

$B_1$ $B_2$ $\ldots$ $B_K$

Sample Input 1

4
3
7 19 20
4
4 19 24 0
2
26 10
3
19 31 24
19

Sample Output 1

2
1 4

The wheel has been spun, and the outcome is $19$. The people who has bet on $19$ are person $1$, person $2$, and person $4$, and the number of their bets are $3$, $4$, and $3$, respectively. Therefore, among the people who has bet on $19$, the ones with the fewest bets are person $1$ and person $4$.

Sample Input 2

3
1
1
1
2
1
3
0

Sample Output 2

0

The wheel has been spun and the outcome is $0$, but no one has bet on $0$, so there is no number to print.

update @ 2024/3/10 08:57:39