poj3660 Cow Contest floyd+传递闭包

题目链接：http://poj.org/problem?id=3660

Cow Contest

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6981		Accepted: 3831

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

题意：已知一些奶牛的两两的强弱关系，问你能确定多少头牛的绝对排名。

简单题解：传递闭包，如果A>B,A到B连边为1，传递背包意思是A>B,B>C,那么就可以确定A>C。用floyd算法把所有能确定的关系确定下，然后对于每一头牛看胜于它和负于它的和是不是n-1，是的话这头牛就能确定。

代码：

/**
 * @author neko01
 */
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
using namespace std;
typedef long long LL;
#define INF 0x7fffffff
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define clr(a) memset(a,0,sizeof a)
#define clr1(a) memset(a,-1,sizeof a)
const double eps=1e-8;
const double pi=acos(-1.0);
int a[105][105];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    clr(a);
    for(int i=0;i<m;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        a[u][v]=1;
    }
    for(int k=1;k<=n;k++)   //传递闭包
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(a[i][k]==1&&a[k][j]==1)
                    a[i][j]=1;
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        int sum=0;
        for(int j=1;j<=n;j++)
        {
            sum+=a[i][j]+a[j][i];
        }
        if(sum==n-1)  //比它大以及比它小的和为n-1
            ans++;
    }
    printf("%d\n",ans);
    return 0;
}