可达性统计（bitset + topsort）

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

obss666

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

阅读量63

点赞数 1

文章标签： c++ 算法蓝桥杯

本文链接：https://blog.csdn.net/obss666/article/details/126670252

版权

AcWing 164. 可达性统计 - AcWing

#include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;
const int N = 3e4 + 10;
bitset<N> f[N];
int n, m;
int du[N];
vector<vector<int>> v(N);
vector<int> res;

void topsort() {
    queue<int> q;
    for (int i = 1; i <= n; i++) {
        if (du[i] == 0) {
            q.push(i);
            res.push_back(i);
        }
    }
    while (q.size()) {
        int t = q.front();
        q.pop();
        for (int it : v[t]) {
            if (--du[it] == 0) {
                q.push(it);
                res.push_back(it);
            }
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    while (m--) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        du[b]++;
    }
    topsort();
    for (int i = n - 1; i >= 0; i--) {
        int j = res[i];
        f[j][j] = 1;
        for (auto it : v[j]) {
            f[j] |= f[it];
        }
    }
    for (int i = 1; i <= n; i++) cout << f[i].count() << endl;
}