1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
| #include <bits/stdc++.h> using namespace std;
namespace __main__ { const int maxn = 2e5; int n, m, tot, dfn[maxn + 3], o[maxn + 3], dep[maxn + 3]; int fa[maxn + 3], num[maxn + 3], lnk[maxn + 3], cnt[maxn + 3]; int sdom[maxn + 3], idom[maxn + 3], ans[maxn + 3]; vector<int> G[maxn + 3], T[maxn + 3], B[maxn + 3], D[maxn + 3];
void add(int u, int v) { G[u].push_back(v); B[v].push_back(u); }
void dfs(int u) { dfn[u] = ++tot, o[tot] = u; D[dep[u]].push_back(u); for (int i = 0, v; i < G[u].size(); i++) { v = G[u][i]; if (dfn[v]) continue; T[u].push_back(v); dep[v] = dep[u] + 1; dfs(v); } }
int min_1(int a, int b) { if (!a || !b) return a | b; return dfn[a] < dfn[b] ? a : b; }
int min_2(int a, int b) { return dfn[sdom[a]] < dfn[sdom[b]] ? a : b; }
int find(int x) { if (fa[x] == x) { return x; } int y = fa[x]; fa[x] = find(y); if (y != fa[x]) { num[x] = min_2(num[x], num[y]); } return fa[x]; }
void main() { scanf("%d %d", &n, &m); for (int u, v, i = 1; i <= m; i++) { scanf("%d %d", &u, &v); add(u, v); } dep[1] = 1; dfs(1); for (int i = 1; i <= n; i++) { fa[i] = i; } for (int i = n, u; i; i--) { u = o[i]; for (int j = 0, v; j < B[u].size(); j++) { v = B[u][j]; sdom[u] = min_1(sdom[u], v); find(v); sdom[u] = min_1(sdom[u], min_1(sdom[num[v]], sdom[num[fa[v]]])); } num[u] = u; for (int j = 0; j < T[u].size(); j++) { fa[T[u][j]] = u; } } for (int i = 1; i <= n; i++) { cnt[dep[sdom[i]]]++; } for (int i = n; i; i--) { cnt[i] += cnt[i + 1]; } for (int i = 1; i <= n; i++) { o[cnt[dep[sdom[i]]]--] = i; } for (int i = 1; i <= n; i++) { fa[i] = i; } int p = n + 1; for (int i = 1, u; i <= n; i++) { u = o[i]; while (p > dep[sdom[u]]) { p--; for (int j = 0, v; j < D[p].size(); j++) { v = D[p][j], num[v] = v; for (int k = 0; k < T[v].size(); k++) { fa[T[v][k]] = v; } } } find(u); if (sdom[num[u]] == sdom[u]) { idom[u] = sdom[u]; } else { lnk[u] = num[u]; } } idom[1] = 0; for (int i = 1; i <= n; i++) { for (int j = 0, u; j < D[i].size(); j++) { u = D[i][j]; if (!idom[u]) { idom[u] = idom[lnk[u]]; } } } for (int i = 1; i <= n; i++) { ans[i] = 1; } for (int i = n; i; i--) { for (int j = 0, u; j < D[i].size(); j++) { u = D[i][j]; ans[idom[u]] += ans[u]; } } for (int i = 1; i <= n; i++) { printf("%d%c", ans[i], " \n"[i == n]); } } }
int main() { __main__::main(); return 0; }
|