PAT A1134

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

总的来说就是给出M条边和K个集合，判断每个集合是否包含所有的边。

代码如下：

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;

int N,M,K;
vector<int> child[10010];
int edge[10010][10010]={0};
bool vis[10010]={false};

void check()
{
    bool flag=true;
    for(int i=0;i<N;i++) //此处为N，表示遍历所有的边判断是否都被访问
    {
        if(vis[i]==false)
        {
            flag=false;
            break;
        }
    }

    if(flag==true) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
}

int main()
{
    cin>>N>>M;
    for(int i=0;i<M;i++)
    {
        int a,b;
        cin>>a>>b;
        child[a].push_back(i);  //表示为点a包含第i条边
        child[b].push_back(i);  //表示为点b包含第i条边
    }
    cin>>K;
    for(int i=0;i<K;i++)
    {
        for(int j=0;j<N;j++) vis[j]=false;
        int num;
        cin>>num;
        for(int j=0;j<num;j++)
        {
            int now;
            cin>>now;
            for(int k=0;k<child[now].size();k++)
                vis[child[now][k]]=true;
        }
        check();
    }
    return 0;
}