Cow Contest
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10450 | Accepted: 5841 |
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 头牛 m 个牛的实力信息,给出 m 头牛的实力信息后,问多少的牛可以确定排名
//离散里面的传递闭包问题
//三重循环暴力即可
1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 int f[105][105],n,m; 5 6 int main() 7 { 8 cin>>n>>m; 9 for (int i=1;i<=m;i++) 10 { 11 int x,y; 12 cin >> x >> y; 13 f[x][y]=1; 14 } 15 for (int k=1;k<=n;k++) 16 for (int i=1;i<=n;i++) 17 for (int j=1;j<=n;j++) 18 if (f[i][k]+f[k][j]==2) 19 f[i][j]=1; 20 int ans=0; 21 for (int i=1;i<=n;i++) 22 { 23 int total=0; 24 for (int j=1;j<=n;j++) 25 if (f[i][j] || f[j][i]) total++; 26 if (total==n-1) ans++; 27 } 28 cout << ans << endl; 29 }