POJ 3660 - Cow Contest

H - Cow Contest

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3660

Appoint description:  System Crawler  (2016-02-18)

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

floyd一遍，确定cow两两间谁胜谁负，对于每一只cow，打败和被打败的数目加起来刚好等于n-1，则能够确定它的名次

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

#define N 105
int g[N][N],n,m;

int main(){
	while (~scanf("%d%d",&n,&m)){
		memset(g,0,sizeof(g));
		for (int i=0;i<m;i++){
			int u,v;
			scanf("%d%d",&u,&v);
			g[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 (i==j)
						continue;
					g[i][j]=g[i][j]|(g[i][k]&g[k][j]);
				}
			}
		}
		int ans=0;
		for (int i=1;i<=n;i++){
			int pre=0,nex=0;
			for (int j=1;j<=n;j++){
				if (g[i][j])
					nex++;
				if (g[j][i])
					pre++;
			}
			if (pre+nex==n-1)
				ans++;
		}
		printf("%d\n",ans);
	}

	return 0;
}