POJ 2186 Popular Cows 强联通分量
题目链接:
POJ 2186 Popular Cows
题意:给定N个顶点M条边的有向图。边具有传递性。如A到B连通,B到C连通,那么A到C也是连通的。求有多少个顶点满足其他所有顶点到该顶点都连通。
思路:先求出强联通分量,缩点,强连通分量内所有的点都是相互连通的,然后所有的缩点构成一个DAG(有向无环图),如果图中要存在顶点满足其他所有顶点到该顶点都连通,那么缩点构成的DAG就必须是一条链表,即不存在分支节点。然后我们只需要找出出度为的0缩点,求出该缩点对应的强连通分量中包含点的个数。
#include <cmath>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
using namespace std;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
#define fst first
#define snd second
typedef __int64 LL;
//typedef long long LL;
typedef unsigned int uint;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int MAXN = 10000 + 5;
const int MAXM = 50000 + 5;
vector<int> G1[MAXN], G2[MAXN];
int mark1[MAXN], cnt1;
int mark2[MAXN], cnt2;
bool vis[MAXN];
int N, M, A, B;
/**
* 后序DFS遍历给图中每个顶点编号
*
*/
void dfs1(int u) {
int v = -1;
vis[u] = true;
for (int i = 0; i < G1[u].size(); i++) {
v = G1[u][i];
if (!vis[v]) dfs1(v);
}
mark1[++cnt1] = u;
}
/**
* 按照编号对逆图DFS求出强连通分量
*
*/
void dfs2(int u, int id) {
int v = -1;
vis[u] = true;
mark2[u] = id;
for (int i = 0; i < G2[u].size(); i++) {
v = G2[u][i];
if (!vis[v]) dfs2(v, id);
}
}
int main() {
#ifndef ONLINE_JUDGE
FIN;
#endif // ONLINE_JUDGE
while (~scanf("%d %d", &N, &M)) {
for (int i = 1; i <= N; i ++) {
G1[i].clear();
G2[i].clear();
}
for (int i = 0; i < M; i++) {
scanf("%d %d", &A, &B);
G1[A].push_back(B);
G2[B].push_back(A);
}
memset(vis, false, sizeof(vis));
cnt1 = 0;
for (int i = 1; i <= N; i++) {
if (!vis[i]) dfs1(i);
}
memset(vis, false, sizeof(vis));
cnt2 = 0;
for (int i = cnt1; i > 0; i--) {
if (!vis[mark1[i]]) dfs2(mark1[i], ++cnt2);
}
int u = -1, num = 0;
// 找出一个缩点构成的DAG中出度为0的缩点
// 以及该缩点对应的强连通分量中包含的顶点个数
for (int i = 1; i <= N; i++) {
if (mark2[i] == cnt2) {
u = i;
num ++;
}
}
memset(vis, false, sizeof(vis));
// 判断从该点出发在逆图中DFS判断是否可以到达其他所有顶点
dfs2(u, -1);
for (int i = 1; i <= N; i++) {
if (~mark2[i]) {
num = 0;
break;
}
}
printf("%d\n", num);
}
return 0;
}