[HAOI2011]向量（裴蜀定理）

• 注释：本章同余针对$2$。
• 题面
• 题意：见题面。
• 解决思路：考虑前四个向量$(a,b),(a,-b),(-a,b),(-a,-b)$，设共取出$n$个向量，$a,-a,b,-b$的个数分别为$x_{a1},x_{a2},y_{b1},y_{b2}$。
  $\therefore \{\begin{array}{l}{x}_{a1}+x_{a2}=n\\ y_{b1}+y_{b2}=n\end{array}$
  $n$个向量之和为$(a{x}_{a1}-a{x}_{a2},b{y}_{b1}-b{y}_{b2})$
  设$x_1=x_{a1}-x_{a2}$，$y_1=y_{b1}-y_{b2}$，结论：$x_1\equiv y_1$
  证明
  $n\equiv p$，$p$的取值为$0$或$1$
  $\therefore \{\begin{array}{l}{x}_{a1}+x_{a2}\equiv p\\ y_{b1}+y_{b2}\equiv p\end{array}$
  $\therefore \{\begin{array}{l}{x}_{a1}+x_{a2}-2x_{a2}\equiv p\\ y_{b1}+y_{b2}-2y_{b2}\equiv p\end{array}$
  $\therefore \{\begin{array}{l}{x}_{a1}-x_{a2}\equiv p\\ y_{b1}-y_{b2}\equiv p\end{array}$
  $\therefore x_1\equiv y_1\equiv p$
  证毕
  结论：$n$个向量之和为$(a{x}_1,b{y}_1)$，$x_1\equiv y_1$
  同理考虑后四个向量$(b,a),(b,-a),(-b,a),(-b,-a)$，设共取出$m$个向量，设$m$个向量之和为$(b{y}_2,a{x}_2)$，且$y_2\equiv x_2$
  八个向量之和为$(a{x}_1+b{y}_2,b{y}_1+a{x}_2)$，$x_1\equiv y_1$，$y_2\equiv x_2$
  $\therefore \{\begin{array}{l}a{x}_1+b{y}_2=x{x}_1\equiv y_1\\ b{y}_1+a{x}_2=y{y}_2\equiv x_2\end{array}$
  $\therefore \{\begin{array}{l}a{x}_1+b{y}_2=x{x}_1\equiv y_1\\ a{x}_2+b{y}_1=y{y}_2\equiv x_2\end{array}$
  情况一：$x_1\equiv y_1\equiv 0$，$y_2\equiv x_2\equiv 0$
  $\therefore \{\begin{array}{l}a{x}_1+b{y}_2=x\\ a{x}_2+b{y}_1=y\end{array}$
  将同余$0$的项提出$2$
  $\therefore \{\begin{array}{l}2a{x}_1^{\prime }+2b{y}_2^{\prime }=x\\ 2a{x}_2^{\prime }+2b{y}_1^{\prime }=y\end{array}$
  有解的条件是$(2a,2b)\mid x$，$(2a,2b)\mid y$
  情况二：$x_1\equiv y_1\equiv 0$，$y_2\equiv x_2\equiv 1$
  $\therefore \{\begin{array}{l}a{x}_1+b{y}_2=x\\ a{x}_2+b{y}_1=y\end{array}$
  将同余$0$的项提出$2$
  $\therefore \{\begin{array}{l}2a{x}_1^{\prime }+b{y}_2=x\\ a{x}_2+2b{y}_1^{\prime }=y\end{array}$
  $\therefore \{\begin{array}{l}2a{x}_1^{\prime }+b(y_2+1)=x+b\\ a(x_2+1)+2b{y}_1^{\prime }=y+a\end{array}$
  $\therefore \{\begin{array}{l}2a{x}_1^{\prime }+2b{y}_2^{\prime }=x+b\\ 2a{x}_2^{\prime }+2b{y}_1^{\prime }=y+a\end{array}$
  有解的条件是$(2a,2b)\mid (x+b)$，$(2a,2b)\mid (y+a)$
  同理
  情况三：有解的条件是$(2a,2b)\mid (x+a)$，$(2a,2b)\mid (y+b)$
  情况四：有解的条件是$(2a,2b)\mid (x+a+b)$，$(2a,2b)\mid (y+a+b)$
• AC代码

//优化
#pragma GCC optimize(2)
//C
#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
//C++
//#include<unordered_map>
#include<algorithm>
#include<iostream>
#include<istream>
#include<iomanip>
#include<climits>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
//宏定义
#define N 1010
#define DoIdo main
//#define scanf scanf_s
#define it set<ll>::iterator
//定义+命名空间
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 998244353;
const ll INF = 1e18;
const int maxn = 1e6 + 10;
using namespace std;
//全局变量
//函数区
ll max(ll a, ll b) { return a > b ? a : b; }
ll min(ll a, ll b) { return a < b ? a : b; }
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
//主函数
int DoIdo() {
 
    ios::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
 
    int T;
    cin >> T;
 
    while (T--) {
        ll a, b, x, y;
        cin >> a >> b >> x >> y;
 
        ll g = gcd(2 * a, 2 * b);
        bool jg = 0;
        if (x % g == 0 && y % g == 0) jg = 1;
        if ((x + a) % g == 0 && (y + b) % g == 0) jg = 1;
        if ((x + b) % g == 0 && (y + a) % g == 0) jg = 1;
        if ((x + a + b) % g == 0 && (y + a + b) % g == 0) jg = 1;
        if (jg) cout << "Y" << endl;
        else cout << "N" << endl;
    }
    return 0;
}
//分割线---------------------------------QWQ
/*
 
 
 
*/