1122 Hamiltonian Cycle (25 分)

#pragma warning(disable:4996)
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cmath>
#include <string>
using namespace std;
vector<int> edge[210];
int main()
{
    int n, m, k;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    cin >> k;
    for (int i = 0; i < k; ++i) {
        int num;
        cin >> num;
        vector<int> v(num);
        set<int> s;
        for (int j = 0; j < num; ++j) {
            cin >> v[j];
        }
        int flag = 0;
        if (n == num-1) 
            if (v.front() == v.back())
                for (int i = 1; i < v.size(); ++i) {
                    if (find(edge[v[i - 1]].begin(), edge[v[i - 1]].end(), v[i]) == edge[v[i - 1]].end()) {
                        flag = 1;
                        break;
                    }
                }
            else flag = 1;
        else flag = 1;
        if(!flag)
            for (int i = 0; i < v.size() - 1; ++i) {
                if (s.find(v[i]) != s.end()) {
                    flag = 1;
                    break;
                }
                else {
                    s.insert(v[i]);
                }
            }
        if (!flag) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}