PTA——汉密尔顿回路

/*
 * @Description: 哈密尔顿回路
 * @version:
 * @Author:
 * @Date: 2021-04-01 18:44:40
 * @LastEditors: Please set LastEditors
 * @LastEditTime: 2021-04-01 19:15:46
 */
#include <iostream>
#include <set>
#include <vector>
using namespace std;
set<int> s[202];
bool check(vector<int> v, int node)
{
	// 不是回路
	if (v[0] != v[v.size() - 1])
		return false;
	vector<bool> visit;
	visit.push_back(false);
	for (int i = 0; i < node; i++)
		visit.push_back(false);
	for (int i = 0; i < v.size()-1; i++)
	{
		if (visit[v[i]] == true)
			// 已经被访问过一次
			return false;
		if (i < v.size() - 2 && s[v[i]].find(v[i + 1]) == s[v[i]].end())
			// v[i]->v[i + 1]路径不存在
			return false;
		visit[v[i]] = true;
	}
    if(s[v[v.size()-2]].find(v[0])==s[v[v.size()-2]].end())
        return false;
	for (int i = 1; i <= node; i++)
	{
		if (visit[i] == false)
			return false;
	}
	return true;
}
int main(void)
{
	int node, side;
	cin >> node >> side;
	for (int i = 0; i < side; i++)
	{
		int a, b;
		cin >> a >> b;
		s[a].insert(b);
		s[b].insert(a);
	}
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		int num;
		cin >> num;
		vector<int> v;
		for (int i = 0; i < num; i++)
		{
			int node2;
			cin >> node2;
			v.push_back(node2);
		}
		if (num - 1 < node)
			// 回路经过的点数减一比总点数还小，肯定不能经过所有点，必不是哈密顿回路
		{
			cout << "NO" << endl;
			continue;
		}
		if (check(v, node))
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	system("pause");
	return 0;
}