29819번 - Two Pointers (easy version) 서브태스크다국어

문제

Alice and Bob are visiting cities on a very long road that stretches from points $-10^9$ to 10ドル^9$. Alice starts at point $A$ while Bob starts at point $B$.

There are $n$ cities to visit, where the $i$-th city is at point $t_i$. Each city must be visited by Alice or Bob at least once, but they can be visited in any order.

What is the minimum total distance Alice and Bob travel?

입력

Each test consists of multiple test cases. The first line contains a single integer $T$ (1ドル \le T \le 100$), the number of test cases. Each test case is formatted as follows:

The first line contains three space-separated integers $n,ドル $A,ドル and $B$ (1ドル \le n \le 2 \cdot 10^5,ドル $-10^9 \le A, B \le 10^9$) -- the number of cities, Alice's position, and Bob's position, respectively.

The second line contains $n$ space-separated integers $t_1, t_2, \ldots, t_n$ ($-10^9 \le t_i \le 10^9$) -- the positions of the cities.

It is guaranteed that the sum of $n$ over all test cases is at most 2ドル \cdot 10^5$.

출력

For each test case, print the answer on a separate line.

Output the minimum total distance that Alice and Bob must travel to visit all cities.

제한

서브태스크

노트

In the first test case: There are 7ドル$ cities. Alice starts at coordinate $-6$ and Bob starts at point 10ドル$.

One possible optimal way to visit all cities is as follows ($i \xrightarrow{x} j$ means to go from $i$ to $j,ドル driving $x$ distance):

• Alice visits the cities (given in order): $A \xrightarrow{0} \text{city }6 \xrightarrow{9} \text{city }1$.
• Bob visits the cities (given in order): $B \xrightarrow{1} \text{city }5 \xrightarrow{1} \text{city }3 \xrightarrow{4} \text{city }4 \xrightarrow{8} \text{city }7 \xrightarrow{1} \text{city }2$.

Alice drives for a total of 0ドル + 9 = 9$ distance and Bob drives for a total of 1ドル + 1 +たす 4 +たす 8 +たす 1 =わ 15$ distance. The total distance driven by both Alice and Bob is 9ドル + 15 = 24$. It can be proven that there is no way to drive less than 24ドル$ distance, thus the answer is 24ドル$.

In the second test case, Alice and Bob are both already at city 2ドル$. Bob can visit the city 2ドル$ then city 1ドル,ドル driving 2,000,000,000ドル$ total distance. Note that Alice can choose to do nothing.

In the third test case, Alice can visit the only city, driving from point 4ドル$ to point 1ドル$ for 3ドル$ distance. Bob does nothing.