P1744 采购特价商品(dijkstra单源最短路)

P1744 采购特价商品https://www.luogu.com.cn/problem/P1744

#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 = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
int cnt;
int head[MAXN];
int nxt[MAXN];
int ver[MAXN];
double cost[MAXN];
struct node {
	int x, y;
} s[MAXN];
double d[MAXN];

inline void add(int x, int y, double c) {
	ver[++cnt] = y;
	cost[cnt] = c;
	nxt[cnt] = head[x];
	head[x] = cnt;
}
typedef pair<double, int> P;

inline void dijkstra(int s) {
	for (int i = 1; i <= n; i++) {
		d[i] = 1e9;
	}
	d[s] = 0;
	priority_queue<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 = head[t.second]; i; i = nxt[i]) {
			int y = ver[i];
			double c = cost[i];
			if (d[y] > d[t.second] + c) {
				d[y] = d[t.second] + c;
				que.push(P(-d[y], y));
			}
		}
	}
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", &s[i].x, &s[i].y);
	}
	scanf("%d", &m);
	int u, v;
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", &u, &v);
		double c = sqrt((s[u].x - s[v].x) * (s[u].x - s[v].x) + (s[u].y - s[v].y) * (s[u].y - s[v].y));
		add(u, v, c);
		add(v, u, c);
	}
	int s, t;
	scanf("%d %d", &s, &t);
	dijkstra(s);
	printf("%.2lf", d[t]);
	return 0;
}