2019南昌网络赛B. Fire-Fighting Hero 最短路SPFA

图论：
1、看清是否directed；
2、板子一定要用对
技巧：超级源点
把需要跑最短路的点连上序号为0的点，距离设为0.

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstdlib>
#include<string.h>
#include<iomanip>
#define ll long long
#define Max(a,b) ((a) > (b) ? (a) : (b))
#define INF 0x3f3f3f3f
#define eps 1e-6
const int mod = 1e9+7;
const int maxn = 1e3 + 10 ;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
ll gcd(ll p,ll q){return q==0?p:gcd(q,p%q);}
using namespace std;

ll fire[maxn];
int vis[maxn],v[maxn],hashv[maxn];
int n,m,s,k;
double c;

const int MAXN = 1e3+10;
struct qNode
{
    int v;
    int c;
    qNode(int _v = 0, int _c = 0) : v(_v), c(_c) {}
    bool operator < (const qNode &r) const
    {
        return c > r.c;
    }
};

struct Edge
{
    int v;
    int cost;
    Edge(int _v = 0, int _cost = 0) : v(_v), cost(_cost) {}
};

vector<Edge> E[MAXN];
ll dist[MAXN];     //  最短路距离

ll Dijkstra(int start)     //  点的编号从1开始
{
    memset(vis, false, sizeof(vis));
    memset(dist, 0x3f, sizeof(dist));
    priority_queue<qNode> que;

    while (!que.empty())
    {
        que.pop();
    }
    dist[start] = 0;
    que.push(qNode(start, 0));
    qNode tmp;

    while (!que.empty())
    {
        tmp = que.top();
        que.pop();
        int u = tmp.v;
        if (vis[u])
        {
            continue;
        }
        vis[u] = true;
        for (int i = 0; i < E[u].size(); i++)
        {
            int v = E[u][i].v;
            int cost = E[u][i].cost;
            if (!vis[v] && dist[v] > dist[u] + cost)
            {
                dist[v] = dist[u] + cost;
                que.push(qNode(v, dist[v]));
            }
        }
    }
    ll ret=0;
    for(int i=1;i<=n;i++)
        ret = max(ret,dist[i]);
    return ret;
}

void addEdge(ll u, ll v, ll w)
{
    E[u].push_back(Edge(v, w));
}
void Dijkstra1(int start)     //  点的编号从1开始
{
    memset(vis, false, sizeof(vis));
    memset(dist, 0x3f, sizeof(dist));
    priority_queue<qNode> que;

    while (!que.empty())
    {
        que.pop();
    }
    dist[start] = 0;
    que.push(qNode(start, 0));
    qNode tmp;

    while (!que.empty())
    {
        tmp = que.top();
        que.pop();
        int u = tmp.v;
        if (vis[u])
        {
            continue;
        }
        vis[u] = true;
        for (int i = 0; i < E[u].size(); i++)
        {
            int v = E[u][i].v;
            int cost = E[u][i].cost;
            if (!vis[v] && dist[v] > dist[u] + cost)
            {
                dist[v] = dist[u] + cost;
                que.push(qNode(v, dist[v]));
            }
        }
    }
    for(int i=1;i<=n;i++)
        if (!hashv[i])
            fire[i] = min(fire[i], dist[i]);
}
inline void init(){
    scanf("%d%d",&n,&m);
    scanf("%d%d%lf",&s,&k,&c);
    memset(hashv,0,sizeof hashv);
    memset(fire,INF,sizeof fire);
    for(int i=1;i<=n;i++) E[i].clear();

    for(int i = 1; i <= k; ++i)
        scanf("%d",&v[i]),hashv[v[i]]=1;

    for(int i = 0; i < m; ++i){
        ll u,v,w;
        scanf("%lld%lld%lld",&u,&v,&w);
        addEdge(u,v,w);
        addEdge(v,u,w);
    }
}

int main(){
    int T;scanf("%d",&T);
    while(T--) {
        init();
        ll ans1 = Dijkstra(s);
        ll ans2 = 0;
        for(int i = 1; i <= k; ++i)
            Dijkstra1(v[i]);
        for(int i=1;i<=n;i++)
            if(!hashv[i]) ans2=max(ans2,fire[i]);

        if(ans1 == (ll)c*ans2) printf("%lld\n",ans1);
        else {
            if (ans1 / c > ans2) printf("%lld\n", ans2);
            else printf("%lld\n", ans1);
        }
    }
    return 0;
}