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:

 1 /*
 2 Data: 2019-05-15 20:14:44
 3 Problem: PAT_A1149#Dangerous Goods Packaging
 4 AC: 32:04
 5 
 6 题目大意：
 7 给出互斥物体的列表，和需要运输的货物，判断这些货物是否可以共存
 8 输入：
 9 第一行，互斥物体总数N<=1e4，运输货物总数M<=100；
10 接下来N行，给出互斥对（一个物品可能有多个互斥物品），5位数字表示；
11 接下来M行，首先给出容量K<=1e3，和K个物品
12 */
13 
14 #include<cstdio>
15 #include<algorithm>
16 #include<vector>
17 using namespace std;
18 const int M=110,N=1e6;
19 int mp[N],goods[M];
20 vector<int> pairs[N];
21 
22 int main()
23 {
24 #ifdef    ONLINE_JUDGE
25 #else
26     freopen("Test.txt", "r", stdin);
27 #endif
28 
29     int n,m,v1,v2,k;
30     scanf("%d%d", &n, &m);
31     for(int i=0; i<n; i++)
32     {
33         scanf("%d%d", &v1,&v2);
34         pairs[v1].push_back(v2);
35         pairs[v2].push_back(v1);
36     }
37     for(int i=0; i<m; i++)
38     {
39         int f=0;
40         scanf("%d", &k);
41         fill(mp, mp+N, 0);
42         for(int j=0; j<k; j++)
43         {
44             scanf("%d", &goods[j]);
45             mp[goods[j]]=1;
46         }
47         for(int j=0; j<k; j++)
48         {
49             v1 = goods[j];
50             for(int p=0; p<pairs[v1].size(); p++)
51             {
52                 v2 = pairs[v1][p];
53                 if(mp[v2]==1)
54                 {
55                     f=1;
56                     break;
57                 }
58             }
59             if(f==1)
60                 break;
61         }
62         if(f==1)printf("No\n");
63         else    printf("Yes\n");
64     }
65 
66     return 0;
67 }

 

转载于:https://www.cnblogs.com/blue-lin/p/10877855.html