Competitive_Programming/codeforces/1332/A.cpp at master · nishitsharma03/Competitive_Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
//#pragma GCC optimize "trapv"
#include<bits/stdc++.h>
#define ll long long
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;

int main()
{ quick;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
	int t;
	cin>>t;
	while(t--)
	{
		ll int a,b,c,d;
		cin>>a>>b>>c>>d;
		ll int x,y,x1,x2,y1,y2;
		string ans="YES";
		cin>>x>>y>>x1>>y1>>x2>>y2;
		if(x1==x2&&(a>0||b>0))
			ans="NO";
		if(y1==y2&&(c>0||d>0))
			ans="NO";

		if(x+b-x1<a)
		{
			ans="NO";
			cout<<ans<<endl;
			continue;
		}
		if((x2-(x-a))<b)
			ans="NO";
			if((y+d-y1<c))
				ans="NO";
			if((y2-(y-c)<d))
				ans="NO";
			cout<<ans<<endl;
	}


	return 0;
}