|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||512 MB||1||1||1||100.000%|
Obélix is a big eater. Everybody knows that, even the president of the Bureau des Élèves. He eats wild boar every day. But only a few people know that he is also a fine diner. In fact, Obélix never cooks his meat according to the same recipe twice. He keeps all the recipes he might want to try one day in an old book. Every recipe comes with a list of required ingredients to prepare the dish. He has even rated each recipe, in the form of a grade, according to how good he believes the dish will taste. In his kitchen pantry, he has all the required ingredients in unlimited quantities. The only drawback is that the ingredients will eventually lose their freshness and spoil as all the items of a given ingredient have the same expiration date.
In the coming days, Obélix would like to prepare a different dish every day in order to maximize the total grade of all the dishes he cooks, while never using an expired ingredient. Astérix is fortunate enough to be his guest every day, but they will have a hard time figuring out how to choose which dish to cook. Can you help?
The input consists of multiple test cases. The first line of the input consists of an integer indicating the number of test cases. The first line of each test case consists of three integers $n$ ($1\le n \le 100000$), $i$ ($1\le i \le 100000$) and $r$ ($1\le r \le 100000$) separated by single spaces: $n$ indicates the number of days during which Obélix will cook (the days are numbered from $1$ to $n$), $i$ is the number of ingredients (numbered from $1$ to $i$), and $r$ is the number of recipes in the book. The second line consists of $i$ integers separated by single spaces: for $1 \leq j \leq i$, the $j$th integer $1 \leq e_j \leq 100000$ indicates the day on which the ingredient will expire (i.e., the last day when it can be used). The test cases finish with $r$ lines, one for each recipe, with the $k$th of these lines for $1 \leq k \leq r$ consisting of integers separated by single spaces: a first integer $1 \leq g_k \leq 100$ giving the grade of the recipe, a second integer $1 \leq l_k \leq 10$ giving the number of ingredients of the recipe, and $l_k$ distinct integers giving the required ingredients, each of which is between $1$ and $i$.
For each test case, your program should output the maximum sum of the grades of recipes that Obelix can cook over the $n$ days, subject to the constraint that each recipe can be cooked at most once and that a recipe cannot be cooked on a day where one of its ingredients is past its expiration date.
2 2 3 2 1 2 6 5 2 2 3 10 1 1 3 3 3 1 2 3 15 1 1 5 2 2 3 10 1 1