Exercising Walk

题目连接: Exercising Walk

题目:

Alice has a cute cat. To keep her cat fit, Alice wants to design an exercising walk for her cat!

Initially, Alice’s cat is located in a cell (x,y) of an infinite grid. According to Alice’s theory, cat needs to move:

exactly a steps left: from (u,v) to (u−1,v);
exactly b steps right: from (u,v) to (u+1,v);
exactly c steps down: from (u,v) to (u,v−1);
exactly d steps up: from (u,v) to (u,v+1).
Note that the moves can be performed in an arbitrary order. For example, if the cat has to move 1 step left, 3 steps right and 2 steps down, then the walk right, down, left, right, right, down is valid.

Alice, however, is worrying that her cat might get lost if it moves far away from her. So she hopes that her cat is always in the area [x1,x2]×[y1,y2], i.e. for every cat’s position (u,v) of a walk x1≤u≤x2 and y1≤v≤y2 holds.

Also, note that the cat can visit the same cell multiple times.

Can you help Alice find out if there exists a walk satisfying her wishes?

Formally, the walk should contain exactly a+b+c+d unit moves (a to the left, b to the right, c to the down, d to the up). Alice can do the moves in any order. Her current position (u,v) should always satisfy the constraints: x1≤u≤x2, y1≤v≤y2. The staring point is (x,y).

You are required to answer t test cases independently.

Input
The first line contains a single integer t (1≤t≤103) — the number of testcases.
The first line of each test case contains four integers a, b, c, d (0≤a,b,c,d≤108, a+b+c+d≥1).
The second line of the test case contains six integers x, y, x1, y1, x2, y2 (−108≤x1≤x≤x2≤108, −108≤y1≤y≤y2≤108).

Output
For each test case, output “YES” in a separate line, if there exists a walk satisfying her wishes. Otherwise, output “NO” in a separate line.
You can print each letter in any case (upper or lower).

Example
Input
6
3 2 2 2
0 0 -2 -2 2 2
3 1 4 1
0 0 -1 -1 1 1
1 1 1 1
1 1 1 1 1 1
0 0 0 1
0 0 0 0 0 1
5 1 1 1
0 0 -100 -100 0 100
1 1 5 1
0 0 -100 -100 100 0

Output
Yes
No
No
Yes
Yes
Yes

Note
In the first test case, one valid exercising walk is
(0, 0)→(−1, 0)→(−2, 0)→(−2, 1)→(−2, 2)→(−1, 2)→(0, 2)→(0, 1)→(0, 0)→(−1, 0)

大致题意:

题中说有一只猫, 这只猫一开始在(x, y), 它需要分别向左右上下各走a, b ,c, d步, 你可以自定义它走路的顺序, 且同一个方格可以反复经过, 但是猫不能出 以x1, x2, y1, y2为边界的方格. 问你是否能安排出合理的散步顺序.

解题思路:

首先题目中已经告诉我们, x1 <= x <= x2, y1 <= y <= y2, 所以不存在一开始就无解的情况, 那么接着往下分:
①如果 x1 = x 且 x2 = x, 即: 猫无法向左或向右行动, 那么如果向左走和向右走的总步数不为0, 那么就无解.y方向同理.
②如果没有出现上述情况, 那么猫向左走了a步, 向右走了b步, 无论怎么安排, 最终它的横坐标都将为(x-a+b), 同理可知纵坐标为(y-c+d). 判断最终的位置是否仍在规定区域内即可.

AC代码:

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(void)
{
	int t; cin >> t;
	while (t--) {
		int a, b, c, d; 
		int x, y, x1, y1, x2, y2;
		scanf("%d %d %d %d", &a, &b, &c, &d);
		scanf("%d %d %d %d %d %d", &x, &y, &x1, &y1, &x2, &y2);
		bool flag = 1;
		if (x1 == x2 && a + b != 0) flag = 0; //情况一
		else if (y1 == y2 && c + d != 0) flag = 0; //情况一
		x += b - a; y += d - c;
		if (x < x1 || x > x2 || y < y1 || y > y2) flag = 0; //情况二
		if (flag) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}

END