1149 Dangerous Goods Packaging (25分)

#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>
using namespace std;
const int SIZE = 1000000;
vector<int> vt[SIZE];
int order[SIZE];
int main() {
    int N, M, first, second, K;
    cin >> N >> M;
    for (int i = 0; i < N; i ++) {
        cin >> first >> second;
        vt[first].push_back(second);
        vt[second].push_back(first);
    }
    for (int i = 0; i < M; i ++) {
        int K;
        cin >> K;
        for (int i = 0; i < K; i ++) {
            cin >> order[i];
        }
        bool flag = false;
        for (int i = 0; i < K; i ++) {
            if (vt[order[i]].size() == 0) continue;
            for (int j = 0; j < K; j ++) {
                if (count(vt[order[i]].begin(), vt[order[i]].end(), order[j])) {
                    flag = true;
                    break;
                }
            }
            if (flag)   break;
        }
        if (flag)   cout << "No" << endl;
        else cout << "Yes" << endl;
    }
    return 0;
}