Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10756 | Accepted: 5992 |
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
思路:本题思路是求有向传递闭包,传递闭包实质上是一种有向无环图,本题题目大意是让求能够确定名次的牛的个数,假设第i头牛,能打败他的有x头牛,他能够打败y头牛,如果x+y=n-1,则第i头牛的名次就一定能够确定,x则为入度,y为出度,利用floyd算法求有向闭包即可。详细代码如下:
#include <cstdio>
#include <cstring>
using namespace std;
int map[105][105];
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= n; j ++){
map[i][j] = 0;
}
}
int a,b;
for(int i = 1; i <= m; i ++){
scanf("%d%d",&a,&b);
map[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(map[i][j] || (map[i][k] && map[k][j]))//判断是否是通路
map[i][j] = 1;
}
}
}
int cnt = 0,dge; //判断度
for(int i = 1; i <= n; i ++){
dge = 0;
for(int j = 1; j <= n; j ++){
if(map[i][j] || map[j][i])//图是有向无环图
dge ++;
}
if(dge == n-1)
cnt ++;
}
printf("%d\n",cnt);
}
return 0;
}