Codeforces 1332 A. Exercising Walk

最新推荐文章于 2021-02-08 01:50:36 发布

Huffman_Tree_

最新推荐文章于 2021-02-08 01:50:36 发布

阅读量273

点赞数

分类专栏： CodeForces

转载请注明出处//https://blog.csdn.net/qq_43658924

本文链接：https://blog.csdn.net/qq_43658924/article/details/105244343

版权

CodeForces 专栏收录该内容

53 篇文章 3 订阅

订阅专栏

A. Exercising Walk
time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
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
inputCopy
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
outputCopy
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)

 
int t;
int n,m;
int a,b,c,d;
int x,y,x1,y11,x2,y2;
 
int main() {
    scanf("%d",&t);
    while(t--) {
        cin>>a>>b>>c>>d;
        cin>>x>>y>>x1>>y11>>x2>>y2;
        int xx=b-a;
        int yy=d-c;
       xx+=x;
       yy+=y;
       if((x1==x2&&(a||b))||(y11==y2&&(c||d))) cout<<"No"<<endl;
       else if(xx>=x1&&xx<=x2&&yy>=y11&&yy<=y2) cout<<"Yes"<<endl;
       else cout<<"No"<<endl；
    }
    return 0;
}