A. Integer Points

第二天叫醒我的不是闹钟，是梦想！

DLS and JLS are bored with a Math lesson. In order to entertain themselves, DLS took a sheet of paper and drew n distinct lines, given by equations y=x+pi for some distinct p1,p2,…,pn.

Then JLS drew on the same paper sheet m distinct lines given by equations y=−x+qi for some distinct q1,q2,…,qm.

DLS and JLS are interested in counting how many line pairs have integer intersection points, i.e. points with both coordinates that are integers. Unfortunately, the lesson will end up soon, so DLS and JLS are asking for your help.

Input
The first line contains one integer t (1≤t≤1000), the number of test cases in the input. Then follow the test case descriptions.

The first line of a test case contains an integer n (1≤n≤105), the number of lines drawn by DLS.

The second line of a test case contains n distinct integers pi (0≤pi≤109) describing the lines drawn by DLS. The integer pi describes a line given by the equation y=x+pi.

The third line of a test case contains an integer m (1≤m≤105), the number of lines drawn by JLS.

The fourth line of a test case contains m distinct integers qi (0≤qi≤109) describing the lines drawn by JLS. The integer qi describes a line given by the equation y=−x+qi.

The sum of the values of n over all test cases in the input does not exceed 105. Similarly, the sum of the values of m over all test cases in the input does not exceed 105.

In hacks it is allowed to use only one test case in the input, so t=1 should be satisfied.

Output
For each test case in the input print a single integer — the number of line pairs with integer intersection points.

Example
inputCopy
3
3
1 3 2
2
0 3
1
1
1
1
1
2
1
1
outputCopy
3
1
0
Note
The picture shows the lines from the first test case of the example. Black circles denote intersection points with integer coordinates.

//y=x+pi,y=-x+qi.例如:y=x+1,y=-x+3 那么2y=4 也就是说pi+qi必须是2的倍数才会相交。也就是偶数，我们可以预处理b数组有多少个奇数和多少个个数。根据奇数+奇数=偶，偶+偶=偶这个性质求解即可

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
int t;
int n,m;
int a[N],b[N],x;
int main()
{
    cin>>t;
    while(t--)
    {
      cin>>n;
      for(int i=1;i<=n;i++) cin>>a[i];
      int l=0,r=0;
      cin>>m;
      for(int i=1;i<=m;i++)
      {
        cin>>x;
        if(x%2==0) l++;
        else r++;
      }
      ll res=0;
      for(int i=1;i<=n;i++)
      {
        if(a[i]%2==0) res+=l;
        else res+=r;
      }
      cout<<res<<endl;
    }
}