PAT 1134 Vertex Cover（25 分）

最新推荐文章于 2021-06-20 20:09:05 发布

chenxli23

最新推荐文章于 2021-06-20 20:09:05 发布

阅读量193

点赞数

本文链接：https://blog.csdn.net/Hickey_Chen/article/details/81613237

版权

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 104), 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:

Nv v[1] v[2]⋯v[Nv]

where Nv 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

思路：图的每一条边都与两个节点相联系，考察图中的所有边，看看他所联系的两个节点是否至少有一个在给出的点集上，如果是，则该点集是覆盖节点集；一开始用二维数组保存边，内存不够；后来声明一个结构体保存边的两个节点。在查找时，一开始点集用vector保存，所以用了find函数，超时；改用set保存点集，用count函数判断边的节点是否在点集中。

程序：

#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
struct edge
{
  int start,end;
};
int main()
{
  int n,m;
  scanf("%d%d",&n,&m);
  vector<edge> arr;
  for(int i = 0; i < m; i++)
  {
    int a,b;
    scanf("%d%d",&a,&b);
    edge e;
    e.start = a;
    e.end = b;
    arr.push_back(e);
  }
  int k;
  scanf("%d",&k);
  for(int i = 0; i < k; i++)
  {
    int len;
    scanf("%d",&len);
    set<int> temp;
    int found = 0;
    for(int j = 0; j < len; j++)
    {
      int num;
      scanf("%d",&num);
      temp.insert(num);
    }
    for(int j = 0; j < m; j++)
    {
      int a = arr[j].start;
      int b = arr[j].end;
      if(temp.count(a) != 0)
        found++;
      else if(temp.count(b) != 0)
        found++;
      // if(find(temp.begin(),temp.end(),a) != temp.end())
      //   found++;
      // else if(find(temp.begin(),temp.end(),b) != temp.end())
      //   found++;
    }
    if(found == m)
      printf("Yes\n");
    else
      printf("No\n");
  }
  return 0;
}