POJ 3660 Cow Contest（Floyd求传递闭包）

Cow Contest

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

题目大意：有N头牛进行比赛，比赛在每两头牛之间进行，共有M种比赛结果。比赛结果具有传递性，即若A胜B，B胜C，那么A也胜C。问最后可以确定几头牛的比赛名次。

解题思路：先利用Floyd算法求出所有牛之间的胜负关系，然后用两个数组in和out分别记录某头牛输的次数和赢得次数，如果这两个数相加等于N - 1，那么它的名次就可以判断

出来；否则无法判断名次。

代码如下：

#include <cstdio>
#include <cstring>

using namespace std;

const int maxn = 105;
const int maxm = 4505;

int dp[maxn][maxn];
int in[maxn],out[maxn];
int n,m;
void init()
{
    memset(dp,0,sizeof(dp));
    memset(in,0,sizeof(in));
    memset(out,0,sizeof(out));
}
void floyd()
{
    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]);
}

int main(void)
{
    while(scanf("%d %d" ,&n,&m) != EOF){
        init();
        int a,b;
        for(int i = 0;i < m;i++){
            scanf("%d %d",&a,&b);
            dp[a][b] = 1;
        }
        floyd();
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= n;j++){
                if(dp[i][j])
                    out[i]++,in[j]++;
            }
        }
        int ans = 0;
        for(int i = 1;i <= n;i++)
            if(in[i] + out[i] == n - 1)
                ans++;
        printf("%d\n",ans);
    }
    return 0;
}