BZOJ 1682 [Usaco2005 Mar] 最小生成树 解题报告
来源:互联网 发布:计算机端口号 编辑:程序博客网 时间:2024/06/09 03:50
1682: [Usaco2005 Mar]Out of Hay 干草危机
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.
牛们干草要用完了!贝茜打算去勘查灾情.
有N(2≤N≤2000)个农场,M(≤M≤10000)条双向道路连接着它们,长度不超过109.每一个农场均与农场1连通.贝茜要走遍每一个农场.她每走一单位长的路,就要消耗一单位的水.从一个农场走到另一个农场,她就要带上数量上等于路长的水.请帮她确定最小的水箱容量.也就是说,确定某一种方案,使走遍所有农场通过的最长道路的长度最小,必要时她可以走回头路.
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.
第1行输入两个整数N和M;接下来M行,每行输入三个整数,表示一条道路的起点终点和长度.
Output
- Line 1: A single integer that is the length of the longest road required to be traversed.
输出一个整数,表示在路线上最长道路的最小值.
Sample Input
3 3
1 2 23
2 3 1000
1 3 43
Sample Output
43
【解题报告】
代码如下:
/************************************************************** Problem: 1682 User: onepointo Language: C++ Result: Accepted Time:44 ms Memory:1064 kb****************************************************************/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define N 2010#define M 20010int n,m,cnt;int fa[N];struct Edge{ int u,v,w; friend bool operator < (const Edge &a,const Edge &b) {return a.w<b.w;}}e[M];int find(int x){ return (x==fa[x])?x:fa[x]=find(fa[x]);}int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n;++i) fa[i]=i; for(int i=1;i<=m;++i) { scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].w); } sort(e+1,e+m+1); for(int i=1;;i++) { int u=find(e[i].u),v=find(e[i].v); if(u!=v) { fa[u]=v;cnt++; if(cnt==n-1) { printf("%d\n",e[i].w); break; } } } return 0;}
- BZOJ 1682 [Usaco2005 Mar] 最小生成树 解题报告
- bzoj 1682: [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)
- BZOJ 2429 最小生成树 解题报告
- BZOJ 1601 [Usaco2008 Oct] 最小生成树 解题报告
- BZOJ 1821 [JSOI 2010] 最小生成树 解题报告
- BZOJ_P1682 [Usaco2005 Mar]Out of Hay 干草危机(最小生成树)
- bzoj 3479: [Usaco2014 Mar]Watering the Fields 最小生成树
- 最小生成树——解题报告
- codevs 1078 最小生成树 解题报告
- BZOJ 1598 [Usaco 2008 Mar] 启发式搜索 解题报告
- BZOJ 3754 Tree之最小方差树 解题报告
- bzoj 3144 切糕 最小割 解题报告
- BZOJ 1475 最小割 解题报告
- 最小生成树 prim POJ 2349解题报告
- 最小生成树 POJ 3625Building Roads解题报告
- Hdu 1879 继续畅通工程 最小生成树 解题报告
- Codeforces 827 D 最小生成树+倍增 解题报告
- codevs 1002 搭桥 【最小生成树】解题报告
- 平面点云凸包曲线计算
- HDOJ 2089 不要62
- Martin Fowler 微服务全文翻译
- 洛谷P1040 加分二叉树(NOIP2003)
- 2.1 Linux驱动设备模型
- BZOJ 1682 [Usaco2005 Mar] 最小生成树 解题报告
- opencv 06 行人检测(peopledetect) vs2015
- python问题:ValueError: operands could not be broadcast together with shapes (100,3) (3,1)
- 对于Hibernate一些介绍(新手见谅)
- js日期格式转换
- The third
- 背包九讲
- SDUT 2125 数据结构实验之串二:字符串匹配
- 版本控制概念