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.

    牛们干草要用完了!贝茜打算去勘查灾情.

    有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 由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                    

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏HansBug's Lab

1657: [Usaco2006 Mar]Mooo 奶牛的歌声

1657: [Usaco2006 Mar]Mooo 奶牛的歌声 Time Limit: 5 Sec  Memory Limit: 64 MB Submit: ...

26350
来自专栏HansBug's Lab

1653: [Usaco2006 Feb]Backward Digit Sums

1653: [Usaco2006 Feb]Backward Digit Sums Time Limit: 5 Sec  Memory Limit: 64 MB ...

28540
来自专栏HansBug's Lab

1724: [Usaco2006 Nov]Fence Repair 切割木板

1724: [Usaco2006 Nov]Fence Repair 切割木板 Time Limit: 5 Sec  Memory Limit: 64 MB Su...

30670
来自专栏HansBug's Lab

1734: [Usaco2005 feb]Aggressive cows 愤怒的牛

1734: [Usaco2005 feb]Aggressive cows 愤怒的牛 Time Limit: 5 Sec  Memory Limit: 64 MB...

31470
来自专栏ml

HDUOJ----Good Numbers

Good Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768...

31860
来自专栏ml

poj-------(2240)Arbitrage(最短路)

Arbitrage Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 156...

38980
来自专栏HansBug's Lab

1664: [Usaco2006 Open]County Fair Events 参加节日庆祝

1664: [Usaco2006 Open]County Fair Events 参加节日庆祝 Time Limit: 5 Sec  Memory Limit:...

27550
来自专栏HansBug's Lab

1671: [Usaco2005 Dec]Knights of Ni 骑士

1671: [Usaco2005 Dec]Knights of Ni 骑士 Time Limit: 5 Sec  Memory Limit: 64 MB Su...

27650
来自专栏HansBug's Lab

3314: [Usaco2013 Nov]Crowded Cows

3314: [Usaco2013 Nov]Crowded Cows Time Limit: 1 Sec  Memory Limit: 128 MB Submit...

27850
来自专栏HansBug's Lab

2015: [Usaco2010 Feb]Chocolate Giving

2015: [Usaco2010 Feb]Chocolate Giving Time Limit: 10 Sec  Memory Limit: 162 MB S...

31760

扫码关注云+社区

领取腾讯云代金券