【最短路】PTA L3-005. 垃圾箱分布（30分）

Step 1 Problem:

无向图，总共给你(n+m个点)有n个居民点，m个垃圾箱点。k条边。
输出哪个垃圾箱到所有居民点最短距离最远 且 不超过Ds。
同时 输出到居民点最短距离 和 平均距离。
垃圾箱不存在输出“No Solution”
数据范围：
正整数：n<=1e3, M <= 10, k <= 1e4

Step 2 Involving algorithms:

最短路

Step 3 Ideas:

枚举所有的垃圾箱点，跑最短路，更新答案

Step 4 Code:

#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
struct node
{
    int to, w, next;
};
node Map[20055];
int cnt, dist[1200], vis[1200], head[1200];
int n, dis;
int ansid, ans_dist, ans_mindist;
void spfa(int s)
{
    memset(vis, 0, sizeof(vis));
    memset(dist, inf, sizeof(dist));
    queue<int> q;
    q.push(s);
    vis[s] = 1; dist[s] = 0;
    while(!q.empty())
    {
        int u = q.front(); q.pop();
        vis[u] = 0;
        for(int i = head[u]; ~i; i = Map[i].next)
        {
            int to = Map[i].to, w = Map[i].w;
            if(dist[to] > dist[u] + w)
            {
                dist[to] = dist[u] + w;
                if(!vis[to])
                {
                    vis[to] = 1;
                    q.push(to);
                }
            }
        }
    }
    int dist1 = 0, min_dist1 = inf, i;
    for(i = 1; i <= n; i++)
    {
        if(dist[i] > dis) break;
        min_dist1 = min(min_dist1, dist[i]);
        dist1 += dist[i];
    }
    if(i > n && ((min_dist1 > ans_mindist) || (min_dist1 == ans_mindist && dist1 < ans_dist))) {//更新答案
        ansid = s;
        ans_dist = dist1;
        ans_mindist = min_dist1;
    }
   // printf("%d %d %d\n", ansid, dist1, min_dist1);
}
void add(int u, int v, int w)
{
    Map[cnt] = (node){v, w, head[u]};
    head[u] = cnt++;
    Map[cnt] = (node){u, w, head[v]};
    head[v] = cnt++;
}
int main()
{
    ansid = 0, ans_dist = inf, ans_mindist = 0;
    memset(head, -1, sizeof(head));
    int m, k;
    cin >> n >> m >> k >> dis;
    char s1[10], s2[10];
    int w, u, v;
    cnt = 0;
    while(k--)
    {
        scanf("%s %s %d", s1, s2, &w);
        if(s1[0] != 'G') {
            sscanf(s1, "%d", &u);
        } else {
            sscanf(s1, "%*c%d", &u);
            u += n;
        }
        if(s2[0] != 'G') {
            sscanf(s2, "%d", &v);
        } else {
            sscanf(s2, "%*c%d", &v);
            v += n;
        }
        add(u, v, w);
    }
   // printf("cnt %d\n", cnt);
    for(int i = 1; i <= m; i++)//枚举垃圾箱点跑最短路
    {
        int s = i+n;
        spfa(s);
    }
    if(ansid == 0) printf("No Solution\n");
    else {
        printf("G%d\n", ansid-n);
        printf("%.1lf %.1lf\n", 1.0*ans_mindist, ans_dist*1.0/n);
    }
    return 0;
}