洛谷P2863[USACO06JAN]牛的舞会The Cow Prom——强连通分量

最新推荐文章于 2023-10-01 16:08:16 发布

hao_zong_yin

最新推荐文章于 2023-10-01 16:08:16 发布

阅读量207

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/hao_zong_yin/article/details/81546286

版权

图论专栏收录该内容

90 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
vector<int> G[maxn];
int n, m;
int deep, dfn[maxn], low[maxn], vis[maxn], stack[maxn], top;
int color[maxn], C, color_cnt[maxn];
void tarjan(int u) {
    dfn[u] = ++deep;
    low[u] = deep;
    vis[u] = 1;
    stack[++top] = u;
    for (int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if (!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else {
            if (vis[v]) {
                low[u] = min(low[u], low[v]);
            }
        }
    }
    if (dfn[u] == low[u]) {
        color[u] = ++C;
        vis[u] = 0;
        while (stack[top] != u) {
            color[stack[top]] = C;
            vis[stack[top--]] = 0;
        }
        top--;
    }
}
int main() {
    scanf("%d%d", &n, &m);
    int u, v;
    for (int i = 1; i <= m; i++) {
        scanf("%d%d", &u, &v);
        G[u].push_back(v);
    }
    for (int i = 1; i <= n; i++) {
        if (!dfn[i]) tarjan(i);
    }
    for (int i = 1; i <= n; i++) {
        color_cnt[color[i]]++;
    }
    int ans = 0;
    for (int i = 1; i <= C; i++) {
        if (color_cnt[i] > 1) ans++;
    }
    printf("%d\n", ans);
    return 0;
}