Cow Contest （Floyd算法求解最短路）

最新推荐文章于 2022-12-30 11:11:43 发布

FREEZE橙

最新推荐文章于 2022-12-30 11:11:43 发布

阅读量242

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/qq_43873952/article/details/103448559

根据编程竞赛中奶牛之间的胜负关系，利用Floyd算法确定能精确排名的奶牛数量。输入包含奶牛数量和比赛结果，输出为可确定排名的奶牛数。样例输入为5头奶牛5场比赛，输出为2头奶牛。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

标题：Cow Contest

**
[题目来源]

(http://poj.org/problem?id=3660)

题目描述：
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 分别代表有n 个奶牛和 m 行奶牛之间的关系，下面的m 行的两个数字代表奶牛的标号，a,b,其中 a 可以打败b ，问：可以确定的奶牛的实力的顺序（就是哪头奶牛比较厉害，哪个比较菜）。
题目分析：
要想找出最终可以确定的实力顺序，必须清楚这头奶牛与其他奶牛之间的关系，就是这头奶牛是否可以直接或者间接的打败其他奶牛，以确定自己的地位（哈哈哈）。所以这里我们使用FLoyd 算法计算出每头奶牛之间的关系，然后就可以了。

#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
const int N = 1010;
const int INF = 0x3f3f3f3f;
int mapp[N][N];
int n,m;
void Floyed()
{
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(mapp[i][k]==mapp[k][j]&&mapp[i][k]!=INF)
                {
                    mapp[i][j] = mapp[i][k];
                }
            }
        }
    }
}
//struct node
//{
//    int x,flag=0;
//};
int main()
{
    int a,b;
    //while(scanf("%d %d",&n,&m)!=EOF)
    while(cin >> n >> m)
    {
        if(n==0)
            break;
        memset(mapp,INF,sizeof(mapp));
        for(int i=1; i<=m; i++)
        {
            //scanf("%d %d",&a,&b);
            cin >> a >> b;
            mapp[a][b]=1;
            mapp[b][a]=-1;
        }
        Floyed();
        int ans=0;
        for(int i=1; i<=n; i++)
        {
            int sum=0;
            for(int j=1; j<=n; j++)
            {
                if(mapp[i][j]!=INF)
                {
                    sum++;
                    //cout << sum <<endl;
                }
            }
            if(sum==n-1)
            {
                ans++;
            }
        }
        //printf("%d\n",ans);
        cout << ans << endl;
    }
    return 0;
}