H - Cow Contest(Floyd算法传递闭包)

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

题解：

题目给出了m对的相对关系，求有多少个排名是确定的。
使用floyed求一下传递闭包。如果这个点和其余的关系都是确定的，那么这个点的排名就是确定的。
只要d[i][j]或者d[j][i]存在一个就可以。

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 110;
const int INF = 0x3f3f3f3f;
bool d[maxn][maxn];

int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
    memset(d,0,sizeof(d));
    for(int i=1;i<=m;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        d[a][b]=1;
    }
    for(int k=1;k<=n;k++)
        for(int i=1;i<=n;i++)
         for(int j=1;j<=n;j++)
    {
        d[i][j]=d[i][j]||(d[i][k]&&d[k][j]);
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        int cnt=0;
        for(int j=1;j<=n;j++)
        {
            if(d[i][j]||d[j][i])
                cnt++;
        }
        if(cnt==n-1)
            ans++;
    }
    cout<<ans<<endl;
    }
    return 0;
}