一本通1513：【例 1】受欢迎的牛

最新推荐文章于 2024-07-09 22:37:42 发布

我是小蒟蒻

最新推荐文章于 2024-07-09 22:37:42 发布

阅读量352

点赞数 9

文章标签：图论 c++ 算法

本文链接：https://blog.csdn.net/liu12345635/article/details/136425257

版权

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;

int h[N], e[N], ne[N], idx;
int dfn[N], low[N], tim;
int stk[N], tt;
bool in_stk[N];
int id[N], cnt, siz[N];
int dout[N];
int n, m;

void add(int a, int b) {
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

void tarjan(int u) {
    dfn[u] = low[u] = ++ tim;
    stk[++ tt] = u, in_stk[u] = true;

    for (int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];

        if (!dfn[j]) {
            tarjan(j);
            low[u] = min(low[u], low[j]);
        } else if (in_stk[j])
            low[u] = min(low[u], dfn[j]);
    }

    if (dfn[u] == low[u]) {
        int y;
        ++ cnt;

        do {
            y = stk[tt -- ];
            id[y] = cnt;
            in_stk[y] = false;
            siz[cnt] ++;
        } while (y != u);
    }
}

int main() {
    scanf("%d%d", &n, &m);
    memset(h, -1, sizeof h);

    for (int i = 0; i < m; i ++) {
        int a, b;
        scanf("%d%d", &a, &b);
        add(a, b);
    }

    for (int i = 1; i <= n; i ++)
        if (!dfn[i])
            tarjan(i);

    int sum = 0, zeros = 0;

    for (int i = 1; i <= n; i ++)
        for (int j = h[i]; j != -1; j = ne[j]) {
            int k = e[j];
            int a = id[i], b = id[k];

            if (a != b)
                dout[a] ++;
        }

    for (int i = 1; i <= cnt; i ++) {
        if (!dout[i]) {
            sum += siz[i];
            zeros ++;

            if (zeros > 1) {
                sum = 0;
                break;
            }
        }
    }

    cout << sum << endl;
    return 0;
}