POJ3660Cow Contest

最新推荐文章于 2021-09-08 19:31:03 发布

tokers

最新推荐文章于 2021-09-08 19:31:03 发布

阅读量533

点赞数

分类专栏： POJ 之旅文章标签：最短路径

本文链接：https://blog.csdn.net/Guard_Mine/article/details/38397953

版权

POJ 之旅专栏收录该内容

175 篇文章 0 订阅

订阅专栏

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

Sample Output

Source

USACO 2008 January Silver

设一头牛打败了x只牛，输给了y只，那么当x+y==n-1时，这只牛的排名是确定的，另外，胜负可以传递，所以利用floyd算法的变形来求传递闭包，然后判断每个点的出度入度和是不是为n-1.

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<vector>
#include<set>
#include<list>
#include<stack>
#include<queue>

using namespace std;

int dp[105][105];

int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		memset(dp,0,sizeof(dp));//开始每个点的关系不确定
		int x,y,ans=0;
		while(m--)
		{
			scanf("%d%d",&x,&y);
			dp[x][y]=1;
		}
		for(int k=1;k<=n;k++)
		  for(int i=1;i<=n;i++)
		    for(int j=1;j<=n;j++)
		      dp[i][j]=dp[i][j]||(dp[i][k] && dp[k][j]);
        for(int i=1;i<=n;i++)
        {
        	bool flag=0;
        	int cnt=0;
        	for(int j=1;j<=n;j++)
        	{
        		if(i==j)
        		  continue;
        		if(dp[i][j] || dp[j][i])
        		{
        			cnt++;
		        }
	        }
	        if(cnt==n-1)
               ans++;
        }
		printf("%d\n",ans);
	}
	return 0;
}