VK Cup 2022 - Отборочный раунд (Engine)
A
Parallel Projection
Codeforces
800
原题
←B →
翻译中…

Vika's house has a room in a shape of a rectangular parallelepiped (also known as a rectangular cuboid). Its floor is a rectangle of size $w \times d$, and the ceiling is right above at the constant height of $h$. Let's introduce a coordinate system on the floor so that its corners are at points $(0, 0)$, $(w, 0)$, $(w, d)$, and $(0, d)$.

翻译中…

A laptop is standing on the floor at point $(a, b)$. A projector is hanging on the ceiling right above point $(f, g)$. Vika wants to connect the laptop and the projector with a cable in such a way that the cable always goes along the walls, ceiling, or floor (i. e. does not go inside the cuboid). Additionally, the cable should always run parallel to one of the cuboid's edges (i. e. it can not go diagonally).

翻译中…

What is the minimum length of a cable that can connect the laptop to the projector?

翻译中…

image Illustration for the first test case. One of the optimal ways to put the cable is shown in green.

翻译中…

Input

翻译中…

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). The description of the test cases follows.

翻译中…

The first line of each test case contains three integers $w$, $d$, and $h$ ($2 \le w, d, h \le 1000$) — the size of the room.

翻译中…

The second line contains four integers $a$, $b$, $f$, $g$ ($0 \lt a, f \lt w$; $0 \lt b, g \lt d$): the laptop is located on the floor at point $(a, b)$, while the projector is hanging on the ceiling right above point $(f, g)$.

翻译中…

Output

翻译中…

For each test case, print a single integer — the minimum length of the cable connecting the laptop and the projector that runs only along the walls, floor, and ceiling parallel to cuboid's edges.

翻译中…

Note

翻译中…

The picture in the statement illustrates the first test case.

翻译中…

样例

Input #1
5
55 20 29
23 10 18 3
20 10 5
1 5 2 5
15 15 4
7 13 10 10
2 1000 2
1 1 1 999
10 4 10
7 1 2 1
Output #1
47
8
14
1002
17
InputCopy OutputCopy
题目信息
题号
1781A
时间限制
1 s
内存限制
512 MB
标签
计算几何
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。