【题解】BZOJ4152：[AMPPZ2014]The Captain

原题传送门
两两连边，边太多了！
怎么办？
注意到有些边是什么用也没有的，考虑连一些有用边

min(|x1-x2|,|y1-y2|)是个幌子，其实两个都连一遍就好了，反正等一下跑最短路无影响
然后只要分别按照x、y排序，相邻两个点连边就行了，其他边都是多余的

最后跑一个dijkstra

Code：

#include <bits/stdc++.h>
#define maxn 200010
using namespace std;
struct node{
	int val, len;
	bool operator < (const node &x) const{ return x.len < len; }
};
priority_queue <node> q;
struct Edge{
	int to, next, len;
}edge[maxn << 2];
int num, head[maxn], dis[maxn], vis[maxn], n;
struct Node{
	int x, y, id;
}a[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void addedge(int x, int y, int z){
	edge[++num] = (Edge) { y, head[x], z }; head[x] = num;
	edge[++num] = (Edge) { x, head[y], z }; head[y] = num;
}

bool cmp1(Node x, Node y){ return x.x < y.x; }
bool cmp2(Node x, Node y){ return x.y < y.y; }

void dijkstra(){
	for (int i = 2; i <= n; ++i) dis[i] = 1e9;
	q.push( (node) {1, 0} );
	while (!q.empty()){
		node tmp = q.top(); q.pop();
		int u = tmp.val, len = tmp.len;
		if (vis[u]) continue;
		vis[u] = 1;
		for (int i = head[u]; i; i = edge[i].next){
			int v = edge[i].to;
			if (dis[v] > len + edge[i].len){
				dis[v] = len + edge[i].len;
				if (!vis[v]) q.push( (node) { v, dis[v] });
			}
		}
	}
	printf("%d\n", dis[n]);
}

int main(){
	n = read();
	for (int i = 1; i <= n; ++i) a[i].x = read(), a[i].y = read(), a[i].id = i;
	sort(a + 1, a + 1 + n, cmp1);
	for (int i = 1; i < n; ++i) addedge(a[i].id, a[i + 1].id, a[i + 1].x - a[i].x);
	sort(a + 1, a + 1 + n, cmp2);
	for (int i = 1; i < n; ++i) addedge(a[i].id, a[i + 1].id, a[i + 1].y - a[i].y);
	dijkstra();
	return 0;
}