题意:
大致意思就是让你在符合条件的垃圾桶找出到所有居民最短路最大的垃圾桶,符合条件的垃圾桶就是到所有居民的距离小于等于Ds。
思路:
垃圾桶索引从 1 开始,居民索引从k + 1开始,枚举所有垃圾桶跑最短路,将符合条件的垃圾桶索引放入res,再根据题目的几个条件找到答案即可。
题目样例 1 有问题,ac代码的平均路径没有四舍五入,样例 1 却四舍五入了。
代码:
#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define debug(a) cout << "debug : " << (#a) << " = " << a << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 1e3 + 100;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int mod = 998244353;
int n, k, m, r;
vector<PII> a[N];
int dis[15][N]; //记录所有垃圾桶到居民的最短路
bool vis[N];
vector<int> res; //保存有效垃圾桶
void dijkstra(int st)
{
memset(vis, false, sizeof vis);
priority_queue<PII, vector<PII>, greater<PII>> pq;
dis[st][st] = 0;
pq.push({0, st});
while (pq.size())
{
PII t = pq.top();
pq.pop();
int idx = t.second, distance = t.first;
if (vis[idx])
continue;
vis[idx] = true;
for (auto p : a[idx])
{
int j = p.second;
if (dis[st][j] > p.first + distance)
{
dis[st][j] = p.first + distance;
pq.push({dis[st][j], j});
}
}
}
}
int main()
{
cin >> n >> k >> m >> r;
while (m--)
{
string ls, rs;
int l, r, w;
cin >> ls >> rs >> w;
if (ls[0] == 'G')
{
ls.erase(0, 1);
l = stoi(ls);
}
else
l = stoi(ls) + k;
if (rs[0] == 'G')
{
rs.erase(0, 1);
r = stoi(rs);
}
else
r = stoi(rs) + k;
a[l].push_back({w, r}), a[r].push_back({w, l});
}
memset(dis, INF, sizeof dis);
for (int i = 1; i <= k; i++) //枚举每个垃圾桶为起点
{
dijkstra(i);
bool flag = true;
for (int j = k + 1; j <= k + n; j++)
{
if (dis[i][j] > r) //超过r则该垃圾桶无效
{
flag = false;
break;
}
}
if (flag)
res.push_back(i);
}
if (!res.size())
{
cout << "No Solution" << endl;
return 0;
}
int idx;
double Min_path, Max = -INF, tsum, sum;
for (auto p : res) //找出符合条件的垃圾桶中到所有居民最短路最大,最短路相同选路径平均值最小,前两者都相同则选序号小的
{
Min_path = INF, tsum = 0;
for (int i = k + 1; i <= k + n; i++)
{
Min_path = min(Min_path, (double)dis[p][i]);
tsum += dis[p][i];
}
if (Max < Min_path || Max == Min_path && tsum < sum || Max == Min_path && tsum == sum && p < idx)
{
idx = p;
Max = Min_path;
sum = tsum;
}
}
cout << 'G' << idx << endl;
printf("%.1lf %.1lf\n", Max, sum / n);
return 0;
}