POJ 3180 SCC 分解

题意

传送门 POJ 3180

题解

求节点数大于 $1$ 的强连通分量个数，通过两次 $DFS$ 进行强连通分量分解即可。

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define maxn 10005
int n, m, cmp[maxn];
vector<int> G[maxn], rG[maxn], vs;
bool used[maxn];

void add_edge(int u, int v)
{
    G[u].push_back(v);
    rG[v].push_back(u);
}

void dfs(int v)
{
    used[v] = 1;
    for (int i = 0; i < G[v].size(); i++)
    {
        int u = G[v][i];
        if (!used[u])
        {
            dfs(u);
        }
    }
    vs.push_back(v);
}

void rdfs(int v, int k, int &n)
{
    used[v] = 1, cmp[v] = k, ++n;
    for (int i = 0; i < rG[v].size(); i++)
    {
        int u = rG[v][i];
        if (!used[u])
        {
            rdfs(u, k, n);
        }
    }
}

int main()
{
    while (~scanf("%d%d", &n, &m))
    {
        vs.clear();
        for (int u = 0; u < n; u++)
        {
            G[u].clear();
            rG[u].clear();
        }
        for (int i = 0; i < m; i++)
        {
            int u, v;
            scanf("%d%d", &u, &v);
            --u, --v;
            add_edge(u, v);
        }
        memset(used, 0, sizeof(used));
        for (int u = 0; u < n; u++)
        {
            if (!used[u])
            {
                dfs(u);
            }
        }
        memset(used, 0, sizeof(used));
        int k = 0, cnt = 0, res = 0;
        for (int i = vs.size() - 1; i >= 0; i--)
        {
            int u = vs[i];
            if (!used[u])
            {
                cnt = 0;
                rdfs(u, k++, cnt);
                if (cnt > 1)
                {
                    ++res;
                }
            }
        }
        printf("%d\n", res);
    }
    return 0;
}