POJ-3660 Cow Contest 传递闭包

题目大意：牛之间有绝对的强弱，给出一些胜负关系，问有多少头牛可以确定其绝对排名。

解题思路：传递闭包（类似于floyd算法 枚举中间点更新任意两点是否可达） 判断是否能确定排名为已他强的+弱的数为n-1；

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<math.h>
#include<functional>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 115;
const int inf = 1<<30;//0x7f;
typedef __int64 LL;
int n,m;
bool map[maxn][maxn];
void warshall()
{
	for( int k = 1; k <= n; k ++ ){
		for( int i = 1; i <= n; i ++ ){
			for( int j = 1; j <= n; j ++ )
			{
				map[i][j] = ( map[i][j] || map[i][k]&map[k][j] );
			}
		}
	}
}
int main()
{
	#ifndef ONLINE_JUDGE
    freopen("data.txt","r",stdin);
	#endif
	int u,v;
	while( scanf("%d%d",&n,&m) != EOF )
	{
		memset(map,0,sizeof(map));
		for( int i = 0; i < m; i ++ )
		{
			scanf("%d%d",&u,&v);
			map[u][v] = true;
		}
		warshall();
		int ans = 0,temp;
		for( int i = 1; i <= n; i ++ ){
			temp  = 0;
			for( int j = 1; j <= n; j ++ ){
				temp += map[i][j] + map[j][i];
			}
			if( temp == n-1 )
				ans ++;
		}
		printf("%d\n",ans);
	}
    return 0;
}