1149 dangerous goods packaging (25 points)

30min

1149 Dangerous Goods Packaging (25 branch )

The question

Give a set of numbers that cannot coexist , Give more n Group number , Determine whether the number of each group can coexist .

Ideas

Existence of incompatible numbers vector in , When adding a number , Mark numbers that are incompatible with him , When a marked number appears , The number of groups cannot coexist .

Code

#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<set>
#include<vector>
#include<string.h>
using namespace std;
set<int>s;
vector<int>mp[100007];
int pre[1000007],vis[100007];
int main()
{
    
	int n,k,x,y,m,p,q,flog=0,cont=0;
	for(int i=0;i<1000007;i++){
    
		pre[i]=i+3000000;
	}
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++){
    
		scanf("%d%d",&x,&y);
		mp[x].push_back(y);
		mp[y].push_back(x);
	}
	for(int i=0;i<m;i++){
    
		scanf("%d",&k);
		flog=0;
		memset(vis,0,sizeof(vis));
		for(int j=0;j<k;j++){
    
			scanf("%d",&x);
			if(vis[x]==1){
    
				flog=1;
			}
			if(flog==1){
    
				continue;
			}
			for(int l=0;l<mp[x].size();l++){
    
				vis[mp[x][l]]=1;
			}
		}
		if(flog==1){
    
			printf("No\n");
		}else{
    
			printf("Yes\n");
		}
	}
	return 0;
}