Returning Home(CodeForces - 1422D)

Returning Home

Yura has been walking for some time already and is planning to return home. He needs to get home as fast as possible. To do this, Yura can use the instant-movement locations around the city.

Let’s represent the city as an area of n×n square blocks. Yura needs to move from the block with coordinates (sx,sy) to the block with coordinates (fx,fy). In one minute Yura can move to any neighboring by side block; in other words, he can move in four directions. Also, there are mm instant-movement locations in the city. Their coordinates are known to you and Yura. Yura can move to an instant-movement location in no time if he is located in a block with the same coordinate x or with the same coordinate y as the location.

Help Yura to find the smallest time needed to get home.

Input

The first line contains two integers n and mm — the size of the city and the number of instant-movement locations (1≤n≤10⁹, 0≤m≤10⁵).

The next line contains four integers sx sy fx fy — the coordinates of Yura’s initial position and the coordinates of his home (1≤sx,sy,fx,fy≤n).

Each of the next mm lines contains two integers xi yi — coordinates of the i-th instant-movement location (1≤xi,yi≤n).

Output

In the only line print the minimum time required to get home.

Examples

Input

5 3
1 1 5 5
1 2
4 1
3 3

Output

5

Input

84 5
67 59 41 2
39 56
7 2
15 3
74 18
22 7

Output

42

Note

In the first example Yura needs to reach (5,5) from (1,1). He can do that in 5 minutes by first using the second instant-movement location (because its y coordinate is equal to Yura’s y coordinate), and then walking (4,1)→(4,2)→(4,3)→(5,3)→(5,4)→(5,5).

题意

在一个n*n大小的地图中，初始在位置 ( s x , s y ) (s_x,s_y) ,目标位置为 ( f x , f y )。每分钟可以向上下左右的地图内区域移动一格。在地图中有m个瞬移位置，当与这些位置处于同一行或同一列时，可以选择瞬间传送到该位置。求最快需要多久到达目标位置。

思路

一开始想到的是暴力建图跑最短路，但是发现那样是一个1e5的完全图肯定 不行。
那么我们把每个瞬移点拆成x点和y点两个点，最后再将这两个点之间连上一条边权为0的边即可。
对于两个瞬移点x：彼此之间距离为abs(x[i]-x[i-1]) y同理
最后跑最短路即可。

Code

#include<string>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<vector>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define LL long long
#define MOD 1000000007
#define PI 3.1415926535898
#define INF 1000055
#define MAXN 80000080
const double EPS = 1e-8;
LL read()
{
	LL x = 0, w = 1;
	char ch = 0;
	while (ch < '0' || ch>'9')
	{
		if (ch == '-')
		{
			w = -1;
		}
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9')
	{
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return w * x;
}
LL n, m, sx, sy, ex, ey;
LL s;
LL cnt, head[INF *2], d[INF * 2];
struct node {
	LL to=0, next=0, w=0;
};
node edge[INF * 4];
void add(LL x, LL y, LL w)
{
	//cout<<x<<' '<<y<<' '<<w<<endl; 
	edge[++cnt].to = y;
	edge[cnt].next = head[x];
	edge[cnt].w = w;
	head[x] = cnt;
	edge[++cnt].to = x;
	edge[cnt].next = head[y];
	edge[cnt].w = w;
	head[y] = cnt;
}
struct nn {
	LL x, dis;
	bool operator <(const nn& b)const//重载运算符'<' 
	{
		return dis > b.dis;//顺序按照dis从小到大排（此处与sort的cmp恰好相反） 
	}
};//记录入队的节点和距离 
priority_queue < nn > q;
inline nn init(LL xx, LL dd)
{
	nn t;
	t.x = xx;
	t.dis = dd;
	return t;
}
nn now;
void dij(LL s)
{
	for (register LL i = 1; i <= INF; i++)//初始化 这里不能用m因为m可以等于0
	{
		d[i] = 0x3f3f3f3f3f;
	}
	d[s] = 0;//d[x]代表点s到 x的距离 
	now.x = s;
	now.dis = 0;
	q.push(now);
	while (!q.empty())
	{
		now = q.top();
		q.pop();
		if (now.dis > d[now.x])//优化 如果该边权大于到点now.x的距离 说明该边比已有点更差就没有必要去遍历该点了  
			continue;
		for (register LL i = head[now.x]; i != 0; i = edge[i].next)//遍历当前now点所连接的所有边 
		{
			if (d[edge[i].to] > d[now.x] + edge[i].w)//如果该边比已有点更优 则对该边所连的点进行松弛，并将该点入列 
			{
				d[edge[i].to] = d[now.x] + edge[i].w;
				q.push(init(edge[i].to, d[edge[i].to]));
			}
		}
	}
}
LL a[INF], b[INF], aa[INF], bb[INF];
bool cmp(LL xxx, LL yyy)
{
	return xxx < yyy;
}
int main()
{
	n = read();
	m = read();
	sx = read();
	sy = read();
	ex = read();
	ey = read();
	for (register LL i = 1; i <= m; i++)
	{
		a[i] = read();
		b[i] = read();
		aa[i] = a[i];
		bb[i] = b[i];
	}
	sort(a + 1, a + m + 1, cmp);
	sort(b + 1, b + m + 1, cmp);
	LL ss, ee;
	ss = m * 4 + 1;
	ee = m * 4 + 2;
	add(ss, ee, abs(sx - ex) + abs(sy - ey));
	for (register LL i = 2; i <= m; i++)
	{
		add(i, i - 1, abs(a[i] - a[i - 1]));
		add(i + m, i + m - 1, abs(b[i] - b[i - 1]));
	}
	for (register LL i = 1; i <= m; i++)
	{
		add(ss, i, abs(sx - a[i]));
		add(ss, m+i, abs(sy - b[i]));
		LL pos1 = lower_bound(a + 1, a + m + 1, aa[i]) - a;
		LL pos2 = lower_bound(b + 1, b + m + 1, bb[i]) - b;
		add(pos1, pos2 + m, 0);
		//add(ss, pos1, abs(sx - a[pos1]));
		//add(ss, pos2 + m, abs(sy - b[pos2]));
		add(ee, pos1, abs(ex - a[pos1]) + abs(ey - b[pos2]));
		//add(ee, pos2 + m, abs(ex - a[pos1]) + abs(ey - b[pos2]));
	}
	dij(ss);
	cout << d[ee] << endl;
	return 0;
}