FOJ Problem 2261 浪里个浪

#define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
#define inf 0x3f3f3f3f

struct Edge {
    int from, to, dist;
    Edge(int u = 0, int v = 0, int w = 0) :from(u), to(v), dist(w) {}
};

struct HeapNode {
    int dist, u;  //顶点u距离s的距离为dist
    HeapNode(int w = 0, int x = 0) :dist(w), u(x) {}
    bool operator<(const HeapNode&rhs)const {
        return dist>rhs.dist;
    }
};

struct Graph {
    const static int V = 1e5 + 10+2;
    int n, m;
    vector<Edge>edges;    // 边集
    vector<int>G[V];
    bool done[V];   //是否已经永久标号
    int d[V];     //s到各个顶点的距离

    void init(int n) {
        this->n = n;
        for (int i = 0; i<n; i++)G[i].clear();
        edges.clear();
    }

    void addEdge(int from, int to, int dist) {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

    void dijkstra(const vector<int>&s) {
        memset(d, 0x3f, sizeof(d));
        memset(done, 0, sizeof(done));
        priority_queue<HeapNode>Q;
        int ns = s.size();
        for (int i = 0; i<ns; i++) {
            d[s[i]] = 0;
            Q.push(HeapNode(0, s[i]));
        }

        while (!Q.empty()) {
            HeapNode x = Q.top(); Q.pop();
            int u = x.u;  // 拿最小距离的顶点编号
            if (done[u])continue;  //每个顶点出发只可以松弛一次
            done[u] = true;
            for (int i = 0; i<G[u].size(); i++) {
                Edge&e = edges[G[u][i]];   //取出一条邻边
                if (d[e.to]>d[u] + e.dist) {
                    d[e.to] = d[u] + e.dist;
                    Q.push(HeapNode(d[e.to], e.to));
                }
            }
        }
    }

    int slove(const vector<int>&s, const vector<int>&t) {
        dijkstra(s);
        int res = inf, nt = t.size();
        for (int i = 0; i<nt; i++) {
            res = min(res, d[t[i]]);
        }
        return res;
    }

}slover;
vector<int>s, t;
int main() {
    //源点0，汇点n+1
    //freopen("in.txt","r",stdin);
    int n, m, u, v, w, S, E;
    while (scanf("%d %d", &n, &m) == 2) {
        slover.init(n + 2);
        s.clear(), t.clear();
        for (int i = 0; i<m; i++) {
            scanf("%d %d %d", &u, &v, &w);
            slover.addEdge(u, v, w);
        }
        s.push_back(0);
        scanf("%d", &S);
        for (int i = 0; i < S; i++) {
            int a;
            scanf("%d",&a);
            slover.addEdge(0,a,0);
        }
        scanf("%d", &E);
        t.resize(E);
        for (int i = 0; i < E; i++) {
            scanf("%d", &t[i]);
        }
        printf("%d\n", slover.slove(s, t));
    };
    return 0;
}