solution1
#include<iostream>
#include<string.h>
using namespace std;
const int N = 1e4 + 10, maxn = 1e5;
struct pairs{
int x, y;
}p[N];
int flag[maxn];
int main(){
int n, m, k, ans, x;
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++){
scanf("%d%d", &p[i].x, &p[i].y);
}
while(m--){
ans = 1;
memset(flag, 0, sizeof(flag));
scanf("%d", &k);
for(int i = 0; i < k; i++){
scanf("%d", &x);
flag[x] = 1;
}
for(int i = 0; i < n; i++){
if(flag[p[i].x] == 1 && flag[p[i].y] == 1){
ans = 0;
break;
}
}
printf("%s\n", ans ? "Yes" : "No");
}
return 0;
}
or
#include<iostream>
using namespace std;
const int N = 1e4 + 10, maxn = 1e5;
struct pairs{
int x, y;
}p[N];
int main(){
int n, m, k, ans, x;
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++){
scanf("%d%d", &p[i].x, &p[i].y);
}
while(m--){
ans = 1;
int flag[maxn] = {0};
scanf("%d", &k);
for(int i = 0; i < k; i++){
scanf("%d", &x);
flag[x] = 1;
}
for(int i = 0; i < n; i++){
if(flag[p[i].x] == 1 && flag[p[i].y] == 1){
ans = 0;
break;
}
}
printf("%s\n", ans ? "Yes" : "No");
}
return 0;
}
solution2
#include<iostream>
#include<map>
#include<vector>
using namespace std;
const int maxn = 1e5, N = 1010;
int main(){
int n, m, k, p1, p2, ans, x;
map<int, vector<int> > mp;
scanf("%d%d", &n, &m);
while(n--){
scanf("%d%d", &p1, &p2);
mp[p1].push_back(p2);
mp[p2].push_back(p1);
}
while(m--){
ans = 1;
int flag[maxn] = {0}, a[N];
scanf("%d", &k);
for(int i = 0; i < k; i++){
scanf("%d", a + i);
flag[a[i]] = 1;
}
for(int i = 0; i < k; i++){//对于每个物品
for(int j = 0; j < mp[a[i]].size(); j++){//检查与之配对的不兼容物品是否出现过
if(flag[mp[a[i]][j]]){//若出现过,则不安全,退出
ans = 0;
break;
}
}
}
printf("%s\n", ans ? "Yes" : "No");
}
return 0;
}