ZOJ 3811 zoj 3811 Untrusted Patrol牡丹江网络赛C题

去年的比赛题目,今年才搞懂AC了＝＝＝||

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;

const int inf = 0x3f;
const int INF = 0x3f3f3f3f;
const int maxn = 100005;
int N, M, K, L;
bool sen[maxn], visit[maxn];
int pass[maxn];
int f[maxn];
vector <int>G[maxn];
queue <int> q;

int find(int x)
{
    return x == f[x] ? x : f[x] = find(f[x]);
}
void Union(int x, int y)
{
    int fx = find(x), fy = find(y);

    if (fx == fy)
    {
        return ;
    }

    if (fx > fy)
    {
        swap(fx, fy);
    }

    f[fx] = fy;
}

bool BFS(int start)
{
    while (!q.empty())
    {
        q.pop();
    }

    q.push(start);

    visit[start] = true;

    while (!q.empty())
    {
        int now, next;
        now = q.front();
        q.pop();

        for (int i = 0; i < G[now].size(); i++)
        {
            next = G[now][i];

            //printf("start = %d, next = %d
", start, next);
            if (visit[next])
            {
                continue;
            }

            visit[next] = true;
            //如果是传感器不会入队列,但是要标记为 访问过
            if (sen[next])
            {
                continue;
            }
            q.push(next);
        }
    }

    return false;
}

bool slove()
{
    if(K == 0) return true;
    if(K != L) return false;

    for (int i = 0; i < L - 1; i++)
    {
        BFS(pass[i]);
        if(!visit[pass[i+1]]) return false;
    }
    BFS(pass[L-1]);

    for(int i = 1; i <= N; i++) //检查所有点是否都被访问了
        if(!visit[i])
            return false;
    return true;

}
int main()
{
    int t;
    scanf("%d", &t);

    while (t--)
    {
        memset(sen, false, sizeof(sen));
        memset(visit, false, sizeof(visit));

        int x, y, f = 0;
        scanf("%d %d %d", &N, &M, &K);

        for(int i = 1; i <= N; i++)
            G[i].clear(); //千万不要忘记清空啊

        for (int i = 0; i < K; i++)
        {
            scanf("%d", &x);
            sen[x] = true;
        }

        for (int i = 0; i < M; i++)
        {
            scanf("%d %d", &x, &y);
            G[x].push_back(y);
            G[y].push_back(x);
        }

        scanf("%d", &L);

        for (int i = 0; i < L; i++)
        {
            scanf("%d", &pass[i]);
        }


        if (!slove())
        {
            puts("No");
        }
        else
        {
            puts("Yes");
        }
    }
}