poj 2186 (tarjan 缩点)

题意：给出一个有向图，找到能被所有的点都能达到的点的个数。

思路：

首先他们都在一个联通块中。然后找出度为0的那个联通块，就是答案。

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 5e4 + 10;
const int N = 2;


struct Edge{int to,next;}edge[maxn];
int edge_num,cnt,col[maxn];
int head[maxn],dfn[maxn],low[maxn];
int st[maxn],top;
bool vis[maxn];
int num[maxn], in[maxn];

void Init()
{
    clr(head,-1);clr(dfn,0);clr(low,0);edge_num = cnt = top = 0;clr(vis,false);clr(num,0);clr(in,0);
}
void add_edge(int x,int y){edge[edge_num] = (Edge){y,head[x]};head[x] = edge_num ++;}


void tarjan(int u,int &len)
{
    vis[u] = true;dfn[u] = low[u] = len;st[ ++ top] = u;
    for(int i = head[u];i != -1; i = edge[i].next)
    {
        int v = edge[i].to;
        if(!dfn[v])
        {
            tarjan(v,++ len);low[u] = min(low[u],low[v]);
        }
        else if(vis[v])low[u] = min(low[u],dfn[v]);
    }
    if(dfn[u] == low[u])
    {
        col[u]  = ++cnt;vis[u] = false;num[cnt] ++;
        while(st[top --] != u)
        {
            int x = st[top + 1];num[cnt] ++;
            vis[x] = false;col[x] = cnt;
        }
    }
}

//vector<int>g[maxn];
int main()
{
    int n,m;
    while( ~ scanf("%d%d",&n,&m))
    {
        Init();//for(int i = 0; i <= n; i ++)g[i].clear();
        for(int i = 1; i <= m; i ++){int x,y;scanf("%d%d",&x,&y);add_edge(x,y);}
        for(int i = 1; i <= n; i ++)if(!dfn[i]){int len = 1;tarjan(i,len);}
        for(int u = 1; u <= n; u ++)
        {
            for(int i = head[u];i != -1;i = edge[i].next)
            {
                int v = edge[i].to;int xx = col[u],yy = col[v];
                if(xx != yy)in[xx] ++;
            }
        }

        int cnts = 0,pos;
        for(int i = 1; i <= cnt; i ++)
        {
            if(in[i] == 0)
            {
                cnts ++;pos = i;
            }
        }
        if(cnts > 1)puts("0");
        else printf("%d\n",num[pos]);
    }
    return 0;
}