POJ 3660 floyd 算法
来源:互联网 发布:小姐威客网络兼职 编辑:程序博客网 时间:2024/04/27 21:46
是一道floyd变形的题目。题目让确定有几个人的位置是确定的,如果一个点有x个点能到达此点,从该点出发能到达y个点,若x+y=n-1,则该点的位置是确定的。用floyd算发出每两个点之间的距离,最后统计时,若dis[a][b]之间无路且dis[b][a]之间无路,则该点位置不能确定。最后用点个数减去不能确定点的个数即可。题目:
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 54 34 23 21 22 5
Sample Output
2ac代码:
#include <iostream>#include <string.h>#include <cstdio>using namespace std;#define MAX 0x7fffffffconst int N=110;int dis[N][N];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(dis[i][k]!=MAX&&dis[k][j]!=MAX&&dis[i][j]>dis[i][k]+dis[k][j]){ dis[i][j]=dis[i][k]+dis[k][j];}}}}}int main(){//freopen("1.txt","r",stdin);while(~scanf("%d%d",&n,&m)){for(int i=1;i<=n;++i){ for(int j=1;j<=n;++j) dis[i][j]=MAX;} int x,y; while(m--){ scanf("%d%d",&x,&y); dis[x][y]=1; } floyd(); int ans=0; for(int i=1;i<=n;++i){ for(int j=1;j<=n;++j){if(j==i)continue; if(dis[i][j]==MAX&&dis[j][i]==MAX){ans++;break;} } } printf("%d\n",n-ans);} return 0;}
- POJ 3660 floyd 算法
- 图论---POJ 3660 floyd 算法(模板题)
- poj 3660 奶牛比赛 Floyd算法
- POJ 3660 Cow Contest(Floyd算法)
- poj 1125 floyd算法
- POJ 1125 floyd算法
- poj 2240 floyd算法
- poj 1125 Floyd算法
- poj 2139 floyd算法
- POJ 2253 (floyd算法)
- POJ 2253 Floyd 算法
- Floyd 算法 POJ 1125
- poj 1161 Walls floyd算法
- POJ 2253 Frogger(floyd算法)
- POJ 3660 floyd算法统计无关点个数
- Poj 3660 Cow Contest (传递闭包 Floyd算法变形)
- POJ 3660(floyd)
- poj 1125 , poj 3660 floyd
- HTTP POST GET 本质区别详解
- 基于C 的speex编程
- linux 2.6.32.2 mini2440平台移植--内核移植、yaffs2文件系统移植
- POJ 2002 Square 计算几何
- QTableWidget的使用和美工总结
- POJ 3660 floyd 算法
- 常用网站收藏(中文)[不断更新,收集中]
- 学习进展-2012-3-19
- poj1031---计算几何
- jQuery最基础简单的例子
- DEV控件之ASPxTextBox 的使用(验证)
- chmod permission
- Ruby On Rails 学习资源
- 搭建多媒体服务器-openfire, redfire 使用手记