Returning Home

题意翻译

Yura在一个$n \times n$的城市中(即可以把城市看作一个$n \times n$的网格),现在Yura要尽快从点$(s_{x},s_{y})$移动到点$(f_{x},f_{y})$. Yura可以用一分钟向上下左右任意一个方向移动一格.特别的,城市中有$m$个传送点,第$i$个的坐标为$(x_{i},y_{i})$.当Yura与一个传送点横坐标相同或纵坐标相同,那么Yura就可以瞬间传送到该传送点. 求到达目的地的最短用时. 保证: $1 \leq n \leq 10^9,1 \leq m \leq 10^5,1 \leq s_{x},s_{y},f_{x},f_{y},x_{i},y_{i} \leq n$.

题目描述

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 \times n $ square blocks. Yura needs to move from the block with coordinates $ (s_x,s_y) $ to the block with coordinates $ (f_x,f_y) $ . In one minute Yura can move to any neighboring by side block; in other words, he can move in four directions. Also, there are $ m $ 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.

输入输出格式

输入格式

The first line contains two integers $ n $ and $ m $ — the size of the city and the number of instant-movement locations ( $ 1 \le n \le 10^9 $ , $ 0 \le m \le 10^5 $ ). The next line contains four integers $ s_x $ $ s_y $ $ f_x $ $ f_y $ — the coordinates of Yura's initial position and the coordinates of his home ( $ 1 \le s_x, s_y, f_x, f_y \le n $ ). Each of the next $ m $ lines contains two integers $ x_i $ $ y_i $ — coordinates of the $ i $ -th instant-movement location ( $ 1 \le x_i, y_i \le n $ ).

输出格式

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

输入输出样例

输入样例 #1

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

输出样例 #1

5

输入样例 #2

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

输出样例 #2

42

说明

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) \to (4, 2) \to (4, 3) \to (5, 3) \to (5, 4) \to (5, 5) $ .

题意翻译

Yura在一个$n \times n$的城市中(即可以把城市看作一个$n \times n$的网格),现在Yura要尽快从点$(s_{x},s_{y})$移动到点$(f_{x},f_{y})$. Yura可以用一分钟向上下左右任意一个方向移动一格.特别的,城市中有$m$个传送点,第$i$个的坐标为$(x_{i},y_{i})$.当Yura与一个传送点横坐标相同或纵坐标相同,那么Yura就可以瞬间传送到该传送点. 求到达目的地的最短用时. 保证: $1 \leq n \leq 10^9,1 \leq m \leq 10^5,1 \leq s_{x},s_{y},f_{x},f_{y},x_{i},y_{i} \leq n$.