|动态二维数组vector遍历 set find|1149 Dangerous Goods Packaging (25分)

link

#include <iostream>
#include <vector>
#include <set>
using namespace std;
int const maxn = 100010;

vector<int>v[maxn];
set<int>s;

int main() {
	int n, m;
	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		int a, b;
		cin >> a >> b;
		v[a].push_back(b);
		v[b].push_back(a);
	}

	for (int i = 0; i < m; i++) {
		int k;
		cin >> k;
		
		bool flag = true;//能兼容
		s.clear();
		for (int j = 0; j < k; j++) {
			int tmp;
			cin >> tmp;
			s.insert(tmp);
		}
		set<int>::iterator it;
		for (it = s.begin(); it != s.end();it++) {
			for (int j = 0; j < v[*it].size(); j++) {
				if (s.find(v[*it][j]) != s.end())
					flag = false;
			}
		}
		if (flag == false)
			cout << "No" << endl;
		else
			cout << "Yes" << endl;
	}
	return 0;
}