L2-025 分而治之 (25 分)

#include<iostream>
#include<functional>
#include<unordered_map>
#include<vector>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(n+1);
    for (int i = 0; i < m;++i){
        int u, v;
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }

    int k;
    cin >> k;
    for (int i = 0; i < k;++i){
        int np;
        cin >> np;
        unordered_map<int, int> mp;
        for (int j = 0; j < np;++j){
            int x;
            cin >> x;
            mp[x] = 1;
        }
        int ff = 1;
        for (int j = 1; ff&&j <= n;++j){
            if(mp.count(j))
                continue;
            for(auto v:a[j]){
                if(mp.count(v)==0){
                    ff = 0;
                    break;
                }
            }
        }       
        puts(ff==1 ? "YES" : "NO");
    }
}