PATA1072_Dijkstra（难度：⭐️⭐️⭐️）

这个题难的是理解题意，一开始离房子最远这个点，我都想反了，以为不是求最短路径了，是求最长路径。。。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1100;
const int INF = 999999999;
int G[maxn][maxn], dis[maxn], Gas[maxn];
int n, m , k, Ds, cost, a, b, minID = INF, minD = 0;
double minAvg = 1.0 * INF;
bool vis[maxn];
vector<vector<int>> path;
vector<int> temppath, ans;
void Dijkstra(int s) {
    fill (dis, dis + maxn, INF);
    fill (vis, vis + maxn, false);
    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] == false && MIN > dis[j]) {
                u = j;
                MIN = dis[j];
            }
        }
        if (u == -1) return;
        vis[u] = true;
        for (int v = 1; v <= n + m; v++) {
            if (vis[v] == false && G[v][u] != INF) {
                if (G[u][v] + dis[u] < dis[v]) {
                    dis[v] = G[u][v] + dis[u];
                    path[u].clear();
                    path[u].push_back(v);
                }
                else if (G[u][v] + dis[u] == dis[v])
                    path[v].push_back(u);
            }
        }
    }
}
void select (int s) {
    int sum = 0, Min = INF;
    double avg = 0.0;
    for (int i = 1; i <= n; i++) {
        if (dis[i] > Ds) return;
        if (dis[i] != INF) {
            sum += dis[i];
        }
        if (Min > dis[i]) Min = dis[i];
    }
    avg = 1.0 * sum / n;
    if (Min > minD) {
        minAvg = avg;
        minID = s;
        minD = Min;
    }
    else if (Min == minD && avg < minAvg) {
        minID = s;
        minAvg = avg;
    }
    Gas[s] = Min;
}
int main() {
    fill (G[0], G[0] + maxn * maxn, INF);
    scanf ("%d %d %d %d", &n, &m, &k, &Ds);
    path.resize(n + m + 1);
    for (int i = 0; i < k; i++) {
        string p1, p2;
        cin >> p1 >> p2 >> cost;
        if (p1[0] == 'G') a = n + stoi(p1.substr(1));
        else a = stoi (p1);
        if (p2[0] == 'G') b = n + stoi(p2.substr(1));
        else b = stoi (p2);
        G[a][b] = G[b][a] = cost;
    }
    for (int i = n + 1; i <= n + m; i++) {
        Dijkstra(i);
        select(i);
    }
    if (minAvg == INF) printf ("No Solution");
    else printf ("G%d\n%.1f %.1f", minID - n, 1.0 * Gas[minID], minAvg);
}