poj--2485--Highways

爱被打了一巴掌 2022-06-03 01:17 82阅读 0赞

Highways

<table> 
 <tbody> 
 <tr> 
 <td>Time Limit:&nbsp;1000MS</td> 
 <td>&nbsp;</td> 
 <td>Memory Limit:&nbsp;65536K</td> 
 </tr> 
 <tr> 
 <td>Total Submissions:&nbsp;33635</td> 
 <td>&nbsp;</td> 
 <td>Accepted:&nbsp;15210</td> 
 </tr> 
 </tbody> 
</table>

Description

The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning to build some highways so that it will be possible to drive between any pair of towns without leaving the highway system.  
  
Flatopian towns are numbered from 1 to N. Each highway connects exactly two towns. All highways follow straight lines. All highways can be used in both directions. Highways can freely cross each other, but a driver can only switch between highways at a town that is located at the end of both highways.   
  
The Flatopian government wants to minimize the length of the longest highway to be built. However, they want to guarantee that every town is highway-reachable from every other town.

Input

The first line of input is an integer T, which tells how many test cases followed.  
The first line of each case is an integer N (3 <= N <= 500), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within \[1, 65536\]) between village i and village j. There is an empty line after each test case.

Output

For each test case, you should output a line contains an integer, which is the length of the longest road to be built such that all the villages are connected, and this value is minimum.

Sample Input

1
    
    3
    0 990 692
    990 0 179
    692 179 0

Sample Output

692

题意：

题目给出图的邻接矩阵，让我们求出这个图最小生成树中最长的那个边的长度，可以用克鲁斯卡尔算法，详见代码中的注释

代码：

C++ Code

<table style="width:100%; font-family:'Consolas','Courier New'; font-size:12px; vertical-align:text-top; line-height:15px"> 
 <tbody> 
 <tr> 
 <td style="color:#008284; background-color:#e3e3e3; vertical-align:text-top"> 
 <div style="margin:7px; text-align:right; white-space:nowrap">
 1 
 2 
 3 
 4 
 5 
 6 
 7 
 8 
 9 
 10 
 11 
 12 
 13 
 14 
 15 
 16 
 17 
 18 
 19 
 20 
 21 
 22 
 23 
 24 
 25 
 26 
 27 
 28 
 29 
 30 
 31 
 32 
 33 
 34 
 35 
 36 
 37 
 38 
 39 
 40 
 41 
 42 
 43 
 44 
 45 
 46 
 47 
 48 
 49 
 50 
 51 
 52 
 53 
 54 
 55 
 56 
 57 
 58 
 59 
 60 
 61 
 62 
 63 
 64 
 65 
 66 
 67 
 68 
 69 
 70 
 71 
 72 
 73 
 74 
 75 
 76 
 77 
 
 </div> </td> 
 <td style="background-color:#008284; padding:1px"> 
 <div style="border:1px #008284 solid"></div> </td> 
 <td style="background-color:rgb(239,239,239); width:100%; vertical-align:text-top"> 
 <div style="margin:7px"> 
 #include&nbsp;&lt;iostream&gt; 
 
 #include&nbsp;&lt;cstdio&gt; 
 
 #include&nbsp;&lt;algorithm&gt; 
 
 
 using&nbsp; 
 namespace&nbsp;std; 
 
 const&nbsp; 
 int&nbsp;maxn&nbsp;=&nbsp; 
 510; 
 
 int&nbsp;n,&nbsp;m; 
 
 long&nbsp; 
 long&nbsp;maxE; 
 
 int&nbsp;father[maxn]; 
 
 struct&nbsp;unit 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;from,&nbsp;to; 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 long&nbsp; 
 long&nbsp;cost; 
 }&nbsp;save[maxn&nbsp;*&nbsp;maxn]; 
 
 
 bool&nbsp;compare(unit&nbsp;a,&nbsp;unit&nbsp;b)&nbsp; 
 ///根据边权重进行排序 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp;a.cost&nbsp;&lt;&nbsp;b.cost; 
 } 
 
 int&nbsp;find( 
 int&nbsp;x)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 ///找到点所在的集合 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 if(x&nbsp;==&nbsp;father[x]) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp;x; 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp;find(father[x]); 
 } 
 
 bool&nbsp;isConnected( 
 int&nbsp;a,&nbsp; 
 int&nbsp;b)&nbsp;&nbsp;&nbsp; 
 ///判断两个点是否在同一个集合里面 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp;find(a)&nbsp;==&nbsp;find(b); 
 } 
 
 
 void&nbsp;mix( 
 int&nbsp;a,&nbsp; 
 int&nbsp;b) 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;u&nbsp;=&nbsp;find(a),&nbsp;v&nbsp;=&nbsp;find(b);&nbsp; 
 ///如果两个点不在同一个集合，则进行合并 &nbsp;&nbsp;&nbsp;&nbsp; 
 if(u&nbsp;!=&nbsp;v) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;father[u]&nbsp;=&nbsp;v; 
 } 
 
 void&nbsp;&nbsp;Kruskal() 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp;sort(save&nbsp;+&nbsp; 
 1,&nbsp;save&nbsp;+&nbsp; 
 1&nbsp;+&nbsp;m,&nbsp;compare); 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 for( 
 int&nbsp;i&nbsp;=&nbsp; 
 1&nbsp;;&nbsp;i&nbsp;&lt;=&nbsp;m;&nbsp;i++) 
 &nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 if(isConnected(save[i].from,&nbsp;save[i].to)) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 continue; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;mix(save[i].from,&nbsp;save[i].to); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;maxE&nbsp;=&nbsp;max(maxE,&nbsp;save[i].cost); 
 &nbsp;&nbsp;&nbsp;&nbsp;} 
 } 
 
 int&nbsp;main() 
 { 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;t; 
 &nbsp;&nbsp;&nbsp;&nbsp;scanf( 
 "%d",&nbsp;&amp;t); 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 while(t--) 
 &nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;scanf( 
 "%d",&nbsp;&amp;n); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;i,&nbsp;j; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 for(i&nbsp;=&nbsp; 
 1;&nbsp;i&nbsp;&lt;=&nbsp;n;&nbsp;i++) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;father[i]&nbsp;=&nbsp;i; 
 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 int&nbsp;a; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;m&nbsp;=&nbsp; 
 0; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 for(i&nbsp;=&nbsp; 
 1;&nbsp;i&nbsp;&lt;=&nbsp;n;&nbsp;i++)&nbsp; 
 ///存储邻接矩阵 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
 for(j&nbsp;=&nbsp; 
 1;&nbsp;j&nbsp;&lt;=&nbsp;n;&nbsp;j++) 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{ 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;scanf( 
 "%d",&nbsp;&amp;a); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;save[++m].from&nbsp;=&nbsp;i; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;save[m].to&nbsp;=&nbsp;j; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;save[m].cost&nbsp;=&nbsp;a; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;maxE&nbsp;=&nbsp; 
 0; 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Kruskal(); 
 &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;printf( 
 "%lld\n",&nbsp;maxE); 
 &nbsp;&nbsp;&nbsp;&nbsp;} 
 &nbsp;&nbsp;&nbsp;&nbsp; 
 return&nbsp; 
 0; 
 } 
 
 </div> </td> 
 </tr> 
 </tbody> 
</table>