P2495 - AtCoder166 B - Trick or Treat

Memory Limit：128 MB Time Limit：1.000 S

Judge Style：Text Compare Creator：

Submit：10 Solved：5

Submit Submit Record Statistics ShowOff!

Problem Statement

N

N Snukes called Snuke1, Snuke2, ..., SnukeN live in a town.
There are K kinds of snacks sold in this town, called Snack1, Snack2, ..., Snack K. The following

_{i}

di Snukes have Snack

i

i: Snuke

_{i, 1},_{i, 2}, \dots,_{i,_{i}}

Takahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?

Constraints

All values in input are integers.
1≤N≤100
1≤K≤100
1≤di≤N
1≤Ai,1<⋯<Ai,di≤N

Input is given from Standard Input in the following format:
N K
d1
A1,1⋯A1,d1
⋮⋮
dK
AK,1⋯AK,dK

Print the answer.

AtCoder 基础一维数组循环强

Submit Submit Record Statistics ShowOff!

2495: AtCoder166 B - Trick or Treat

Description

Problem Statement

Constraints

Input

Output

Sample Input Copy

Sample Output Copy

Source/Category