1134 Vertex Cover（25 分）

Each input file contains one test case. For each case, the first line gives two positive integers N and M (both no more than 10​4​​), being the total numbers of vertices and the edges, respectively. Then M lines follow, each describes an edge by giving the indices (from 0 to N−1) of the two ends of the edge.

After the graph, a positive integer K (≤ 100) is given, which is the number of queries. Then K lines of queries follow, each in the format:

N​v​​ v[1] v[2]⋯v[N​v​​]

where N​v​​ is the number of vertices in the set, and v[i]'s are the indices of the vertices.

Output Specification:

For each query, print in a line Yes if the set is a vertex cover, or No if not.

Sample Input:

10 11
8 7
6 8
4 5
8 4
8 1
1 2
1 4
9 8
9 1
1 0
2 4
5
4 0 3 8 4
6 6 1 7 5 4 9
3 1 8 4
2 2 8
7 9 8 7 6 5 4 2

Sample Output:

No
Yes
Yes
No
No

 

#include<cstdio>
#include<cstring>
#include<fstream>
#include<set>
#include<vector>
using namespace std;
const int maxn=10010;

vector<int> v[maxn];
bool hashtable[maxn]={false};


int main(){
	int n, m;
//	freopen("d://in.txt","r",stdin);
	scanf("%d%d", &n, &m);
	for(int i=0; i<m; i++){
		int a, b;
		scanf("%d%d", &a, &b);
        v[a].push_back(i);
        v[b].push_back(i);		
	}
	
	int k;
	scanf("%d", &k);
	for(int i=0; i<k; i++){
		int nv;
		scanf("%d", &nv);
		for(int j=0; j<nv; j++){
			int x;
			scanf("%d", &x);
			for(int j2=0; j2<v[x].size(); j2++){
				hashtable[v[x][j2]]=1;
			}
		}
		bool judge=true;
		for(int j=0; j<m; j++){
			if(hashtable[j]==false){
				printf("No\n");
				judge=false;
				break;
			}
		}
		if(judge==true) printf("Yes\n");
		memset(hashtable, false, sizeof(hashtable));		
	}
	return 0;
}