P3905 道路重建(Dijkstra)

道路重建 - 洛谷https://www.luogu.com.cn/problem/P3905

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)


int n, m;
struct node {
	int to, cost;
	node(int x, int y): to(x), cost(y) {

	}
};
typedef pair<int, int> P;
vector<node> now[10005];
vector<node> last[10005];
int d[MAXN];

inline void dijkstra(int s) {
	for (int i = 1; i <= n; i++) {
		d[i] = INF;
	}
	d[s] = 0;
	priority_queue<P, vector<P>, greater<P> > que;
	que.push(P(0, s));
	while (!que.empty()) {
		P t = que.top();
		que.pop();
		if (d[t.second] < t.first) {
			continue;
		}
		for (int i = 0; i < now[t.second].size(); i++) {
			node e = now[t.second][i];
			if (d[e.to] > d[t.second] + e.cost) {
				d[e.to] = d[t.second] + e.cost;
				que.push(P(d[e.to], e.to));
			}
		}
	}
}

int main() {
	scanf("%d", &n);
	scanf("%d", &m);
	int x, y, t;
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d", &x, &y, &t);
		now[x].push_back(node(y, 0));
		now[y].push_back(node(x, 0));
		last[x].push_back(node(y, t));
		last[y].push_back(node(x, t));
	}
	int k;
	scanf("%d", &k);
	for (int i = 1; i <= k; i++) {
		scanf("%d %d", &x, &y);
		for (int i = 0; i < now[x].size(); i++) {
			if (now[x][i].to == y) {
				now[x][i].cost = last[x][i].cost;
			}
		}
		for (int i = 0; i < now[y].size(); i++) {
			if (now[y][i].to == x) {
				now[y][i].cost = last[y][i].cost;
			}
		}
	}
	scanf("%d %d", &x, &y);
	dijkstra(x);
	printf("%d", d[y]);
	return 0;
}