L2-025 分而治之 (25 分)

原题链接

#include <bits/stdc++.h>
using namespace std;
vector<int> q[11111];
int vis[11111];
int a, b;
int n, m;
int book[11111];
int judge()
{
    for (int i = 1; i <= n; i++)
    {
       if (book[i])
        {
            continue;
        }

        for (int j = 0; j < q[i].size(); j++)
        {
            if (book[q[i][j]] == 0)
                return 0;
        }
    }
    return 1;
}
int main()
{

    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> a >> b;
        q[a].push_back(b);
        q[b].push_back(a);
    }
    int num, x, k;
    cin >> num;
    while (num--)
    {
        memset(book, 0, sizeof(book));
        cin >> k;
        for (int i = 1; i <= k; i++)
        {
            cin >> x;

            book[x] = 1;
        }
        if (!judge())
        {
            cout << "NO" << endl;
        }
        else
        {
            cout << "YES" << endl;
        }
    }
}