最短路floyde—Cow Contest（POJ - 3660）

题目链接：>_>

题目：Cow Contest

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

题意：

给出牛之间的强弱关系，让你确定有多少头牛能够确定其排名。

AC代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
#define itn int
const int maxn = 0x73f3f3f;
int mp[105][105];
int main() {
	int n, m;
	while (~scanf("%d %d", &n, &m)) {
		int i, j;
		memset(mp, 0, sizeof mp);
		int q1, q2;
		for (i = 0; i < m; i++) {
			scanf("%d %d", &q1, &q2);
			mp[q1][q2] = 1;
		}
		for (int k = 1; k <= n; k++) {
			for (i = 1; i <= n; i++) {
				for (j = 1; j <= n; j++) {
					if (mp[i][j] == 1 || (mp[i][k] == 1 && mp[k][j] == 1)) mp[i][j] = 1;
				}
			}
		}
		int ans = 0;
		for (i = 1; i <= n; i++) {
			int sum = 0;
			for (j = 1; j <= n; j++) {
				if (i == j)continue;
				if (mp[i][j] == 1 || mp[j][i] == 1)sum++;
			}
			if (sum == n - 1)ans++;
		}
		printf("%d\n", ans);
	}
	return 0;
}