1149 Dangerous Goods Packaging （25 分）

When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in serious trouble. For example, oxidizing agent （氧化剂） must not be packed with flammable liquid （易燃液体）, or it can cause explosion.

Now you are given a long list of incompatible goods, and several lists of goods to be shipped. You are supposed to tell if all the goods in a list can be packed into the same container.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: N (≤10​4​​), the number of pairs of incompatible goods, and M (≤100), the number of lists of goods to be shipped.

Then two blocks follow. The first block contains N pairs of incompatible goods, each pair occupies a line; and the second one contains M lists of goods to be shipped, each list occupies a line in the following format:

K G[1] G[2] ... G[K]

where K (≤1,000) is the number of goods and G[i]'s are the IDs of the goods. To make it simple, each good is represented by a 5-digit ID number. All the numbers in a line are separated by spaces.

Output Specification:

For each shipping list, print in a line Yes if there are no incompatible goods in the list, or No if not.

Sample Input:

6 3
20001 20002
20003 20004
20005 20006
20003 20001
20005 20004
20004 20006
4 00001 20004 00002 20003
5 98823 20002 20003 20006 10010
3 12345 67890 23333

Sample Output:

No
Yes
Yes

题目大意：题目给出几种不能相容的物品，然后给出几堆物品，确认每一堆物品是否全部相容，即可以放在一起。

分析：用map存储每一个货物的所有不相容物品，在判断给出的一堆物品中查看是否相容的时候，判断任意一个不相容的物品是否在这里面，如果存在不相容的物品，则输出NO，遍历完没有找到不相容物品则输出YES

代码如下：

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
    int n,m,c1,c2;
    cin>>n>>m;
    map<int,vector<int> > B;
    for (int i=0;i<n;i++)
    {
        cin>>c1>>c2;
        B[c1].push_back(c2);
        B[c2].push_back(c1);
    }
    for(int i=0;i<m;i++)
    {
        int t,flag=0;
        bool a[100000]={false};//这个地方开小了报错：段错误。不知道啥意思。不能低于100000
        cin>>t;
        vector<int>v(t);
        for(int i=0;i<t;i++)
        {
            cin>>v[i];
            a[v[i]]=true;
        }
        for(int i=0;i<t;i++)
            for(int j=0;j<B[v[i]].size();j++)
            if(a[B[v[i]][j]]==true) flag=1;
        cout<<(flag ?"No":"Yes")<<endl;
    }

    return 0;
}