【PAT】1134.Vertex Cover (25)【模拟】

题目描述

A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex sets, you are supposed to tell if each of them is a vertex cover or not.

翻译：一个顶点覆盖是一组顶点,使得图的每条边都至少有一个顶点存在于该集合中。现在给定一个图与几个顶点集,你需要依次说出它们是否是一个顶点覆盖。

Input Specification:

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.

翻译：每个输入文件包含一组测试数据。对于每组测试数据，第一行给出两个正整数N和M（都不超过10^​4​​），分别表示节点总数和边的总条数。接下来M行每一行通过给出一条边的两个顶点编号（从0到N-1）来描述一条边。
在图后面，给出一个正整数K (≤ 100)，表示查询个数。接下来K行查询，每一行按照以下格式：

N_​v v[1] v[2]⋯v[N_v]
N_v表示该顶点集的顶点数，v[i]为顶点的编号。

Output Specification:

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

翻译：对于每个查询，如果是点覆盖集则输出一行Yes否则输出No。

---

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

---

解题思路

先用Hash表记录顶点集，然后依次判断每条边是否有一个顶点在顶点集中，如果没有直接跳出循环并输出No。注意每次都要重置Hash表。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<algorithm>
#define INF 99999999
#define bug puts("Hello\n")
using namespace std;
int Hash[10010];
int Edge[10010][2];
int N,M,K; 
int main(){
	scanf("%d%d",&N,&M); 
	for(int i=0;i<M;i++){
		scanf("%d%d",&Edge[i][0],&Edge[i][1]);
	}
	scanf("%d",&K);
	int Nv;
	for(int k=0;k<K;k++){
		scanf("%d",&Nv);
		int tmp;
		memset(Hash,0,sizeof(Hash));
		for(int i=0;i<Nv;i++){
			scanf("%d",&tmp);
			Hash[tmp]=1;
		}
		int i;
		for(i=0;i<M;i++){
			if(Hash[Edge[i][0]]||Hash[Edge[i][1]]);
			else break;
		}
		if(i==M)printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}