hdu 1269 迷宫城堡

Problem

acm.hdu.edu.cn/showproblem.php?pid=1269

Meaning

给一个有向图，问是否强连通。

Analysis

Tarjan 模板题。
跑一遍 Tarjan 求图的强连通分量个数，看是不是只有一个。

Code

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
const int N = 10000, M = 100000;

int head[N+1], to[M], nxt[M];

void add_edge(int f, int t, int sz)
{
    to[sz] = t;
    nxt[sz] = head[f];
    head[f] = sz;
}

int dfn[N+1], low[N+1], tm, num;
bool instk[N+1];
stack<int> stk;

void tarjan(int now)
{
    dfn[now] = low[now] = ++tm;
    stk.push(now);
    instk[now] = true;
    for(int i = head[now]; ~i; i = nxt[i])
        if(!dfn[to[i]])
        {
            tarjan(to[i]);
            low[now] = min(low[now], low[to[i]]);
        }
        else if(instk[to[i]])
            low[now] = min(low[now], dfn[to[i]]);

    if(dfn[now] == low[now])
    {
        ++num;
        int t;
        do
        {
            t = stk.top();
            stk.pop();
            instk[t] = false;
        } while(t != now);
    }
}

int main()
{
    int n, m;
    while(scanf("%d%d", &n, &m), n || m)
    {
        memset(head, -1, sizeof head);
        for(int f, t, sz = 0; m--; ++sz)
        {
            scanf("%d%d", &f, &t);
            add_edge(f, t, sz);
        }
        memset(dfn, 0, sizeof dfn);
        memset(instk, false, sizeof instk);
        tm = num = 0;
        for(int i = 1; i <= n; ++i)
            if(!dfn[i])
                tarjan(i);
        puts(num == 1 ? "Yes" : "No");
    }
    return 0;
}