USTC 1123 Two Hospitals

Two Hospitals

Time Limit: 2000ms
Memory Limit: 65536kb

Description

In the highland, people live in towns. There are roads between pairs of towns, so that all the towns are connected by paths. Because the roads are different in length and surface, each road has a constant traveling time.

Now, the government wants to build two hospitals in two of these towns. Which two towns should be chosen to locate the two hospitals?

Let t_i denotes the time town i travel to its nearer hospital by a path costing the shortest time. The time traveling through a path is the sum of traveling time of each road on the path. The time traveling inside towns is omitted.

The principle for locating the two hospitals is that the maximum t_i must be minimized. If there are multi roads between two towns, only the lowest cost road will be considered. There may exists roads from one town to itself, but in our scene, these roads are useless.

Now, given the roads and their traveling time, it is your job to find the two towns to build the two hospitals. Fortunately, in our cases, the solution of the problem is unique.

Input

The first line of input is an integer k, which is the number of cases. The following 2k lines contain k cases.

In each case, the first line contains two integers N and E, which are the number of towns and the number of roads in this case. All the towns in the case are labeled as 1, 2, ..., N. (2 <= N <= 500, N-1 <= E <= 2000). The second line contains 3E integers, that is a list as u₁, v₁, w₁, ..., u_E, v_E, w_E. u_i and v_i denotes the two relating towns of the i-th road without direction, and w_i is the cost time of the road.

Output

For case, output the labels of the two towns in one line, with the smaller label in front.

Sample Input

1
5 8
1 2 6 1 3 2 1 4 4 3 5 4 2 5 2 2 4 3 1 2 4 4 4 1

Sample Output

1 2

来源：34th ACM/ICPC Asia Regional, Hefei, Preliminary

解题：
       2009年的合肥网络赛最后一题，题目意思是要求在一些城镇里面，建立两个医院，使得每个城镇到医院的距离最短(任意一个医院即可)。
考察弗洛伊德算法和暴力枚举。先求出每个城镇间最短距离，再依次枚举，比如：先假设医院设在1，2城镇，计算其他城镇到这两个城镇的总
距离；再假设1，3城镇，计算其他城镇到这两个城镇距离·····最后比较哪个假设的总距离是最短的，即所要求的。
#include<iostream>
#include<cstring>
using namespace std ;
#define MAXN 501
#define INF 1000000000 
 
void floyd_warshall(int n,int map[][MAXN],int min[][MAXN])
{
    int i,j,k ;
    for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			min[i][j]=map[i][j];
    for(k=1;k<=n;k++)
		for(i=1;i<=n;i++)
			for(j=1;j<=n;j++)
				if(min[i][k]+min[k][j]<min[i][j])
					min[i][j]=min[i][k]+min[k][j];
}

int main()
{
    int caseNumber,i,j,k,q,p,n,m,min1,min2,map[MAXN][MAXN],min[MAXN][MAXN];
    cin>>caseNumber ;
    while(caseNumber--)
    {
        cin>>n>>m ;
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				map[i][j]=(i==j)?0:INF;
        for(k=1;k<=m;k++)
        {
            cin>>i>>j>>q ;
          	if (q<map[i][j])
				map[i][j]=q,map[j][i]=q;
        }
		floyd_warshall(n,map,min);
		min2=INF;
		for (i=1;i<=n;i++)
			for (j=i+1;j<=n;j++)
			{
				min1=0;
				for (k=1;k<=n;k++)
				{
					if (k!=i && k!=j)
					{
						if (min[k][i]>min[k][j])
							min1+=min[k][j];
						else 
							min1+=min[k][i];
					}	
				}
				if (min1<min2)
				{
					p=i;
					q=j;
					min2=min1;
				}
			}
		cout<<p<<" "<<q<<endl;
    }
    return 0 ;
}