PAT_A1149#Dangerous Goods Packaging

Source:

PAT A1149 Dangerous Goods Packaging (25 分)

Description:

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 (≤), the number of pairs of incompatible goods, and M (≤), 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 (≤) 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

Keys:

• 散列（Hash）

Attention:

• 若1个元素与N个元素互斥，属于散列；若一系列元素相互排斥的话，则是并查集

Code:

/*
Data: 2019-08-04 16:38:35
Problem: PAT_A1149#Dangerous Goods Packaging
AC: 32:04

题目大意：
题目大意：
给一份两两互斥的清单，再给出货品清单，判断该批货品是否兼容

基本思路：
二维数组存储各个物品的互斥集，
设置该批物品存在位=1，遍历该批物品的互斥集；
若互斥集中物品的存在位=1，则不兼容
*/
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int M=1e6;
vector<int> st[M];
int exist[M],goods[M];

int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("Test.txt", "r", stdin);
#endif // ONLINE_JUDGE

    int n,m,k,v1,v2;
    scanf("%d%d", &n,&m);
    for(int i=0; i<n; i++)
    {
        scanf("%d%d", &v1,&v2);
        st[v1].push_back(v2);
        st[v2].push_back(v1);
    }
    while(m--)
    {
        scanf("%d", &k);
        fill(exist,exist+M,0);
        for(int i=0; i<k; i++)
        {
            scanf("%d", &goods[i]);
            exist[goods[i]]=1;
        }
        for(int i=0; i<k; i++)
            for(int j=0; j<st[goods[i]].size(); j++)
                if(exist[st[goods[i]][j]]==1){
                    k=0;break;
                }
        if(k)   printf("Yes\n");
        else    printf("No\n");
    }

    return 0;
}