Pizza
레이팅 미적용의견: 0
After a long day and miserable at work, Mirko decided to order a pizza for dinner to cheer
himself up. In a big pile of papers on his desk, he found a flyer of a nearby pizza restarant.
The restarant offers \(m\) different pizzas. Pizza toppings are labeled with positive integers.
\(i-th\) pizza has \(k_{i}\) toppings, with labels \(b_{i,}\){1}, b{2}, . . . , b.}_{i
Mirko is very picky when it comes to food. He doesn’t like \(n\) toppings, those with labels \(a\)1, a2, . . . , a\(n\), so
he wants to order a pizza that doesn’t contain any of those toppings. Determine the number of pizzas
that Mirko can order.
In test cases worth 20 points it holds \(n = 1\) and \(k@@RISE_MATH_BLOCK_0@@m = 1\).
The first line contains an integer \(n\) (\(1 \le n \le 100\)), the number of toppings, followed by \(n\) distinct integers
\(a@@RISE_MATH_BLOCK_0@@i \le 100\)), the labels of toppings Mirko dislikes.
The second line contains an integer \(m\) (\(1 \le m \le 100\)), the number of pizzas.
The following \(m\) lines describe the pizzas. The \(i-th\) line contains an integer \(k@@RISE_MATH_BLOCK_1@@i \le 100\)), the numer
of toppings, followed by \(k_{i}\) distinct integers \(b_{i,j}\) (\(1 \le b_{i,j} \le 100\)), the labels of toppings on the \(i-th\) pizza.
The pizzas, i.e. the sets of toppings, will be distinct.
Output the number of pizzas that Mirko can order.
1 2
3
1 1
1 2
1 3
2
2 1 2
4
2 1 4
3 1 2 3
2 3 4
3 3 5 7
2
1 4
3
1 1
1 2
1 3
3
평가 및 의견
Pizza
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Pizza