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
题目大意:n头牛,m场比赛,如果a打败b,b打败c,那么也认为a打败了c,输出一共有多少头牛可以确定比赛排名
解题思路:要想确定一头牛的排名,那么就需要知道这头牛与剩余的n-1头牛的战斗结果,a->b->c的传递性,所以可以使用fioyd算法来做,如果a和c之间有通路就将map[a][c]=1 ,最后计算所有入度+出度=n-1的点的个数
AC代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e3;
int a[maxn][maxn];
int n,m;
void floyd()
{
int i,j,k;
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=a[i][j]||(a[i][k]&&a[k][j]);
}
}
}
}
int main()
{
int u,v;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&u,&v);
a[u][v]=1;
}
floyd();
int ans=0,term;
for(int i=1;i<=n;i++)
{
term=0;
for(int j=1;j<=n;j++)
{
if(a[i][j]||a[j][i])
term++;
}
if(term==n-1)
ans++;
}
cout<<ans<<endl;
return 0;
}