本文介绍了一个通过提问来识别动物园中特定动物化身角色的算法，并提供了一种计算聊天软件中用户间亲密度得分的方法。
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.
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 200+10;
int main()
{
int t;
scanf("%d",&t);
while(t--){
///初始化
map <string,string> G;
string lists[maxn];
int n,q,c;///n个人要被确定
scanf("%d%d%d",&n,&q,&c);
for(int i = 0; i<c;++i){///一共c个人在列表里
cin>>lists[i];
}
///从第一个问题开始
for(int i = 0; i<q; ++i){
int m;
scanf("%d",&m);
map<string,bool> myans;
string temp;
///哪m个人会说yes
for(int j = 0;j<m;++j){
cin>>temp;
myans[temp] = true;
}
for(int j = 0; j<c;++j){
if(myans.find(lists[j])!= myans.end()){///如果这个人会说yes
G[lists[j]] += '1';
}else{
G[lists[j]] += '0';
}
}
}
string stands[maxn];///标准回答
string tem;
for(int i = 0; i<n;++i){
for(int j = 0;j<q;++j){
cin>>tem;
stands[i] += tem;
}
}
for(int i = 0; i<n; ++i){
string ans;
int cnt = 0;
map<string,string> :: iterator it;
for(it = G.begin(); it!=G.end();++it){
if(stands[i] == (*it).second){
cnt ++;
ans = (*it).first;
}
}
if(cnt == 1){
cout<<ans<<endl;
}
else puts("Let's go to the library!!");
}
}
return 0;
}
ACM (ACMers' Chatting Messenger) is a famous instant messaging software developed by Marjar Technology Company. To attract more users, Edward, the boss of Marjar Company, has recently added a new feature to the software. The new feature can be described as follows:
If two users, A and B, have been sending messages to each other on the last m consecutive days, the "friendship point" between them will be increased by 1 point.
More formally, if user A sent messages to user B on each day between the (i - m + 1)-th day and the i-th day (both inclusive), and user B also sent messages to user A on each day between the (i - m + 1)-th day and the i-th day (also both inclusive), the "friendship point" between A and B will be increased by 1 at the end of the i-th day.
Given the chatting logs of two users A and B during n consecutive days, what's the number of the friendship points between them at the end of the n-th day (given that the initial friendship point between them is 0)?
Input
There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 10), indicating the number of test cases. For each test case:
The first line contains 4 integers n (1 ≤ n ≤ 109), m (1 ≤ m ≤ n), x and y (1 ≤ x, y ≤ 100). The meanings of n and m are described above, while x indicates the number of chatting logs about the messages sent by A to B, and y indicates the number of chatting logs about the messages sent by B to A.
For the following x lines, the i-th line contains 2 integers la, i and ra, i (1 ≤ la, i ≤ ra, i ≤ n), indicating that A sent messages to B on each day between the la, i-th day and the ra, i-th day (both inclusive).
For the following y lines, the i-th line contains 2 integers lb, i and rb, i (1 ≤ lb, i ≤ rb, i ≤ n), indicating that B sent messages to A on each day between the lb, i-th day and the rb, i-th day (both inclusive).
It is guaranteed that for all 1 ≤ i < x, ra, i + 1 < la, i + 1 and for all 1 ≤ i < y, rb, i + 1 < lb, i + 1.
Output
For each test case, output one line containing one integer, indicating the number of friendship points between A and B at the end of the n-th day.
Sample Input
2 10 3 3 2 1 3 5 8 10 10 1 8 10 10 5 3 1 1 1 2 4 5
Sample Output
3 0
Hint
For the first test case, user A and user B send messages to each other on the 1st, 2nd, 3rd, 5th, 6th, 7th, 8th and 10th day. As m = 3, the friendship points between them will be increased by 1 at the end of the 3rd, 7th and 8th day. So the answer is 3.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <stack>
#include <cctype>
using namespace std;
typedef unsigned long long ULL;
int main() {
int a[210],b[210];
int t,n,m,x,y;
int i,j,k;
int ai,bi;
int ans;
scanf("%d",&t);
while(t--){
ans=0;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d %d %d %d",&n,&m,&x,&y);
ai=0;
while(x--){
scanf("%d",&a[ai++]);
scanf("%d",&a[ai++]);
}
bi=0;
while(y--){
scanf("%d",&b[bi++]);
scanf("%d",&b[bi++]);
}
i=j=0;
int day;
while(i<ai&&j<bi){
if(a[i]<b[j]){///A左端点 < B左端点
if(a[i+1]<b[j+1]){///A右端点 < B右端点
day = a[i+1]-b[j]+1;
if(day>=m){
ans=ans+(day-m+1);
i+=2;
continue;
}else{
i+=2;
continue;
}
}else{
day = b[j+1]-b[j]+1;
if(day>=m){
ans=ans+(day-m+1);
j+=2;
continue;
}else{
j+=2;
continue;
}
}
}else{///A左端点 >= B左端点
if(a[i+1]<b[j+1]){
day = a[i+1]-a[i]+1;
if(day>=m){
ans=ans+(day-m+1);
i+=2;
continue;
}else{
i+=2;
continue;
}
}else{
day = b[j+1]-a[i]+1;
if(day>=m){
ans=ans+(day-m+1);
j+=2;
continue;
}else{
j+=2;
continue;
}
}
}
}
cout<<ans<<endl;
}
return 0;
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
