UVaLive 6581 && Gym 100299B What does the fox say? (模拟+STL)

题意：给定一些动物的叫声，然后再定某些动物的叫声，让你去除这些叫声后得到的叫声。

析：先存储所有的叫声，然后用map来记录其他的叫声，在输出时再判定一下就好。

代码如下：

#pragma comment(linker, "/STACK:1024000000,1024000000")

#include <cstdio>

#include <string>

#include <cstdlib>

#include <cmath>

#include <iostream>

#include <cstring>

#include <set>

#include <queue>

#include <algorithm>

#include <vector>

#include <map>

#include <cctype>

#include <cmath>

#include <stack>

#include <sstream>

#define freopenr freopen("in.txt", "r", stdin)

#define freopenw freopen("out.txt", "w", stdout)

using namespace std;

typedef long long LL;

typedef pair<int, int> P;

const int INF = 0x3f3f3f3f;

const double inf = 0x3f3f3f3f3f3f;

const double PI = acos(-1.0);

const double eps = 1e-8;

const int maxn = 1e5 + 5;

const int mod = 1e9 + 7;

const int dr[] = {-1, 0, 1, 0};

const int dc[] = {0, 1, 0, -1};

const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};

int n, m;

const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

inline int Min(int a, int b){ return a < b ? a : b; }

inline int Max(int a, int b){ return a > b ? a : b; }

inline LL Min(LL a, LL b){ return a < b ? a : b; }

inline LL Max(LL a, LL b){ return a > b ? a : b; }

inline bool is_in(int r, int c){

    return r >= 0 && r < n && c >= 0 && c < m;

}

vector<string> ans;

map<string, int> mp;

int main(){

    int T;  cin >> T;

    getchar();

    while(T--){

        ans.clear();

        mp.clear();

        string s;

        getline(cin, s);

        stringstream ss(s);

        while(ss >> s)  ans.push_back(s);

        while(getline(cin, s) && s != "what does the fox say?"){

            stringstream ss(s);

            for(int i = 0; ss >> s; ++i)

                if(i > 1)  mp[s] = 1;

        }

        bool ok = false;

        for(int i = 0; i < ans.size(); ++i){

            if(!mp[ans[i]]){

                if(ok)  putchar(' ');

                printf("%s", ans[i].c_str());

                ok = true;

            }

        }

        printf("\n");

    }

    return 0;

}