A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all the houses are in its service range.
Now given the map of the city and several candidate locations for the gas station, you are supposed to give the best recommendation. If there are more than one solution, output the one with the smallest average distance to all the houses. If such a solution is still not unique, output the one with the smallest index number.
Input Specification:
Each input file contains one test case. For each case, the first line contains 4 positive integers: N (≤), the total number of houses; M (≤), the total number of the candidate locations for the gas stations; K (≤), the number of roads connecting the houses and the gas stations; and DS, the maximum service range of the gas station. It is hence assumed that all the houses are numbered from 1 to N, and all the candidate locations are numbered from G1 to GM.
Then K lines follow, each describes a road in the format
P1 P2 Dist
where P1 and P2 are the two ends of a road which can be either house numbers or gas station numbers, and Dist is the integer length of the road.
Output Specification:
For each test case, print in the first line the index number of the best location. In the next line, print the minimum and the average distances between the solution and all the houses. The numbers in a line must be separated by a space and be accurate up to 1 decimal place. If the solution does not exist, simply output No Solution.
Sample Input 1:
4 3 11 5
1 2 2
1 4 2
1 G1 4
1 G2 3
2 3 2
2 G2 1
3 4 2
3 G3 2
4 G1 3
G2 G1 1
G3 G2 2
Sample Output 1:
G1
2.0 3.3
Sample Input 2:
2 1 2 10
1 G1 9
2 G1 20
Sample Output 2:
No Solution题意：
给出m个候选的加油站建造地点，要求从中选取一个，使其距离住宅区的距离尽可能的远。如果存在相等的情况，则输出距离平均值最小的那个。
思路：
对每一个加油站运用Dijkstra算法求出该加油站到达其他结点的最小距离。然后在最小距离中寻找最大值。
Code：
1 #include <bits/stdc++.h> 2 3 using namespace std; 4 5 const int inf = 999999999; 6 int grap[1020][1020]; 7 int visited[1020], dist[1020]; 8 9 int main() { 10 int n, m, k, ds; 11 cin >> n >> m >> k >> ds; 12 fill(grap[0], grap[0] + 1020 * 1020, inf); 13 for (int i = 0; i < 1020; ++i) grap[i][i] = 0; 14 for (int i = 0; i < k; ++i) { 15 string p1, p2; 16 int d; 17 cin >> p1 >> p2 >> d; 18 int v1, v2; 19 if (p1[0] == 'G') { 20 v1 = stoi(p1.substr(1)) + n; 21 } else { 22 v1 = stoi(p1); 23 } 24 if (p2[0] == 'G') { 25 v2 = stoi(p2.substr(1)) + n; 26 } else { 27 v2 = stoi(p2); 28 } 29 grap[v1][v2] = grap[v2][v1] = d; 30 grap[v1][v2] = grap[v2][v1] = min(d, grap[v1][v2]); 31 } 32 int ansid = -1; 33 double ansdist = -1, ansaver = inf; 34 for (int i = n + 1; i <= n + m; ++i) { 35 double aver = 0, mindist = inf; 36 fill(visited, visited + 1020, 0); 37 fill(dist, dist + 1020, inf); 38 dist[i] = 0; 39 for (int j = 0; j < n + m; ++j) { 40 int u = -1, minn = inf; 41 for (int k = 1; k <= n + m; ++k) { 42 if (visited[k] == 0 && dist[k] < minn) { 43 u = k; 44 minn = dist[k]; 45 } 46 } 47 if (u == -1) break; 48 visited[u] = 1; 49 for (int k = 1; k <= n + m; ++k) { 50 if (visited[k] == 0 && dist[k] > dist[u] + grap[u][k]) 51 dist[k] = dist[u] + grap[u][k]; 52 } 53 } 54 for (int j = 1; j <= n; ++j) { 55 if (dist[j] > ds) { 56 mindist = -1; 57 break; 58 } 59 if (dist[j] < mindist) mindist = dist[j]; 60 aver += 1.0 * dist[j]; 61 } 62 if (mindist == -1) continue; 63 aver = aver / n; 64 if (mindist > ansdist) { 65 ansdist = mindist; 66 ansaver = aver; 67 ansid = i; 68 } else if (mindist == ansdist && aver < ansaver) { 69 ansaver = aver; 70 ansid = i; 71 } 72 } 73 74 if (ansid == -1) 75 printf("No Solution "); 76 else 77 printf("G%d %.1f %.1f ", ansid - n, ansdist, ansaver); 78 79 return 0; 80 }
参考：