pat 1122. Hamiltonian Cycle (25)

https://www.patest.cn/contests/pat-a-practise/1122

参考了：http://www.liuchuo.net/archives/2748

#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;
int ** graph;
bool isConnected(int *v, int n) {
	int pre = v[0];
	for (int i = 1; i < n; i++)
	{
		if (graph[pre][v[i]] != 1) return false;
		pre = v[i];
	}
	return true;
}

bool isHamilton(int *v, int n) {
	if (v[0] != v[n - 1]) return false;
	int * times = new int[n];
	fill(times,times+n,0);
	for (int i = 0; i < n; i++)
	{
		times[v[i]]++;
	}
	//check every node visit-times
	for (int i = 1; i < n; i++)
	{
		if (i == v[0]) {
			if (times[i] != 2) return false;
		}
		else {
			if (times[i] != 1) return false;
		}
	}
	return true;
}

int main()
{
	int n, m,a,b;
	scanf("%d %d", &n, &m);
	graph = new int*[n + 1];
	for (int i = 0; i <=n; i++)
	{
		graph[i] = new int[n + 1];
	}
	for (int i = 0; i <=n ; i++)
	{
		for (int j = 0; j <=n ; j++)
		{
			graph[i][j] = 0;
		}
	}
	for (int i = 0; i < m; i++)
	{
		scanf("%d %d", &a, &b);
		graph[a][b] = graph[b][a] = 1;
	}
	int k = 0;
	scanf("%d", &k);
	for (int i = 0; i < k; i++)
	{
		int kn = 0;
		scanf("%d", &kn);
		int * v = new int[kn];
		for (int j = 0; j < kn; j++)
		{
			scanf("%d", &v[j]);
		}
		if (kn == n + 1 && isConnected(v, kn) && isHamilton(v, kn)) printf("YES\n");
		else printf("NO\n");
	}
    return 0;
}