AcWing 1627. 顶点覆盖
原题链接
简单
作者:
RainSure
,
2022-02-28 23:15:27
,
所有人可见
,
阅读 164
做简单题多是一件美事啊
#include<iostream>
#include<cstring>
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
const int maxn = 10010;
bool st[maxn];
PII edges[maxn];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 0; i < m; i ++){
cin >> edges[i].x >> edges[i].y;
}
int k; cin >> k;
while(k --)
{
memset(st, 0, sizeof st);
int cnt; cin >> cnt;
while(cnt --)
{
int x; cin >> x;
st[x] = true;
}
bool flag = true;
for(int i = 0; i < m; i ++)
{
if(!st[edges[i].x] && !st[edges[i].y]){
flag = false;
break;
}
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}