牛客——Cow Contest（floyd简单运用解决传递闭包）

链接：https://ac.nowcoder.com/acm/contest/1069/K
来源：牛客网

题目描述
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.
输入描述:

• 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
  输出描述:
• Line 1: A single integer representing the number of cows whose ranks can be determined
  示例1
  输入

5 5
4 3
4 2
3 2
1 2
2 5
输出

2
说明

Cow 2 loses to cows 1, 3, and 4. Thus, cow 2 is no better than any of the cows 1, 3, and 4. Cow 5 loses to cow 2, so cow 2 is better than cow 5. Thus, cow 2 must be fourth, and cow 5 must be fifth. The ranks of the other cows cannot be determined.

题目大概意思：有n头牛，给出m对关系，代表第一头牛排名高于第二头，叫你求出最多有几头牛的排名可以被确定。
很明显，看数据范围就应该是要把每头牛的排名能不能确定搞清楚，我们这就用一个二维数组把两两的关系记录下来，然后就参照floyd的思想，求出传递的隐形关系，比如N个选手，如果A比B强,B比C强，则A必比C强。最后用一个记录总数确定个数的数组，记录每头牛和其它牛之间关系确定的数量，若等于n-1，则代表这头牛与其余的n-1头牛的关系都确定，则num就加1，最后num就是答案
ac代码

#include<bits/stdc++.h>
using namespace std;
#define MAXN 110
int win[MAXN][MAXN];
int degree[MAXN];
int main(){
    int n,m;
    while(scanf("%d %d",&n,&m)==2){
    memset(degree,0,sizeof(degree));
    memset(win,0,sizeof(win));
            for(int i=1;i<=m;i++){
                int u,v;
                scanf("%d %d",&u,&v);
                win[u][v]=1;
            }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                for(int k=1;k<=n;k++){
                    if(win[j][i]&&win[i][k])//表达这种传递思想
                        win[j][k]=1;
                }
            }
        }
        int num=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                degree[i]+=win[i][j];
                degree[j]+=win[i][j];
            }
        }
        for(int i=1;i<=n;i++)//如果说i+j==n-1，那么就说明这个关系可以确定
            if(degree[i]==n-1) num++;
        cout<<num<<endl;
    }
}