PAT甲级 1134

最新推荐文章于 2024-07-16 16:14:57 发布

YOUN尔

最新推荐文章于 2024-07-16 16:14:57 发布

阅读量271

点赞数

文章标签： PAT

本文链接：https://blog.csdn.net/wx960421/article/details/86606974

版权

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

题意：给定结点数目n和边数m，后m行给出边的结点，之后一行给出结点序列数量k，之后k行给出结点数目和结点，问给定的图中的结点是否至少有一个出现在结点序列中，若是则输出Yes，否则输出No

解题思路：用vector v[n]保存某结点属于的某条边的编号。对于每一个集合做判断，遍历集合中的每一个元素，将当前元素能够属于的边的编号i对应的hash[i]标记为1，表示这条边是满足有一个结点出自集合S中的。最后判断hash数组中的每一个值是否都是1，如果有不是1的，说明这条边的两端结点没有一个出自集合S中。

#include <iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,m,k,nv,a,b,num;
    cin>>n>>m;
    vector<int> v[n];
    for(int i=0; i<m; i++)
    {
        cin>>a>>b;
        //记录结点属于哪条边
        v[a].push_back(i);
        v[b].push_back(i);
    }
    cin>>k;
    for(int i=0; i<k; i++)
    {
        cin>>nv;
        int f=0;
        //将hash初始化为0
        vector<int> hash(m,0);
        for(int t=0; t<nv; t++)
        {
            cin>>num;
            //v[num].size()是记录num属于几条边
            for(int j=0; j<v[num].size(); j++)
            {
                //查看结点是否有属于的边
                hash[v[num][j]]=1;
            }
        }
        for(int i=0; i<m; i++)
        {
            if(hash[i]==0)
            {
                cout<<"No"<<endl;
                f=1;

                break;//不可少
            }


        }
        if(f==0)
            cout<<"Yes"<<endl;
    }
    return 0;
}