ZOJ 3960What Kind of Friends Are You?
来源:互联网 发布:什么是js模块化 编辑:程序博客网 时间:2024/05/18 03:51
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
23 45 Serval Raccoon Fennec Alpaca Moose4 Serval Raccoon Alpaca Moose1 Serval1 Fennec1 Serval1 1 0 10 0 0 01 0 0 05 511 A B C D E F G H I J K3 A B K4 A B D E5 A B K D E10 A B K D E F G H I J4 B D E K0 0 1 1 11 0 1 0 11 1 1 1 10 0 1 0 11 0 1 1 1
Sample Output
ServalLet's go to the library!!Let's go to the library!!Let's go to the library!!Let's go to the library!!BLet'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.
想法:水题,队友用map做的,代码量应该少些,我不怎么会用map,用结构体做了下。
代码:
#include<stdio.h>
#include<string.h>
struct node
{
int a[1010];
char s[30];
int count;
}sec[1010];
int d[110][1010];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int i,j,x;
memset(d,0,sizeof(0));
int n,m,k;
scanf("%d %d",&n,&m);
scanf("%d",&k);
for(i=0;i<k;i++)
{
for(j=0;j<=m;j++)
{
sec[i].a[j]=0;
}
}
for(i=0;i<k;i++)
{
scanf("%s",sec[i].s);
}
char ch[30];
int t;
for(i=0;i<m;i++)
{
scanf("%d",&t);
for(j=0;j<t;j++)
{
scanf("%s",ch);
for(x=0;x<k;x++)
{
if(strcmp(sec[x].s,ch)==0)
{
sec[x].a[i]=1;
}
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&d[i][j]);
}
}
int ws;
for(i=0;i<n;i++)
{
int flag=0;
for(x=0;x<k;x++)
{
int count=0;
for(j=0;j<m;j++)
{
if(sec[x].a[j]==d[i][j])
{
count++;
}
}
if(count==m)
{
flag++;
ws=x;
}
}
if(flag==1)
{
puts(sec[ws].s);
}
else
{
puts("Let's go to the library!!");
}
}
}
return 0;
}
- zoj 3960 What Kind of Friends Are You?
- ZOJ 3960 What Kind of Friends Are You?(哈希)
- zoj 3960 What Kind of Friends Are You?
- ZOJ 3960 What Kind of Friends Are You? 题解
- ZOJ 3960 What Kind of Friends Are You?【】
- ZOJ 3960What Kind of Friends Are You?
- What Kind of Friends Are You?
- What Kind of Friends Are You?
- What Kind of Friends Are You?
- ZOJ3960-What Kind of Friends Are You?
- What Kind of Friends Are You?
- zoj 3960 What Kind of Friends Are You?(map+哈希)
- ZOJ 3960 What Kind of Friends Are You?(STL map,状态压缩)
- 浙江省赛 C What Kind of Friends Are You?
- 浙江省赛C题 What Kind of Friends Are You?
- What Kind of Friends Are You?(字符串匹配)
- 2017 浙江省赛 C What Kind of Friends Are You + D Let's Chat
- 17年浙江省省赛C-What Kind of Friends Are You?
- 棋盘问题
- Struts2 同时支持/* 和.do *.action 的匹配
- LeetCode:maxi&mum depth of binary tree&balanced-binary-tree
- String\StringBuffer\StringBuilder的不同 基本常用类 Date时间类 Math数学类的基本方法
- 在eclipse中设置了编码方式为utf-8,但是在创建properties文件时没有进行变化
- ZOJ 3960What Kind of Friends Are You?
- eclipse 断点调试方法
- Leetcode 24.Swap Nodes in Pairs
- 最大字段和算法
- Bigdata Development Java_Study_06(集合Collection和Map)
- Immutable.js使用
- 多线程的那点儿事(之读写锁)
- 【QT】Qt creator自定义编译运行
- java中的匿名内部类总结