The Cow Prom POJ - 3180
题意就是求强联通分量点数量大于等于2的个数。直接套Tarjan模板
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
const int maxx = 10010;
vector<int>E[maxx];
stack<int>s;
int hhh[maxx];
int cnt = 1;
int ans = 0;
int n, m;
int in[maxx];
int dfn[maxx], low[maxx];
int vis[maxx];
void tarjan(int x) {
dfn[x] = low[x] = cnt++;
s.push(x);
vis[x] = 1;
for (int i = 0; i < E[x].size(); i++) {
int v = E[x][i];
if (!dfn[v]) {
tarjan(v);
low[x] = min(low[x], low[v]);
}
else if (vis[v]) {
low[x] = min(low[x], dfn[v]);
}
}
if (dfn[x] == low[x]) {
ans++;
while (!s.empty()) {
int temp = s.top();
vis[x] = 0;
s.pop();
in[temp] = ans;
if (temp == x)break;
}
}
}
int main() {
while (cin >> n >> m) {
int count = 0;
memset(dfn, 0, sizeof(dfn));
memset(low, 0, sizeof(low));
memset(vis, 0, sizeof(vis));
memset(in, 0, sizeof(in));
memset(hhh, 0, sizeof(hhh));
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
E[x].push_back(y);
}
for (int i = 1; i <= n; i++) {
if (!dfn[i])tarjan(i);
}
for (int i = 1; i <= n; i++) {
hhh[in[i]]++;
}
for (int i = 1; i <= n; i++) {
if (hhh[i] >= 2) {
count++;
}
}
cout << count << endl;
}
return 0;
}