PKU 3275 Ranking the Cows 最短路 floyd
来源:互联网 发布:钢轨探伤数据回放分析 编辑:程序博客网 时间:2024/06/02 03:14
题意/Description:
Each of Farmer John's N cows (1 ≤ N ≤ 1,000) produces milk at a different positive rate, and FJ would like to order his cows according to these rates from the fastest milk producer to the slowest.
FJ has already compared the milk output rate for M (1 ≤ M ≤ 10,000) pairs of cows. He wants to make a list of C additional pairs of cows such that, if he now compares those C pairs, he will definitely be able to deduce the correct ordering of all N cows. Please help him determine the minimum value of C for which such a list is possible.
读入/Input:
Line 1: Two space-separated integers: N and M
Lines 2..M+1: Two space-separated integers, respectively: X and Y. Both X and Y are in the range 1...N and describe a comparison where cow X was ranked higher than cow Y.
输出/Output:
Line 1: A single integer that is the minimum value of C.
题解/solution:
如果n头牛排序完成,应该有C(n,2)关系已知,即任意两头牛的速度都知道了。然后可以从已经比较了的m对牛中算出可以推导出多少对牛已经知道了,推导方法可以参考floyd最短路,然后用C(n,2)减去它就是答案。
补充:C(N, 2) = N * (N - 1) / 2
调查K对关系:C(N, 2) - K
代码/Code:
var a,b:array [0..10001,0..1001] of longint; f:array [0..1001,0..1001] of boolean; n,m,ans:longint;procedure init;var i,x,y:longint;begin readln(n,m); for i:=1 to m do begin readln(x,y); f[x,y]:=true; inc(a[x,0]); inc(b[y,0]); a[x,a[x,0]]:=y; b[y,b[y,0]]:=x; end; ans:=0;end;procedure main;var i,j,k,x,y:longint;begin for k:=1 to n do for i:=1 to b[k,0] do begin x:=b[k,i]; for j:=1 to a[k,0] do begin y:=a[k,j]; if not f[x,y] then begin f[x,y]:=true; inc(a[x,0]); inc(b[y,0]); a[x,a[x,0]]:=y; b[y,b[y,0]]:=x; inc(ans); end; end; end; write(n*(n-1) div 2-ans-m);end;begin init; main;end.
- PKU 3275 Ranking the Cows 最短路 floyd
- poj 3275 Ranking the Cows floyd算法
- POJ 3275 Ranking The Cows
- poj 3275 Ranking the Cows
- Poj 3275 Ranking the Cows
- poj 3275 Ranking The Cows
- poj 3275 Ranking the Cows(floyd …
- POJ 3275 Ranking the Cows floyd求传递闭包 || bfs
- POJ2387 Til the Cows Come Home(最短路,Dijkstra算法,spfa算法,Floyd算法,深搜DFS)
- poj 3275 Ranking the Cows 图+BFS
- 最短路----Til the Cows Come Home
- Til the Cows Come Home 【最短路】
- Til the Cows Come Home 【最短路】
- 【Floyd求最短路+快速幂】PKU-3613-Cow Relays
- (最短路-floyd+邻接矩阵)PKU-1125 Stockbroker Grapevine
- BZOJ 1703 [Usaco2007 Mar]Ranking the Cows 奶牛排名 Floyd+bitset
- find the safest road(floyd最短路)
- hdu1596find the safest road最短路floyd
- android工厂类
- 前端框架你究竟选什么
- 15年编程生涯,资深架构师总结的7条经验
- uploadify多个文件上传,删除后提示超过最多限制
- Windows下给Android app进行系统签名
- PKU 3275 Ranking the Cows 最短路 floyd
- 慎用@@IDENTITY
- 计算机图形学(二)输出图元_7_并行曲线算法
- 用grunt搭建自动化的web前端开发环境-完整教程
- ORACLE中RECORD、VARRAY、TABLE的使用详解
- 【深入理解JVM】:HotSpot垃圾收集器
- mysql 修改账户密码
- 打字
- muetx semaphore 互斥与同步