Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11964 | Accepted: 6656 |
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题意:n头牛,给出一部分牛的排名情况,x,y代表x > y,求最后确定排名的牛的头数(
思路:floyd预处理出所有牛之间能够连接的边(注意是有向图,但不需要考虑是否最短),最后看有多少点和其他所有点连接;
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#define max_n 110
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
int mapp[max_n][max_n];
int n,m,x,y;
int main()
{
while(scanf("%d %d",&n,&m)!=EOF)
{
int ans=0;
memset(mapp,INF,sizeof(mapp));
for(int i=0;i<m;i++)
{
scanf("%d %d",&x,&y);
mapp[x][y]=1;
}
for(int k=1;k<=n;k++) //Floyd
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
mapp[i][j]=min(mapp[i][j],mapp[i][k]+mapp[k][j]);
for(int i=1;i<=n;i++)
{
bool flag=true;
for(int j=1;j<=n;j++)
{
if(mapp[i][j]==INF && mapp[j][i]==INF && i!=j)
{ //判断这两点是否相连
flag=false;
break;
}
}
if(flag) ans++;
}
printf("%d\n",ans);
}
return 0;
}