PAT(Advance)1072. Gas Station

PAT(Advance)1072. Gas Station

该题分制为30分。
题目链接https://pintia.cn/problem-sets/994805342720868352/problems/994805396953219072

A1072还是用Dijkstra来做。只需要对dis数组进行处理就能得到答案。

主要麻烦的是：
1.因为加油站的点是字符串，所以读入u，v是用字符串读入的，需要转换成数字。我的做法是将加油站的编号转换成1~M，
住宅的编号转换成M+1~N+M。这样前M个点就是起点了。
2.因为没有仔细审题，以为只需要平均路径最短就行，结果一直和测试样例答案不同，后来审题才发现，题目首先要保证最近的住宅距离最远且在服务范围内。

#include<iostream>
#include<cmath>
using namespace std;
const int maxn = 1100;
const int INF = 99999999;
int G[maxn][maxn];
bool vis[maxn] = { false };
int dis[maxn];
int n, m, k, d;

void Dijkstra(int s)
{
	fill(dis, dis + maxn, INF);
	dis[s] = 0;
	for (int i = 1; i <= n + m; i++)
	{
		int u = -1, MIN = INF;
		for (int j = 1; j <= n + m; j++)
		{
			if (!vis[j] && dis[j] < MIN)
			{
				MIN = dis[j];
				u = j;
			}
		}
		if (u == -1) return;
		vis[u] = true;
		for (int v = 1; v <= n + m; v++)
		{
			if (!vis[v] && G[u][v] != INF&& dis[u] + G[u][v] < dis[v])
			{
				dis[v] = dis[u] + G[u][v];
			}
		}
	}
}

int str2num(string s)
{
	int sum = 0;
	int index = 0;
	int temp = 0;
	for (auto t = s.rbegin(); t != s.rend(); t++)
	{
		if (isdigit(*t))
		{
			temp= *t - '0';
			sum += temp * pow(10, index++);
		}
		else
		{
			sum -= m;
		}
	}
	return sum + m;
}

int main()
{
	fill(G[0], G[0] + maxn * maxn, INF);
	cin >> n >> m >> k >> d;
	for (int i = 0; i < k; i++)
	{
		string s1, s2;
		int u,v,w;
		cin >> s1 >> s2 >> w;
		u = str2num(s1);
		v = str2num(s2);
		//cout << u << " " << v << " " << w << endl;
		G[u][v] = G[v][u] = w;
	}
	double minavg = INF, mindis=0;
	int index=0;
	for (int i = 1; i <= m; i++)
	{
		int flag = 0;
		double mind = INF, sum = 0, avg;
		fill(vis, vis + maxn, false);
		Dijkstra(i);
		for (int j = m+1; j <= n + m; j++)
		{
			if (dis[j] > d)
			{
				flag++;
				break;
			}
			sum += dis[j];
			if (dis[j] < mind)
			{
				mind = dis[j];
			}
		}
		avg = sum / n;
		if (flag == 0)
		{
			if (mind > mindis)//最近的住宅要尽可能远
			{
				minavg = avg;
				index = i;
				mindis = mind;
			}
			else if (mindis == mind&&avg < minavg)
			{
				minavg = avg;
				index = i;
				
			}
		}
	}
	if (index != 0)
	{
		cout << 'G' << index << endl;
		printf("%.1f %.1f", mindis,minavg );
	}
	else
	{
		cout << "No Solution";
	}
	return 0;
}