1149 Dangerous Goods Packaging (25 分)

matter

纯粹的一道模拟题。

code

#include<iostream>
#include<unordered_map>
#include<vector>
using namespace std;
const int MAXN = 100000;

int main(){
	int n , m , l , a , b;
	unordered_map<int , vector<int>> um;
	scanf("%d %d" , &n , &m);
	for(int i = 0 ; i < n ; i ++){
		scanf("%d %d" , &a , &b);
		um[b].push_back(a);
		um[a].push_back(b); 
	}
	
	for(int i = 0 ; i < m ; i ++){
		scanf("%d" , &l);
		int a[MAXN] , judge[MAXN] = { 0 };
		for(int j = 0 ; j < l ; j ++){
			scanf("%d" , &a[j]);
			judge[a[j]] = 1;
		}
		
		bool flag = false;			
		for(int j = 0 ; j < l ; j ++){
			for(int k = 0 ; k < um[a[j]].size() ; k ++){
				if(judge[um[a[j]][k]] == 1)	flag = true;
			}
		}	
		if(flag == true)	printf("No\n");
		else	printf("Yes\n");	 
	}
	return 0;
}