fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #pragma region Macros
  5. #define Faster ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  6. #define ll long long
  7. #define ld long double
  8. #define pii pair<int, int>
  9. #define pll pair<long long, long long>
  10. #define all(x) x.begin(), x.end()
  11. #define rall(x) x.rbegin(), x.rend()
  12. #define pb push_back
  13. #define ff first
  14. #define ss second
  15. #define endl '\n'
  16. #define yes cout << "YES" << endl
  17. #define no cout << "NO" << endl
  18. #define m1 cout << -1 << endl
  19. #pragma endregion
  20.  
  21. #pragma region Math
  22. const ll MOD = 1e9 + 7;
  23. ll gcd(ll a, ll b) { return __gcd(a, b); }
  24. ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
  25. #pragma endregion
  26.  
  27. void solve() {
  28. int w,h,a,b, x1,y1,x2,y2;
  29. cin>> w>>h>>a>>b>> x1>>y1>>x2>>y2;
  30. int flag=0, val=0;
  31. if((max(x1,x2)-(min(x1,x2)+a))%a==0 and x1!=x2){
  32. cout<<"YES"<<endl;
  33. return;
  34. }
  35. if((max(y1,y2)-(min(y1,y2)+b))%b==0 and y1!=y2){
  36. cout<<"YES"<<endl;
  37. return;
  38. }
  39. cout<<"NO"<<endl;
  40. }
  41.  
  42. int main() {
  43. Faster;
  44. int t = 1;
  45. cin >> t;
  46. while (t--) solve();
  47. return 0;
  48. }
Success #stdin #stdout 0s 5320KB
stdin
7
6 5 2 3
-1 -2 5 4
4 4 2 2
0 0 3 1
10 9 3 2
0 0 4 3
10 9 3 2
0 0 6 3
5 5 2 2
-1 -1 4 -1
5 5 2 2
-1 -1 2 3
7 8 2 4
0 0 0 5
stdout
YES
NO
NO
YES
NO
YES
NO