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
算法
对于一个节点 i,如果 j 能到 i,i 能到 k,那么 j 就能到 k,求传递闭包,就是把图中所有满足这样传递性的节点计算出来,计算完成后,就知道任意两个节点之间是否相连。
简单来说,传递闭包是一种关于连通性的算法,其是指所有点的所能到达的点集。
Floyd可以用来判断两图是否连通,在只用判断连通关系是只用true 或false来标记是否连通
n个顶点中一个顶点需要n-1条边来实现连通
代码实现
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=105;
int gx[maxn][maxn];
int n,m;
void Floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(gx[i][k]&&gx[k][j])
gx[i][j]=1;
}
}
int main()
{
int ans=0;
cin>>n>>m;
memset(gx,0,sizeof(gx));
int s,f;
for(int i=1;i<=m;i++)
{
cin>>s>>f;
gx[s][f]=1;
}
Floyd();
for(int i=1;i<=n;i++)
{
int cnt=0;
for(int j=1;j<=n;j++)
{
if(gx[i][j]||gx[j][i])
cnt++;
}
if(cnt==n-1) ans++;
}
cout<<ans<<endl;
return 0;
}