Cow Contest POJ
来源:互联网 发布:蒙泰打印机端口设置 编辑:程序博客网 时间:2024/06/14 01:44
Cow Contest
POJ - 3660
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 cowA has a greater skill level than cowB (1 ≤ A ≤ N; 1 ≤B ≤ N; A ≠B), then cow A will always beat cowB.
Farmer John is trying to rank the cows by skill level. Given a list the results ofM (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.
* 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
* Line 1: A single integer representing the number of cows whose ranks can be determined
5 54 34 23 21 22 5
2
题意:
题目给出了m对关系,求有多少个点的顺序关系是确定的。
思路:只要是这个点个其他所有点的关系是确定点,那么这个点的次序就是确定了,进一步简化,也就是看这个点是否和其他所有点有关系(边)不用管边的方向,因为不管什么方向,只要右边就可以确定一种关系,所以这个题就可以用floyd求传递闭包来做
code:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int n,m;int G[120][120];int main(){ int i,j; cin >> n >> m; memset(G,0,sizeof(G)); for(i = 1; i <= m; i++){ int u,v; cin >> u >> v; G[u][v] = 1; } int k; //floyd求传递闭包的核心算法 for(k = 1; k <= n; k++){ for(i = 1; i <= n; i++){ for(j = 1; j <= n; j++){ G[i][j] = G[i][j] || (G[i][k] && G[k][j]); } } } //把每个点都判断一下,看是否可以确定关系 int ans = 0; for(i = 1; i <= n; i++){ for(j = 1; j <= n; j++){ if(i == j)continue; if(!G[i][j] && !G[j][i]) break; } if(j > n) ans++; } cout << ans << endl; return 0;}
- poj 3660 Cow Contest
- POJ 3660 Cow Contest
- POJ 3660 Cow Contest
- poj 3660 Cow Contest
- POJ-3660-Cow Contest
- poj-3660 cow contest
- POJ 3660 Cow Contest
- poj 3660 Cow Contest
- poj 3660 Cow Contest
- POJ Cow Contest
- poj 3660 Cow Contest
- poj-3660 Cow Contest
- POJ 3660 Cow Contest
- POJ -- 3660 Cow Contest
- POJ 3660 Cow Contest
- poj 3660 Cow Contest
- POJ 3660 Cow Contest
- POJ 3660 Cow Contest
- Hadoop---HA集群搭建
- 整理一下关于各种格式转换的问题
- 进程的环境变量
- 深入理解Java的接口和抽象类
- 【知了堂学习笔记】_JavaScript知识(二)
- Cow Contest POJ
- eclipse集成okhttp+rxjava+retrofit步骤
- 算法模板——线段树之Lazy标记
- 如何统一jdk版本
- ubuntu 安装qt5.9.3 for arm-linux am335x qt开发2
- Java web过滤器验证登录防止未登录进入界面
- VMware_centos 无法自动获取IP地址
- 决策树-构造注解树
- JNI从ByteBuffer获取数据,返回byte[]