2182. Dining

单点时限: 2.0 sec

内存限制: 256 MB

Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.

Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although he might not be able to stuff everybody, he wants to give a complete meal of both food and drink to as many cows as possible.

Farmer John has cooked $F$ $(1 \le F \le 100)$ types of foods and prepared $D$ $(1 \le D \le 100)$ types of drinks. Each of his $N$ $(1 \le N \le 100)$ cows has decided whether she is willing to eat a particular food or drink a particular drink. Farmer John must assign a food type and a drink type to each cow to maximize the number of cows who get both.

Each dish or drink can only be consumed by one cow (i.e., once food type 2 is assigned to a cow, no other cow can be assigned food type 2).


  • Line $1$: Three space-separated integers: $N$, $F$, and $D$
  • Lines $2$..$N+1$: Each line $i$ starts with a two integers $F_i$ and $D_i$, the number of dishes that cow $i$ likes and the number of drinks that cow $i$ likes. The next $F_i$ integers denote the dishes that cow $i$ will eat, and the $D_i$ integers following that denote the drinks that cow $i$ will drink.


A single integer that is the maximum number of cows that can be fed both food and drink that conform to their wishes


4 3 3
2 2 1 2 3 1
2 2 2 3 1 2
2 2 1 3 1 2
2 1 1 3 3

25 人解决,37 人已尝试。

35 份提交通过,共有 101 份提交。

4.9 EMB 奖励。

创建: 15 年,2 月前.

修改: 4 年,8 月前.

最后提交: 1 年,7 月前.

来源: Elite 2007 US Open Competition