进入 Hamiltonian Cycle判断可以提前判断给的个数是不是n + 1,若不是那么肯定不会放问到每一个节点并且回到原来的节点。
#include <bits/stdc++.h>
using namespace std;
int G[220][220];
bool vis[220];
//可能输入路线大于n
int main() {
int n, m, k, x, a, b;
scanf ("%d %d", &n, &m);
for (int i = 0; i < m; i++) {
scanf ("%d %d", &a, &b);
G[a][b] = G[b][a] = 1;
}
scanf ("%d", &k);
for (int i = 0; i < k; i++) {
scanf ("%d", &x);
vector<int> v(x);
for (int j = 0; j < x; j++) {
scanf ("%d", &v[j]);
}
if (x == n + 1) {
fill (vis, vis + 220, false);
int cnt = 0, start = v[0];
for (int j = 1; j < v.size(); j++) {
if (G[start][v[j]] == 1 && !vis[v[j]]) {
vis[v[j]] = true;
cnt++;
}
start = v[j];
}
// cout << cnt << endl;
if (cnt == n && start == v[0]) printf ("YES\n");
else printf ("NO\n");
}
else
printf("NO\n");
}
}