HDU 3150 Robot Roll Call – Cambot…Servo…Gypsy…Croooow（map）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3150

Mystery Science Theater 3000 is about to start, which means it‘s time for "Robot Roll Call", where the name of each robot is called out, as per the list received from Earth. The expectation is that if a robot is there, it will respond by adding its name to a data stream which is then sent back to Earth. Unfortunately today, once the roll is received, communication with Earth is temporarily lost. In the meantime, the robots that are present for roll call have saved their names to the data stream. However, lots of other things are also being saved to this same stream. To help extract data later, any data placed in the stream is separated by whitespace. Once the communication problems are resolved, the contents of this stream are relayed to Earth.

Your task is as follows. Given a list of names for roll call, you must scan the accompanying data stream and determine if a given name is there. For each name that is in the roll call, report whether or not that name was in the data stream. For a name to be a match, it must appear EXACTLY as shown in the roll. This means a match is case-sensitive and sub-string matches are not allowed.

2
4
Gypsy
TomServo
CrowTRobot
Cambot
2
Manos Torgo Joel 101010 Gypsy tomservo
Fugitive Alien Time of the Apes crowTrobot Cambot
2
R2D2
C3PO
1
Boba Fett c3Po R2D22 Jar Jar Binks Luke give in to the dark side

Test set 1:
Gypsy is present
TomServo is absent
CrowTRobot is absent
Cambot is present
Test set 2:
R2D2 is absent
C3PO is absent

PS:

推断给出的表单是否在以下有出现！

代码例如以下：

#include <cstdio>
#include <map>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
map<string,int>mm;
int main()
{
    string name[117];
    int t;
    int n;
    int cas = 0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        mm.clear();
        for(int i = 0; i < n; i++)
        {
            cin>>name[i];
        }
        int m;
        scanf("%d",&m);
        char s[1000];
        string ss="";
        for(int i = 0; i < m; i++)
        {

            getchar();
            gets(s);
            for(int j = 0; j < strlen(s); j++)
            {
                if(s[j]==' ')
                {
                    mm[ss]++;
                    ss="";
                    continue;
                }
                ss+=s[j];
            }
            mm[ss]++;
            ss="";
        }
        printf("Test set %d:\n",++cas);
        for(int i = 0 ; i < n; i++)
        {
            if(mm[name[i]])
            {
                //printf("%s is present\n",name[i]);
                cout<<name[i]<<" is present"<<endl;
            }
            else
            {
                //printf("%s is absent\n",name[i]);
                cout<<name[i]<<" is absent"<<endl;
            }
        }
        printf("\n");
    }
    return 0;
}