POJ 3660解题报告

Cow Contest

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7320		Accepted: 4051

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

Source

USACO 2008 January Silver

        这道题还是属于floyd算法求传递闭包的练习。

         参考代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#define pb push_back
#define CLR(x) memset(x,0,sizeof(x))
#define __CLR(x) memset(x,-1,sizeof(x))
using namespace std;

int n,m;
int g[110][110];
void floyd()
{
    for(int k=1; k<=n; k++)
        for(int i=1; i<=n; i++)
            if(g[i][k])
            {
                for(int j=1; j<=n; j++)
                {
                    if(g[k][j])
                        g[i][j]=1;
                }
            }

}

int main()
{

    while(~scanf("%d%d",&n,&m))
    {
        CLR(g);
        for(int i=0; i<m; i++)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            g[a][b]=1;
        }
        floyd();
        int num=0;
        for(int i=1;i<=n;i++)
        {
            int res=0;
            for(int j=1;j<=n;j++)
            {
                if(g[i][j]) res++;
                if(g[j][i]) res++;
            }
            if(res==n-1) num++;
        }
        printf("%d\n",num);
    }
}