#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
const int MAX = 210, INF = 1<<30;
int N, M, A, B, K, X;
bool G[MAX][MAX] = {0};
int main()
{
scanf("%d %d", &N, &M);
for(int i=0; i<M; i++)
{
scanf("%d %d", &A, &B);
G[A][B] = G[B][A] = 1;//表示AB之间有路
}
scanf("%d", &K);
for(int i=0, j, t; i<K; i++)
{
vector<int> S;
scanf("%d", &X);
for(j=0; j<X; j++)
{
scanf("%d", &t);
S.push_back(t);
}
if(X == N+1 && S[0] == S[X-1])
{
bool visited[MAX] = {0};
visited[S[0]] = 1;//首顶点已访问
for(j=1; j<X && G[S[j]][S[j-1]] && !visited[S[j]]; j++)
{
visited[S[j]] = 1;//接下来的顶点置为已访问
}
if(j != X-1 || !G[S[j]][S[j-1]]) printf("NO\n");//若提前形成了回路,或者两顶点间未形成回路
else printf("YES\n");
}
else printf("NO\n");//路径上的节点个数不满足要求,或者首尾不同、没有形成回路
}
return 0;
}
PAT (Advanced Level) Practice A1122 Hamiltonian Cycle (25 分)(无向图、简单回路)
最新推荐文章于 2021-06-01 19:49:15 发布