地址：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3960
题目：
Japari Park is a large zoo home to extant species, endangered species, extinct species, cryptids and some legendary creatures. Due to a mysterious substance known as Sandstar, all the animals have become anthropomorphized into girls known as Friends.
Kaban is a young girl who finds herself in Japari Park with no memory of who she was or where she came from. Shy yet resourceful, she travels through Japari Park along with Serval to find out her identity while encountering more Friends along the way, and eventually discovers that she is a human.
However, Kaban soon finds that it's also important to identify other Friends. Her friend, Serval, enlightens Kaban that she can use some questions whose expected answers are either "yes" or "no" to identitfy a kind of Friends.
To be more specific, there are n Friends need to be identified. Kaban will ask each of them q same questions and collect their answers. For each question, she also gets a full list of animals' names that will give a "yes" answer to that question (and those animals who are not in the list will give a "no" answer to that question), so it's possible to determine the name of a Friends by combining the answers and the lists together.
But the work is too heavy for Kaban. Can you help her to finish it?
Input
There are multiple test cases. The first line of the input is an integer T (1 ≤ T ≤ 100), indicating the number of test cases. Then T test cases follow.
The first line of each test case contains two integers n (1 ≤ n ≤ 100) and q (1 ≤ q ≤ 21), indicating the number of Friends need to be identified and the number of questions.
The next line contains an integer c (1 ≤ c ≤ 200) followed by c strings p1, p2, ... , pc (1 ≤ |pi| ≤ 20), indicating all known names of Friends.
For the next q lines, the i-th line contains an integer mi (0 ≤ mi ≤ c) followed by mi strings si, 1, si, 2, ... , si, mi (1 ≤ |si, j| ≤ 20), indicating the number of Friends and their names, who will give a "yes" answer to the i-th question. It's guaranteed that all the names appear in the known names of Friends.
For the following n lines, the i-th line contains q integers ai, 1, ai, 2, ... , ai, q(0 ≤ ai, j ≤ 1), indicating the answer (0 means "no", and 1 means "yes") to the j-th question given by the i-th Friends need to be identified.
It's guaranteed that all the names in the input consist of only uppercase and lowercase English letters.
Output
For each test case output n lines. If Kaban can determine the name of the i-th Friends need to be identified, print the name on the i-th line. Otherwise, print "Let's go to the library!!" (without quotes) on the i-th line instead.
Sample Input
2
3 4
5 Serval Raccoon Fennec Alpaca Moose
4 Serval Raccoon Alpaca Moose
1 Serval
1 Fennec
1 Serval
1 1 0 1
0 0 0 0
1 0 0 0
5 5
11 A B C D E F G H I J K
3 A B K
4 A B D E
5 A B K D E
10 A B K D E F G H I J
4 B D E K
0 0 1 1 1
1 0 1 0 1
1 1 1 1 1
0 0 1 0 1
1 0 1 1 1
Sample Output
Serval
Let's go to the library!!
Let's go to the library!!
Let's go to the library!!
Let's go to the library!!
B
Let's go to the library!!
K
Hint
The explanation for the first sample test case is given as follows:
As Serval is the only known animal who gives a "yes" answer to the 1st, 2nd and 4th question, and gives a "no" answer to the 3rd question, we output "Serval" (without quotes) on the first line.
As no animal is known to give a "no" answer to all the questions, we output "Let's go to the library!!" (without quotes) on the second line.
Both Alpaca and Moose give a "yes" answer to the 1st question, and a "no" answer to the 2nd, 3rd and 4th question. So we can't determine the name of the third Friends need to be identified, and output "Let's go to the library!!" (without quotes) on the third line.
思路：手速题+3
把每个有名字的人的回答化成和所给格式一样的01串，然后判断根据01串的匹配计算匹配到几个人，把人名哈希一下就好。
如果匹配到多个人或者匹配不到人则无解。
（不过这题我有个疑问如果要你找名字的人里面有两个人的回答一模一样，那不就是无解吗，我加了这个判断后wa的不能自理，过了二十分钟后决定删了试试后发现就ac了，真是奇葩）
1 #include <bits/stdc++.h>
2
3 using namespace std;
4
5 #define MP make_pair
6 #define PB push_back
7 typedef long long LL;
8 typedef pair<int,int> PII;
9 const double eps=1e-8;
10 const double pi=acos(-1.0);
11 const int K=1e6+7;
12 const int mod=1e9+7;
13
14 map<int,int>cnt;
15 map<string,int>hs;
16 int n,q,m,a[202][202],b[202][202];
17 string ss,tmp,name[202];
18
19 int fd(int x,int &fb)
20 {
21 int fa=0;
22 for(int i=1;i<=m;i++)
23 {
24 int ff=1;
25 for(int j=1;j<=q&&ff;j++)
26 if(b[i][j]!=a[x][j])
27 ff=0;
28 if(ff) fa++,fb=i;
29 if(fa>1) return 0;
30 }
31 return fa;
32 }
33 int main(void)
34 {
35 //freopen("out.acm","w",stdout);
36 tmp="Let's go to the library!!";
37 int t;cin>>t;
38 while(t--)
39 {
40 memset(b,0,sizeof b);
41 hs.clear(),cnt.clear();
42 cin>>n>>q>>m;
43 for(int i=1;i<=m;i++)
44 cin>>name[i],hs[name[i]]=i;
45 for(int i=1,sz;i<=q;i++)
46 {
47 scanf("%d",&sz);
48 for(int j=1;j<=sz;j++)
49 cin>>ss,b[hs[ss]][i]=1;
50 }
51 for(int i=1;i<=n;i++)
52 {
53 int x=0;
54 for(int j=1;j<=q;j++)
55 scanf("%d",&a[i][j]),x=x*10+a[i][j];
56 cnt[x]++;
57 }
58 for(int i=1;i<=n;i++)
59 {
60 int x=0,k;
61 for(int j=1;j<=q;j++)
62 x=x*10+a[i][j];
63 if( fd(i,k)==1)
64 cout<<name[k]<<endl;
65 else
66 cout<<tmp<<endl;
67 }
68
69 }
70 return 0;
71 }