代码一个神奇的问题

#include<bits/stdc++.h>
using namespace std;
const int N = 5e6 + 5;
int T, a[N], b[N];
int main() {
	cin >> T;
	while(T --) {
		int n, flag = 1;
        scanf("%d", &n);        
		for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
		for(int i = 1; i <= n; i ++) {
			scanf("%d", &b[i]);
			if((b[i] % 2) != (a[i] % 2)) {
				flag = 0;
				break;
			}
		}
		if(n == 1) {
			printf("Yes\n");
			continue;
		}
		if(flag) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 5e6 + 5;
int T, a[N], b[N];
signed main() {
	cin >> T;
	while(T --) {
		int n = 0, flag = 1;
        scanf("%lld", &n);    
		for(int i = 1; i <= n; i ++) scanf("%lld", &a[i]);
		for(int i = 1; i <= n; i ++) {
			scanf("%lld", &b[i]);
			int a1 = a[i] % 2, b1 = b[i] % 2;
			if(a1 == 0 && b1 == 1) flag = 0;
			if(a1 == 1 && b1 == 0) flag = 0;
		}
		if(n == 1) {
			printf("Yes\n");
			continue;
		}
		if(flag) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}