pat1122 Hamiltonian Cycle

题意：输入一个图，输入q个询问，每个询问给出一条路径，问这条路径是否是哈密顿回路。

思路：记录边，把给的路径走一遍就好。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>

using namespace std;
typedef pair<int, int> P;

int V, E, x, y;
int Q, N, s, e;
set<P> st;

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    scanf("%d %d", &V, &E);
    for (int i = 0; i < E; i++) {
        scanf("%d %d", &x, &y);
        st.insert(make_pair(x, y));
        st.insert(make_pair(y, x));
    }
    scanf("%d", &Q);
    while (Q--) {
        scanf("%d", &N);
        set<int> sp;
        for (int i = 1; i <= V; i++)  {
            sp.insert(i);
        }
        bool flag = true;
        s = e = -1;
        int past = -1;
        for (int i = 0; i < N; i++) {
            scanf("%d", &x);
            if (i == 0) {s = x; past = x;}
            else {
                if (!st.count(make_pair(past, x))) {
                    flag = false;
                }
                past = x;
            }
            if (i == N-1) e = x;
            if (sp.count(x)) sp.erase(x);
            else if (i != N-1) flag = false;
        }
        if (s != e) flag = false;
        if (sp.size() != 0) flag = false;
        if (flag) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}