PAT A1134 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.

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 <stdio.h>
 #include <string>
 #include <iostream>
 #include <algorithm>
 #include <vector>
 #include <string.h>
 using namespace std;
 const int maxn=;
 vector<int> adj[maxn];
 //int g[maxn][maxn],sav[maxn][maxn];
 int vis[maxn];
 int n,m,k;
 int main(){
   scanf("%d %d",&n,&m);
   for(int i=;i<m;i++){
     int c1,c2;
     scanf("%d %d",&c1,&c2);
     adj[c1].push_back(c2);
     adj[c2].push_back(c1);
     //g[c1][c2]=1;
     //g[c2][c1]=1;
   }
   scanf("%d",&k);
   while(k--){
       int j;
       scanf("%d",&j);
       int cnt=;
       //memcpy(sav,g,sizeof(g));
       fill(vis,vis+maxn,);
       for(int i=;i<j;i++){
           int v;
           scanf("%d",&v);
         vis[v]=;
           for(int q=;q<adj[v].size();q++){
               if(vis[adj[v][q]]==){
                   cnt++;
             }
         }
     }
     if(cnt==m)printf("Yes\n");
     else printf("No\n");
   }
 }

注意点：题目读了很久画出来才看懂，就是看给定的点集能不能包含这个图的所有边。

思路就是直接遍历一个点的所有边，把这个点的边条数记录下来，同时记录下这个点，后面有再包含这个边的不能重复计算，遍历完所有点边条数和输入时相等就是yes。

一开始想用二维数组，感觉判断会方便一些，结果又超时又超内存，10的四次方这个级别还是不能用邻接表实现。只有几百的时候可以用邻接表。