1072 Gas Station (30)

最新推荐文章于 2020-08-22 12:24:02 发布

ysq96

最新推荐文章于 2020-08-22 12:24:02 发布

阅读量512

点赞数 2

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/ysq96/article/details/81158446

PAT 专栏收录该内容

152 篇文章

订阅专栏

本文介绍了一种算法，用于从多个候选位置中选择最优的加油站位置。目标是最小化居民区到加油站的距离，同时确保所有住宅都在服务范围内。通过使用Dijkstra算法计算最短路径来实现这一目标。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 (<= 10^3^), the total number of houses; M (<= 10), the total number of the candidate locations for the gas stations; K (<= 10^4^), the number of roads connecting the houses and the gas stations; and D~S~, 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:

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个加油站里面选取1个站点，让他离居民区的最近的人最远，并且没有超出服务范围ds之内。如果有很多个最远的加油站，输出距离所有居民区距离平均值最小的那个。如果平均值还是一样，就输出按照顺序排列加油站编号最小的那个。

用迪杰斯特拉找到加油站待选点距离房屋最短距离都是所有待选点中最长的那个且不超过服务范围就行。

C++：

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int inf = 999999999;
int n, m, k, ds, station;
int e[1020][1020], dis[1020];
bool visit[1020];
int main() {
	fill(e[0], e[0] + 1020 * 1020, inf);
	fill(dis, dis + 1020, inf);
	scanf("%d%d%d%d", &n, &m, &k, &ds);
	for(int i = 0; i < k; i++) {
		int tempdis;
		string s, t;
		cin >> s >> t >> tempdis;
		int a, b;
		if(s[0] == 'G') {
			s = s.substr(1);
			a = n + stoi(s);//储存加油站点
		} else {
			a = stoi(s);
		}
		if(t[0] == 'G') {
			t = t.substr(1);
			b = n + stoi(t);
		} else {
			b = stoi(t);
		}
		e[a][b] = e[b][a] = tempdis;
	}
	int ansid = -1;
	double ansdis = -1, ansaver = inf;
	for(int index = n + 1; index <= n + m; index++) {
		double mindis = inf, aver = 0;
		fill(dis, dis + 1020, inf);
		fill(visit, visit + 1020, false);
		dis[index] = 0;
		for(int i = 0; i < n + m; i++) {
			int u = -1, minn = inf;
			for(int j = 1; j <= n + m; j++) {
				if(visit[j] == false && dis[j] < minn) {
					u = j;
					minn = dis[j];
				}
			}
			if(u == -1) break;
			visit[u] = true;
			for(int v = 1; v <= n + m; v++) {
				if(visit[v] == false && dis[v] > dis[u] + e[u][v])
					dis[v] = dis[u] + e[u][v];
			}
		}
		for(int i = 1; i <= n; i++) {
			if(dis[i] > ds) {
				mindis = -1;
				break;
			}
			if(dis[i] < mindis) mindis = dis[i];
			aver += 1.0 * dis[i];
		}
		if(mindis == -1) continue;
		aver = aver / n;
		if(mindis > ansdis) {
			ansid = index;
			ansdis = mindis;
			ansaver = aver;
		} else if(mindis == ansdis && aver < ansaver) {
			ansid = index;
			ansaver = aver;
		}
	}
	if(ansid == -1)
		printf("No Solution");
	else
		printf("G%d\n%.1f %.1f", ansid - n, ansdis, ansaver);
	return 0;
}