甲级PAT 1149 Dangerous Goods Packaging （25 分）（map,vector）

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

题目要求 

有两种物品不能放在一个容器中，给出这些不能放在一个的每对物品，然后给出m个容器，判断其中是否有不相容的物品

解题思路

先用一个map将每种物品不相容的物品全部存储，这样在输入一个物品的时候就可以判断其有没有不相容的物品，如果有，就从当前位置向后找是否存在其不相容的物品。如果遍历了所有物品都没有不相容的物品在容器中，则表示不存在不相容的物品。

完整代码

#include<bits/stdc++.h>
using namespace std;

map<int,vector<int> > listm;
vector<int> temp;

bool find(int start,int x){
	for(int i=start;i<temp.size();i++){
		if(temp[i]==x) return true;
	}
	return false;
} 

bool check(int start,int num){
	int i,k,j;
	for(i=0;i<listm[num].size();i++){
		if(find(start,listm[num][i])) return true;
	} 
	return false;
}

int main(){
	int n,m,i,j,k,u,v;
	cin>>n>>m;
	for(i=0;i<n;i++){
		cin>>u>>v;
		listm[u].push_back(v);
		listm[v].push_back(u);
	}
	for(i=0;i<m;i++){
		temp.clear();
		cin>>k;
		for(j=0;j<k;j++){
			cin>>u;
			if(listm[u].size()!=0) temp.push_back(u);
		}
		for(j=0;j<temp.size();j++){
			if(check(j,temp[j])){
				cout<<"No"<<endl;
				break;
			}
		}
		if(j==temp.size()) cout<<"Yes"<<endl;
	} 
	return 0;
}