POJ-2186-Popular Cows（Tarjan求强连通分量+缩点）

Popular Cows

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 43129		Accepted: 17543

Description

Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell you that cow A thinks that cow B is popular. Since popularity is transitive, if A thinks B is popular and B thinks C is popular, then A will also think that C is 
popular, even if this is not explicitly specified by an ordered pair in the input. Your task is to compute the number of cows that are considered popular by every other cow. 

Input

* Line 1: Two space-separated integers, N and M 

* Lines 2..1+M: Two space-separated numbers A and B, meaning that A thinks B is popular. 

Output

* Line 1: A single integer that is the number of cows who are considered popular by every other cow. 

Sample Input

3 3
1 2
2 1
2 3

Sample Output

1

题解：强联通分量缩点

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<cmath>
#define N 10005
#define M 50005
using namespace std;
int n,m,c,index,tot,sum,k,ans;
int head[N],low[N],dfn[N],belong[N],out[N];
bool vis[N];
stack<int>s;
struct ljh
{
	int to,next;
}e[M];
inline void init()
{
	k=0;
	c=0;
	index=0;
	tot=0;
	ans=0;
	memset(head,-1,sizeof(head));
	memset(dfn,0,sizeof(dfn));
	memset(low,0,sizeof(low));
	memset(belong,0,sizeof(belong));
	memset(vis,0,sizeof(vis));
	memset(out,0,sizeof(out));
}
inline void add(int x,int y)
{
	e[c].next=head[x];
	e[c].to=y;
	head[x]=c++;
}
void Tarjan(int x)
{
	low[x]=dfn[x]=++tot;
	s.push(x);
	vis[x]=1;
	for(int i=head[x];i!=-1;i=e[i].next)
	{
		int v=e[i].to;
		if(!low[v])
		{
			Tarjan(v);
			low[x]=min(low[x],low[v]);
		}
		else if(vis[v]==1)low[x]=min(low[x],dfn[v]);
	}
	if(low[x]==dfn[x])
	{
		int nex;
		index++;
		do
		{
			nex=s.top();
			s.pop();
			vis[nex]=0;
			belong[nex]=index;
		}while(!s.empty()&&nex!=x);
	}
	return;
}
int main()
{
	while(~scanf("%d%d",&n,&m))
	{
		init();
		for(int i=1;i<=m;i++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			add(x,y);
		}
		for(int i=1;i<=n;i++)
			if(!dfn[i])
			{
				Tarjan(i);
			}
		for(int i=1;i<=n;i++)
			for(int j=head[i];j!=-1;j=e[j].next)
				if(belong[i]!=belong[e[j].to])
				{
					out[belong[i]]++;
				}
		for(int i=1;i<=index;i++)
			if(!out[i])
			{
				k++;
				sum=i;
			}
		if(k==1)
		{
			for(int i=1;i<=n;i++)
				if(belong[i]==sum)
					ans++;
			printf("%d\n",ans);
		}
		else printf("0\n");
	}
}