POJ 3660 Cow Contest 最短路线

Cow Contest

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10853		Accepted: 6045

Description

N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming contest. As we all know, some cows code better than others. Each cow has a certain constant skill rating that is unique among the competitors.

The contest is conducted in several head-to-head rounds, each between two cows. If cow A has a greater skill level than cow B (1 ≤ A ≤ N; 1 ≤ B ≤ N; A ≠ B), then cow A will always beat cow B.

Farmer John is trying to rank the cows by skill level. Given a list the results of M (1 ≤ M ≤ 4,500) two-cow rounds, determine the number of cows whose ranks can be precisely determined from the results. It is guaranteed that the results of the rounds will not be contradictory.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each line contains two space-separated integers that describe the competitors and results (the first integer, A, is the winner) of a single round of competition: A and B

Output

* Line 1: A single integer representing the number of cows whose ranks can be determined
　

Sample Input

5 5
4 3
4 2
3 2
1 2
2 5

Sample Output

2

Source

USACO 2008 January Silver

思路：意思就是给你打过架并分出国胜负，击败过某个就一直击败他，问问你能确定多少人的排名，用Floyd算法如果两个人通过之间的必过赛，那么间接确定排名

ac代码：

#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;

int map[105][105],n,m;

int main()
{
	int k,i,j,a,b,flag,num,ans;
	
	while(~scanf("%d%d",&n,&m))
	{
		for(i=0;i<=n;i++)
		{
			for(j=0;j<=n;j++)
			{
				map[i][j]=0;
			}
		}
		for(i=0;i<m;i++)
		{
			scanf("%d%d",&a,&b);
			map[a][b]=1;
		}
		for(k=1;k<=n;k++)
		{
			for(i=1;i<=n;i++)
			{
				for(j=1;j<=n;j++)
				{
					if(map[i][k]&&map[k][j])
						map[i][j]=1;
				}
			}
		}
		ans=0;
		for(i=1;i<=n;i++)
		{
			num=n-1;
			for(j=1;j<=n;j++)
			{
				if(map[i][j]||map[j][i])
					num--;
			}
			if(!num)
				ans++;
		}
		printf("%d\n",ans);
	}
	
	return 0;
}