poj Cow Contest（传递闭包）

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

思路：如果牛a战胜牛b，牛b战胜牛c，则也可以说牛a战胜牛c，即可以传递胜负。这样如果一头牛的被x头牛打败，打败y头牛，且x+y=n-1，则我们容易知道这头牛的排名就被确定了，所以我们只要将任何两头牛的胜负关系确定了，在遍历所有牛判断一下是否满足x+y=n-1，将满足这个条件的牛数目加起来就是所求解

代码：

#include<stdio.h>
#include<string.h>
#define maxn 100+10
int n,m;
int map[maxn][maxn];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(map,0,sizeof(map));
        int i,j,a,b;
        for(i=1; i<=m; i++)
        {
            scanf("%d%d",&a,&b);
            map[a][b]=1;
        }
        int k;
        for(k=1; k<=n; k++)
            for(i=1; i<=n; i++)
                for(j=1; j<=n; j++)
                    if(map[i][k]==1&&map[k][j]==1)
                        map[i][j]=1;
        int ans=0;
        for(i=1; i<=n; i++)
        {
            int cnt=0;
            for(j=1; j<=n; j++)
            {
                if(map[i][j])
                    cnt++;
                else if(map[j][i])
                    cnt++;
            }
            if(cnt==n-1)
                ans++;

        }
        printf("%d\n",ans);
    }
    return 0;
}