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, orNo
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条边,给出每条边的两个顶点的序号(0到n-1)。k次询问,每次询问包含cnt个顶点的点集合,若所有的边至少有一个顶点在这个集合里则输出yes,反之no 。
思路:二维向量v[a][i]表示点a所在的第i条边的序号,每次询问将包含该点的所有边的vis置为一,最后检查m条边的vis是否全为1
#include<bits/stdc++.h>
using namespace std;
vector<int> v[10005];
int vis[10005];
int main() {
int n,m,a,b,k,cnt;
scanf("%d %d",&n,&m);
for(int i=1; i<=m; i++) {
scanf("%d %d",&a,&b);
v[a].push_back(i);
v[b].push_back(i);
}
scanf("%d", &k);
while(k--) {
int flag=0;
memset(vis,0,sizeof vis);
scanf("%d",&cnt);
for(int i=1; i<=cnt; i++) {
scanf("%d",&a);
for(int j=0; j<v[a].size(); j++)
vis[v[a][j]]=1;
}
for(int i=1; i<=m; i++) {
if(vis[i]==0) {
flag=1;
printf("No\n");
break;
}
}
if(flag==0) printf("Yes\n");
}
return 0;
}