|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||5||4||2||66.667%|
Recently, Tim has discovered a time period in the future in which Medieval artifacts, particularly those associated with the various armies of the time period, are the most valuable. So Tim plans to travel to the Middle Ages, find some chainmail, lances, etc., and then make a fortune off of them. The only problem is that he’s not likely to have an acceptable currency, so in order to acquire the things he needs, he must barter for them. In the interest of time, Tim wants to determine how many trades he will need to make before he actually executes those trades. That way, he can spend his time acquiring other items which require less trades.
Note: The time-machine can only hold at most 5 items. This means that Tim will not make a trade if he will even temporarily have to carry more than 5 items.
The first line is the number K of input data sets, followed by the K data sets, each of the following form:
The first line contains four integers 1 ≤ M ≤ 20, the maximum number of trades Tim is willing to make, 1 ≤ H ≤ 5, the number of items Tim has to start with, 1 ≤ W ≤ 5, the number of items Tim wants, 1 ≤ T ≤ 20, the number of different trades.
This is followed by one line containing H words, the names of the items Tim has. Then one line containing W words, the names of the items Tim wants.
This is followed by T pairs of lines, each pair specifying a possible trade. The first line of a pair contains a number 1 ≤ gt ≤ 5, the number of items Tim will give away in the trade, followed by the names of the gt items. The second line contains a number 1 ≤ at ≤ 5, the number of items Tim will acquire in the trade, followed by the names of the at items.
For each data set, output “Data Set x:” on a line by itself, where x is its number. If it is possible to acquire all of the wanted items by only making M trades or less, output the fewest number of trades that Tim will have to make. Otherwise, output “Impossible.”. Each data set should be followed by a blank line.
2 4 3 2 3 coin butterknife suit sword chainmail 1 suit 1 chainmail 3 butterknife butterknife butterknife 1 sword 1 coin 2 butterknife butterknife 1 1 1 2 pvcpipe lance 1 pvcpipe 1 shield 1 shield 1 lance
Data Set 1: 3 Data Set 2: Impossible.