1682: [Usaco2005 Mar]Out of Hay 干草危机
1682: [Usaco2005 Mar]Out of Hay 干草危机
Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 391 Solved: 258
[Submit][Status]
Description
The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1. Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry. Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.
Input
* Line 1: Two space-separated integers, N and M. * Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.
Output
* Line 1: A single integer that is the length of the longest road required to be traversed.
Sample Input
1 2 23
2 3 1000
1 3 43
Sample Output
由1到达2,需要经过长度23的道路;回到1再到3,通过长度43的道路.最长道路为43
HINT
Source
Silver
题解:既然题目说了所有点均与点1联通(phile:废话,那不就是联通无向图啊),那么显(读xian2,我们数学老师口头禅)然这个问题成了最小生成树,然后只要求出最小生成树最大边的值就Accept啦。。
1 var 2 i,j,k,l,m,n:longint; 3 c:array[0..3000] of longint; 4 a:array[0..15000,1..3] of longint; 5 procedure swap(var x,y:longint); 6 var z:longint; 7 begin 8 z:=x;x:=y;y:=z; 9 end; 10 procedure sort(l,r:longint); 11 var i,j,x,y:longint; 12 begin 13 i:=l;j:=r; 14 x:=a[(l+r) div 2,3]; 15 repeat 16 while a[i,3]<x do inc(i); 17 while a[j,3]>x do dec(j); 18 if i<=j then 19 begin 20 swap(a[i,1],a[j,1]); 21 swap(a[i,2],a[j,2]); 22 swap(a[i,3],a[j,3]); 23 inc(i);dec(j); 24 end; 25 until i>j; 26 if l<j then sort(l,j); 27 if i<r then sort(i,r); 28 end; 29 function getfat(x:longint):longint; 30 begin 31 while x<>c[x] do x:=c[x]; 32 getfat:=x; 33 end; 34 function tog(x,y:longint):boolean; 35 begin 36 exit(getfat(x)=getfat(y)); 37 end; 38 procedure merge(x,y:longint); 39 begin 40 c[getfat(x)]:=getfat(y); 41 end; 42 begin 43 readln(n,m); 44 for i:=1 to m do 45 readln(a[i,1],a[i,2],a[i,3]); 46 for i:=1 to n do c[i]:=i; 47 sort(1,m); 48 j:=1; 49 l:=0; 50 for i:=1 to n-1 do 51 begin 52 while tog(a[j,1],a[j,2]) do inc(j); 53 if a[j,3]>l then l:=a[j,3]; 54 merge(a[j,1],a[j,2]); 55 end; 56 writeln(l); 57 end. 58
转载于:https://www.cnblogs.com/HansBug/p/4168408.html
1682: [Usaco2005 Mar]Out of Hay 干草危机相关推荐
- bzoj 1682: [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)
1682: [Usaco2005 Mar]Out of Hay 干草危机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 626 Solved: 436 ...
- 1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机
1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: ...
- bzoj 1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机
1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: ...
- BZOJ 1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机 bfs
题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1615 1615: [Usaco2008 Mar]The Loathesome Hay Bale ...
- [BZOJ1615][Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机
1615: [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机 Time Limit: 5 Sec Memory Limit: 64 MB Submit: ...
- BZOJ 1738: [Usaco2005 mar]Ombrophobic Bovines 发抖的牛( floyd + 二分答案 + 最大流 )
一道水题WA了这么多次真是.... 统考终于完 ( 挂 ) 了...可以好好写题了... 先floyd跑出各个点的最短路 , 然后二分答案 m , 再建图. 每个 farm 拆成一个 cow 点和一个 ...
- bzoj 1681: [Usaco2005 Mar]Checking an Alibi 不在场的证明(BFS)
1681: [Usaco2005 Mar]Checking an Alibi 不在场的证明 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 389 So ...
- [Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机
Description Farmer John新买的干草打包机的内部结构大概算世界上最混乱的了,它不象普通的机器一样有明确的内部传动装置,而是,N(2<=N<=1050)N (2 个齿轮互 ...
- BFS-BZOJ-1615-[Usaco2008 Mar]The Loathesome Hay Baler麻烦的干草打包机
Description Farmer John新买的干草打包机的内部结构大概算世界上最混乱的了,它不象普通的机器一样有明确的内部传动装置,而是,N (2 <= N <= 1050)个齿轮互 ...
最新文章
- gridcontrol值为0时设置为空_XASSET 4.0入门指南
- KVM 虚拟化架构和实现原理
- 2019.2.20异常
- 蓝桥杯-最大的算式(java)
- CF1070L Odd Federalization 高斯消元
- 今日arXiv精选 | 31篇EMNLP 2021最新论文
- 小说Symbian的签名
- Python对象内存地址
- 3dmax渲染大图高清最详细参数来了
- 冒险岛手游哪个服务器稳定,冒险岛手游职业选择攻略 骨灰级玩家心得分享
- 你知道各调的特点吗?
- 【C++学习笔记】标准库类型string
- UGUI之菜单动画效果制作思路
- twitter推文采集案例
- 第八天 Python爬虫之Rquests库打码平台的简单使用
- 使用vue+golang+mysql写一个即时聊天、多人视频的项目
- 语音之家SOTA|开源发布: SPEECHIO_ASR_ZH00004 罗振宇跨年演讲
- MissionPlanner的固件下载模块
- Ping域名的时候出现ping:unknown host xxx.xxx
- 医学四视图-002-四视图实现
热门文章
- leetcode19. 删除链表的倒数第N个节点
- 在CentOS6.2下安装DNS服务软件Bind并快速配置简单实例
- Git(12)-stash, reflog
- 华为弹性云服务器ECS使用学习0
- OpenCL memory object 之 Global memory (1)
- Facebook与Google的互联网霸主争夺战
- 在Windows下编译ffmpeg完全手册
- 如何看懂源代码–(分析源代码方法)
- VUE项目中 获得多个复选框 checkbox 选中的值(jquery)+ 解决 Uncaught TypeError: Cannot read property ‘push‘ of undefine
- Jquery Datatable的使用样例(ssm+bootstrsp框架下)服务器端分页