DMOPC '19 Contest 5 P1 - Conspicuous Cryptic Checklist

Points: 5

Time limit: 2.0s

Memory limit: 128M

Author:

Problem types

Tzak has spent the weekend hastily preparing DMOPC problems! Unfortunately, he is now behind on several assignments. After rummaging through his backpack, he realizes that he has $N$ ~N~ items. To save space, he records the $i$ ~i~-th item as a string, $s_i$ ~s_i~, on his checklist. He has $M$ ~M~ upcoming assignments, the $i$ ~i~-th of which requires $T_i$ ~T_i~ items to complete, $r_1, r_2, \dots, r_{T_i}$ ~r_1, r_2, \dots, r_{T_i}~. If Tzak has all $T_i$ ~T_i~ required items, he can complete the $i$ ~i~-th assignment. Otherwise, he flunks it. Help him determine how many assignments he can complete!

Constraints

In all subtasks,
$1 \le N, M, T_i \le 200$ ~1 \le N, M, T_i \le 200~
$1 \le |s_i|, |r_i| \le 10$ ~1 \le |s_i|, |r_i| \le 10~ where $|S|$ ~|S|~ denotes the length of string $S$ ~S~

Input Specification

The first line contains two space-separated integers, $N$ ~N~ and $M$ ~M~.
The next $N$ ~N~ lines contain a single string, $s_i$ ~s_i~. It is guaranteed that all the strings will be unique.
The next $M$ ~M~ sections contain a single integer $T_i$ ~T_i~, followed by $T_i$ ~T_i~ lines each containing a single string, $r_i$ ~r_i~.

Output Specification

Output a single integer on a single line, the answer to the problem.

Sample Input

3 4
chalk
cheese
charger
1
cheese
2
coins
cash
3
charger
chalk
caffeine
3
cheese
charger
cheese

Sample Output

Comments

0

cyberboost commented on April 5, 2024, 11:44 p.m.

can u have multiple of the same item?

0

ncai29 commented on Dec. 1, 2024, 1:48 a.m. ← edited →

yes you can have multiple of the same item