POJ - 3660 Cow Contest

最新推荐文章于 2020-12-19 00:08:56 发布

「已注销」

最新推荐文章于 2020-12-19 00:08:56 发布

阅读量123

点赞数

分类专栏：最短路问题文章标签：变形题

本文链接：https://blog.csdn.net/XYBDX/article/details/98245603

版权

最短路问题专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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 Ahas 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 andM
* 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-1就好了；

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int book[110][110];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        memset(book,0,sizeof(book));
        int a,b;
        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            book[a][b]=1;
        }
        for(int k=1; k<=n; k++)
        {
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=n; j++)
                {
                    if(book[i][k]&&book[k][j])
                        book[i][j]=1;
                }
            }
        }
        int ans=0;
        for(int i=1; i<=n; i++)
        {
            int sum=0;
            for(int j=1; j<=n; j++)
            {
                if(book[i][j]||book[j][i])
                    sum++;
            }
            if(sum==n-1)
                ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}