text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int a[501][501], b[501][501], c[501], r[501], n, m, to1 = 0, to0 = 0;
bool y = 1;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
a[i][j] ^= b[i][j];
c[j] ^= a[i][j];
r[i] ^= a[i][j];
}
}
for (int i = 0; i < n; i++) {
if (r[i]) {
y = 0;
}
}
for (int i = 0; i < m; i++) {
if (c[i]) {
y = 0;
}
}
if (y) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int a[maxn][maxn];
int n, m;
bool b = 1;
void exp() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) printf("%d ", a[i][j]);
printf("\n");
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
int x;
scanf("%d", &x);
a[i][j] ^= x;
}
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= m; j++) sum += a[i][j];
if (sum & 1) {
b = 0;
break;
}
}
for (int j = 1; j <= m; j++) {
int sum = 0;
for (int i = 1; i <= n; i++) sum += a[i][j];
if (sum & 1) {
b = 0;
break;
}
}
if (b)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, a[502][502], b[502][502];
int main() {
cin >> n >> m;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) cin >> a[i][j];
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) cin >> b[i][j];
for (i = 1; i < n; ++i)
for (j = 1; j < m; ++j)
if (a[i][j] != b[i][j]) {
a[i][j] ^= 1;
a[i][j + 1] ^= 1;
a[i + 1][j + 1] ^= 1;
a[i + 1][j] ^= 1;
}
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j)
if (a[i][j] != b[i][j]) {
cout << "No";
return 0;
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[505][505], b[505][505];
int c[2][505];
int main() {
int i, j;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) scanf("%d", &a[i][j]);
for (i = 0; i < n; i++)
for (j = 0; j < m; j++) {
scanf("%d", &b[i][j]);
if (b[i][j] != a[i][j]) {
c[0][i]++;
c[1][j]++;
}
}
int flag = 1;
for (i = 0; i < n; i++)
if (c[0][i] % 2) flag = 0;
for (j = 0; j < m; j++)
if (c[1][j] % 2) flag = 0;
if (flag)
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int pr[1000007];
bool isnotprime(long long x) {
if (x == 1) return 1;
if (x == 2) return 0;
if (x % 2 == 0) return 1;
return (pr[x / 64] & (1 << ((x >> 1) & 31)));
}
void sieve(long long n) {
for (long long i = 3; i * i <= n; i += 2) {
if (!isnotprime(i))
for (long long j = i * i, k = i << 1; j < n; j += k)
pr[j / 64] |= (1 << ((j >> 1) & 31));
}
}
long long fpow(long long x, long long y) {
x = x % 1000000007;
long long res = 1;
while (y) {
if (y & 1) res = res * x;
res %= 1000000007;
y = y >> 1;
x = x * x;
x %= 1000000007;
}
return res;
}
long long inv(long long a, long long m) {
long long c = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += c;
return x;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m;
cin >> n >> m;
long long a[n][m], b[n][m], hx[n], hy[m], c = 0;
;
memset(hx, 0, sizeof(hx));
memset(hy, 0, sizeof(hy));
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (long long i = 1; i < n; i++) {
for (long long j = 1; j < m; j++) {
if (a[i][j] != b[i][j]) {
hx[i]++;
hy[j]++;
c++;
hx[i] %= 2;
hy[j] %= 2;
c %= 2;
}
}
}
if ((c && a[0][0] == b[0][0]) || (!c && a[0][0] != b[0][0])) {
cout << "No";
return 0;
}
for (long long i = 1; i < n; i++) {
if ((hx[i] && a[i][0] == b[i][0]) || (!hx[i] && a[i][0] != b[i][0])) {
cout << "No";
return 0;
}
}
for (long long i = 1; i < m; i++) {
if ((hy[i] && a[0][i] == b[0][i]) || (!hy[i] && a[0][i] != b[0][i])) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 600;
int a[maxn][maxn];
int b[maxn][maxn];
int col[maxn];
int row[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> a[i][j];
}
memset(col, 0, sizeof(col));
memset(row, 0, sizeof(row));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
if (a[i][j] != b[i][j]) {
row[i]++;
col[j]++;
}
}
}
int flag = 0;
for (int i = 0; i < n; i++) {
if (row[i] & 1) flag = 1;
}
for (int i = 0; i < m; i++) {
if (col[i] & 1) flag = 1;
}
if (flag)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
int a[n][m], b[n][m];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> b[i][j];
}
}
bool exist = true;
for (int i = 0; i < n; ++i) {
int cnt1 = 0, cnt2 = 0;
for (int col = 0; col < m; ++col) {
cnt1 += (a[i][col] == 1) ? 1 : 0;
cnt2 += (b[i][col] == 1) ? 1 : 0;
}
if (cnt1 % 2 != cnt2 % 2) {
exist = false;
break;
}
}
for (int i = 0; i < m; ++i) {
int cnt1 = 0, cnt2 = 0;
for (int row = 0; row < n; ++row) {
cnt1 += (a[row][i] == 1) ? 1 : 0;
cnt2 += (b[row][i] == 1) ? 1 : 0;
}
if (cnt1 % 2 != cnt2 % 2) {
exist = false;
break;
}
}
if (exist)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 5;
const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7;
int a[555][555], b[555][555];
int evenA[555], evenB[555];
int evenC[555], evenD[555];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> a[i][j];
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> b[i][j];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) evenA[i] = (evenA[i] + a[i][j]) % 2;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) evenB[i] = (evenB[i] + b[i][j]) % 2;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) evenC[j] = (evenC[j] + a[i][j]) % 2;
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) evenD[j] = (evenD[j] + b[i][j]) % 2;
}
bool ok = true;
for (int i = 0; i < n; ++i)
if (evenA[i] != evenB[i]) ok = false;
for (int i = 0; i < m; ++i)
if (evenC[i] != evenD[i]) ok = false;
if (ok)
cout << "Yes";
else
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long power(long long x, long long n) {
long long res = 1;
while (n) {
if (n & 1) {
res = (res * x);
}
n >>= 1;
if (n != 0) {
x = (x * x);
}
}
return res;
}
long long powerMOD(long long x, long long n) {
long long res = 1;
while (n) {
if (n & 1) {
res = (res * x) % MOD;
}
n >>= 1;
x = (x * x) % MOD;
}
return res;
}
bool mycompare(pair<long long, long long> &a, pair<long long, long long> &b) {
if (a.first == b.first) {
return a.second < b.second;
}
return a.first > b.first;
}
bool mycompare1(pair<int, int> &a, pair<int, int> &b) {
return a.second < b.second;
}
void match(string s, int lps[], int n) {
int i, len = 0;
i = 1;
while (i < n) {
if (s[len] == s[i]) {
len++;
lps[i] = len;
i++;
} else {
if (len != 0)
len = lps[len - 1];
else
i++;
}
}
}
void solve() {
int i, j, k, n, m, x, l, p1, p2;
cin >> n >> m;
int a[n][m], b[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> b[i][j];
}
p1 = 1;
for (int i = 0; i < n; i++) {
x = 0;
for (int j = 0; j < m; j++) {
x ^= a[i][j];
x ^= b[i][j];
}
if (x) p1 = 0;
}
for (int j = 0; j < m; j++) {
x = 0;
for (int i = 0; i < n; i++) {
x ^= a[i][j];
x ^= b[i][j];
}
if (x) p1 = 0;
}
if (p1)
cout << "YES";
else
cout << "NO";
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
int t = 1, i;
for (int i = 0; i < t; i++) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long tces = 1;
while (tces--) {
long long n, m;
cin >> n >> m;
long long a[n][m], b[n][m];
long long row[n], col[m];
for (long long i = 0; i < (n); i++) {
for (long long j = 0; j < (m); j++) {
cin >> a[i][j];
row[i] = 0;
col[j] = 0;
}
}
for (long long i = 0; i < (n); i++) {
for (long long j = 0; j < (m); j++) {
cin >> b[i][j];
}
}
for (long long i = 0; i < (n); i++) {
for (long long j = 0; j < (m); j++) {
row[i] += a[i][j] + b[i][j];
}
}
for (long long j = 0; j < (m); j++) {
for (long long i = 0; i < (n); i++) {
col[j] += a[i][j] + b[i][j];
}
}
for (long long i = 0; i < (n); i++) {
if (row[i] % 2) {
cout << "NO";
exit(0);
}
}
for (long long i = 0; i < (m); i++) {
if (col[i] % 2) {
cout << "NO";
exit(0);
}
}
cout << "YES";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
long long i, j;
long long a[n][m], b[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) {
long long i1, j1;
i1 = i + 1;
while (i1 < n && a[i1][j] == b[i1][j]) {
i1++;
}
j1 = j + 1;
while (j1 < m && a[i][j1] == b[i][j1]) {
j1++;
}
if (i1 >= n || j1 >= m) {
cout << "No" << '\n';
return 0;
}
a[i][j] = 1 - a[i][j];
a[i][j1] = 1 - a[i][j1];
a[i1][j1] = 1 - a[i1][j1];
a[i1][j] = 1 - a[i1][j];
}
}
}
cout << "Yes" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, flag = 1;
cin >> n >> m;
int a[n][m], b[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < m - 1; j++) {
if (a[i][j] != 0) {
a[i][j] = !a[i][j];
a[i][j + 1] = !a[i][j + 1];
a[i + 1][j] = !a[i + 1][j];
a[i + 1][j + 1] = !a[i + 1][j + 1];
}
if (b[i][j] != 0) {
b[i][j] = !b[i][j];
b[i][j + 1] = !b[i][j + 1];
b[i + 1][j] = !b[i + 1][j];
b[i + 1][j + 1] = !b[i + 1][j + 1];
}
}
}
for (int i = 0; i < n; i++) {
if (a[i][m - 1] != b[i][m - 1]) {
flag = 0;
}
}
for (int i = 0; i < m; i++) {
if (a[n - 1][i] != b[n - 1][i]) {
flag = 0;
}
}
if (flag == 1) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[505][505], b[505][505];
vector<long long> v1, v2;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) cin >> a[i][j];
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) cin >> b[i][j];
for (long long i = 0; i < m; i++) {
long long temp = 0;
for (long long j = 0; j < n; j++)
if (a[j][i] != b[j][i]) temp++;
v1.push_back(temp);
}
for (long long i = 0; i < v1.size(); i++)
if (v1[i] % 2 == 1) {
cout << "No";
return 0;
}
long long temp = 0;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) temp++;
for (long long i = 0; i < n; i++) {
long long temp = 0;
for (long long j = 0; j < m; j++)
if (a[i][j] != b[i][j]) temp++;
v2.push_back(temp);
}
for (long long i = 0; i < v2.size(); i++)
if (v2[i] % 2 == 1) {
cout << "No";
return 0;
}
temp = 0;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) temp++;
if (temp >= 0) cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[666], b[666], c[666], d[666];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
a[i] ^= x;
b[j] ^= x;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
cin >> x;
c[i] ^= x;
d[j] ^= x;
}
}
int f = 1;
for (int i = 1; i <= n; i++) f &= (a[i] == c[i]);
for (int i = 1; i <= m; i++) f &= (d[i] == b[i]);
cout << (f ? "Yes" : "No");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 1;
bool comp(pair<long long int, long long int> &a,
pair<long long int, long long int> &b) {
return a.second < b.second;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, m;
cin >> n >> m;
long long int a[n][m], b[n][m];
for (long long int i = 0; i < n; ++i)
for (long long int j = 0; j < m; ++j) cin >> a[i][j];
for (long long int i = 0; i < n; ++i)
for (long long int j = 0; j < m; ++j) cin >> b[i][j];
vector<pair<long long int, long long int>> parity;
for (long long int i = 0; i < n; ++i)
for (long long int j = 0; j < m; ++j)
if (a[i][j] == 0 and b[i][j] == 1)
parity.push_back({i, j});
else if (a[i][j] == 1 and b[i][j] == 0)
parity.push_back({i, j});
map<long long int, long long int> row, col;
for (auto i : parity) row[i.first]++, col[i.second]++;
bool flag = 0;
for (auto i : row)
if (i.second % 2 == 0)
continue;
else
flag = 1;
for (auto i : col)
if (i.second % 2 == 0)
continue;
else
flag = 1;
if (flag)
cout << "No";
else
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 510;
const int inf = 0x7fffffff;
int a[N][N], b[N][N];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &b[i][j]);
for (int i = 1; i <= n; i++) {
int sum1 = 0, sum2 = 0;
for (int j = 1; j <= m; j++) sum1 ^= a[i][j], sum2 ^= b[i][j];
if (sum1 != sum2) {
puts("No");
return 0;
}
}
for (int i = 1; i <= m; i++) {
int sum1 = 0, sum2 = 0;
for (int j = 1; j <= n; j++) sum1 ^= a[j][i], sum2 ^= b[j][i];
if (sum1 != sum2) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long const maxn = 5e2 + 2;
long long matr[maxn][maxn], test[maxn][maxn];
inline void input() {
cin >> n >> m;
long long temp;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> matr[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> test[i][j];
}
}
}
inline void solve() {
long long count;
for (long long i = 0; i < n; i++) {
count = 0;
for (long long j = 0; j < m; j++) {
if (matr[i][j] != test[i][j]) {
count++;
}
}
if (count % 2 == 1) {
cout << "No";
return;
}
}
for (long long j = 0; j < m; j++) {
count = 0;
for (long long i = 0; i < n; i++) {
if (matr[i][j] != test[i][j]) {
count++;
}
}
if (count % 2 == 1) {
cout << "No";
return;
}
}
cout << "Yes";
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void read(T &x) {
x = 0;
char c = getchar();
while (c < '0' || c > '9') {
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + c - 48;
c = getchar();
}
}
template <class T>
void write(T x) {
if (x < 10) {
putchar('0' + x);
return;
} else {
write(x / 10);
write(x % 10);
}
}
template <class T>
void writeln(T x) {
write(x);
putchar('\n');
}
const int N = 505;
int n, m;
int a[N][N], b[N][N];
void init() {
read(n);
read(m);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
read(a[i][j]);
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
read(b[i][j]);
}
}
}
void solve() {
for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (a[i][j] != b[i][j]) {
a[i][j] ^= 1;
a[i][j + 1] ^= 1;
a[i + 1][j] ^= 1;
a[i + 1][j + 1] ^= 1;
}
}
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
if (a[i][j] != b[i][j]) {
puts("No");
return;
}
}
}
puts("Yes");
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, x;
int a[1010][1010];
int c[1010], r[1010];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) cin >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
cin >> x;
if (x != a[i][j]) r[i]++, c[j]++;
}
int flag = 1;
for (int i = 1; i <= n; i++)
if (r[i] % 2) flag = 0;
for (int j = 1; j <= m; j++)
if (c[j] % 2) flag = 0;
if (flag)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
const int N = 505;
int a[N][N], b[N][N], n, m, i, j;
bool fl;
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) scanf("%d", a[i] + j);
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) scanf("%d", b[i] + j);
for (i = 1; i < n; ++i)
for (j = 1; j < m; ++j)
if (a[i][j] != b[i][j])
a[i][j] ^= 1, a[i + 1][j] ^= 1, a[i][j + 1] ^= 1, a[i + 1][j + 1] ^= 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j) fl = fl || a[i][j] != b[i][j];
puts(fl ? "No" : "Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[505][505];
int b[505][505];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) sum++;
}
if (sum % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
if (a[j][i] != b[j][i]) sum++;
}
if (sum % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, c1, c2, ans = 1;
cin >> n >> m;
int a[n + 1][m + 1], b[n + 1][m + 1];
for (i = 1; i <= n; ++i) {
for (j = 1; j <= m; ++j) cin >> a[i][j];
}
for (i = 1; i <= n; ++i) {
for (j = 1; j <= m; ++j) cin >> b[i][j];
}
for (i = 1; i <= n; ++i) {
c1 = 0;
c2 = 0;
for (j = 1; j <= m; ++j) {
if (a[i][j]) ++c1;
if (b[i][j]) ++c2;
}
if (((c1 - c2) % 2)) ans = 0;
}
for (i = 1; i <= m; ++i) {
c1 = 0;
c2 = 0;
for (j = 1; j <= n; ++j) {
if (a[j][i]) ++c1;
if (b[j][i]) ++c2;
}
if (((c1 - c2) % 2)) ans = 0;
}
if (ans)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[510][510], aa[510][510];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &aa[i][j]);
for (int i = 1; i < n; i++)
for (int j = 1; j < m; j++)
if (a[i][j] != aa[i][j]) {
a[i][j] ^= 1;
a[n][m] ^= 1;
a[i][m] ^= 1;
a[n][j] ^= 1;
}
bool fla = false;
for (int i = 1; i <= n; i++)
if (a[i][m] != aa[i][m]) {
fla = true;
break;
}
for (int i = 1; i <= m; i++)
if (a[n][i] != aa[n][i]) {
fla = true;
break;
}
if (!fla)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 555;
int a[maxn][maxn], b[maxn][maxn];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) scanf("%d", &a[i][j]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) scanf("%d", &b[i][j]);
}
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) cnt++;
}
if (cnt & 1) {
puts("No");
return 0;
}
}
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if (a[j][i] != b[j][i]) cnt++;
}
if (cnt & 1) {
puts("No");
return 0;
}
}
printf("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct node {
node *left, *right;
node *above, *under;
int i, j;
node() {
i = -1;
j = -1;
left = right = above = under = nullptr;
}
};
vector<vector<int>> a;
vector<vector<bool>> flag;
vector<node> rows;
vector<node> columns;
void Insert(int i, int j) {
node* newNode = new node;
newNode->i = i;
newNode->j = j;
node* p = &rows[i];
bool inserted = false;
while (nullptr != p->right) {
p = p->right;
if (p->j > j) {
p->left->right = newNode;
newNode->left = p->left;
p->left = newNode;
newNode->right = p;
inserted = true;
break;
}
}
if (!inserted) {
p->right = newNode;
newNode->left = p;
}
p = &columns[j];
inserted = false;
while (nullptr != p->under) {
p = p->under;
if (p->i > i) {
p->above->under = newNode;
newNode->above = p->above;
p->above = newNode;
newNode->under = p;
inserted = true;
break;
}
}
if (!inserted) {
p->under = newNode;
newNode->above = p;
}
}
void Delete(node* p) {
if (nullptr != p->right) {
p->right->left = p->left;
}
p->left->right = p->right;
if (nullptr != p->under) {
p->under->above = p->above;
}
p->above->under = p->under;
delete p;
}
void Delete(int i, int j) {
node* p = &rows[i];
node* result = nullptr;
while (nullptr != p->right) {
p = p->right;
if (p->j == j) {
result = p;
if (nullptr != p->right) {
p->right->left = p->left;
}
p->left->right = p->right;
if (nullptr != p->under) {
p->under->above = p->above;
}
p->above->under = p->under;
break;
}
}
if (nullptr != result) delete result;
}
int main() {
int n, m;
cin >> n >> m;
a.resize(n, vector<int>(m));
flag.resize(n, vector<bool>(m));
rows.resize(n);
columns.resize(m);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
int tmp;
cin >> tmp;
a[i][j] = tmp;
}
}
int num = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
int tmp;
cin >> tmp;
if (a[i][j] != tmp) {
flag[i][j] = true;
num++;
Insert(i, j);
} else
flag[i][j] = false;
}
}
if (num % 2 == 1)
cout << "NO" << endl;
else {
int ok = true;
for (int i = 0; i < n; ++i) {
if (nullptr == rows[i].right) continue;
node* p = rows[i].right;
while (nullptr != p) {
int rowNum = 0;
node *n1 = nullptr, *n2 = nullptr, *n3 = nullptr;
int i4 = -1, j4 = -1;
while (nullptr != p) {
if (0 == rowNum) {
n1 = p;
if (nullptr == n3) {
if (nullptr != p->under) {
n3 = p->under;
}
}
rowNum++;
} else if (1 == rowNum) {
if (nullptr != n3) {
n2 = p;
i4 = n3->i;
j4 = p->j;
break;
} else {
if (nullptr != p->under) {
n2 = p;
n3 = p->under;
i4 = n3->i;
j4 = n1->j;
break;
}
}
}
p = p->right;
}
if (!(nullptr != n1 && nullptr != n2 && nullptr != n3)) {
cout << "NO" << endl;
return 0;
}
p = p->right;
flag[n1->i][n1->j] = false;
flag[n2->i][n2->j] = false;
flag[n3->i][n3->j] = false;
Delete(n1);
Delete(n2);
Delete(n3);
num -= 3;
if (flag[i4][j4]) {
flag[i4][j4] = false;
Delete(i4, j4);
num--;
} else {
flag[i4][j4] = true;
Insert(i4, j4);
num++;
}
if (0 == num) {
cout << "YES" << endl;
return 0;
}
}
}
cout << "YES" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 512;
int a[maxn][maxn], b[maxn][maxn];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (m); (j)++) scanf("%d", &a[i][j]);
for (int(i) = (1); (i) <= (n); (i)++)
for (int(j) = (1); (j) <= (m); (j)++) scanf("%d", &b[i][j]);
for (int(i) = (1); (i) <= (n); (i)++) {
int cnt = 0;
for (int(j) = (1); (j) <= (m); (j)++) cnt += a[i][j];
for (int(j) = (1); (j) <= (m); (j)++) cnt -= b[i][j];
if (cnt & 1) {
puts("No");
return 0;
}
}
for (int(j) = (1); (j) <= (m); (j)++) {
int cnt = 0;
for (int(i) = (1); (i) <= (n); (i)++) cnt += a[i][j];
for (int(i) = (1); (i) <= (n); (i)++) cnt += b[i][j];
if (cnt & 1) {
puts("No");
return 0;
}
}
puts("Yes");
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 577, INF = 1e9, mod = 1e9 + 7;
int n, m;
long long h;
int a[N][N], b[N][N];
int ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &b[i][j]);
if (b[i][j] != a[i][j]) {
b[1][1] = !b[1][1];
b[i][1] = !b[i][1];
b[1][j] = !b[1][j];
b[i][j] = !b[i][j];
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (b[i][j] != a[i][j]) {
printf("No\n");
return 0;
}
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
const int N = 550;
const long long mod = 1e9 + 7;
using namespace std;
int n;
int m;
int a[N][N];
int b[N][N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> b[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i + 1 <= n && j + 1 <= m) {
if (a[i][j]) {
a[i][j] ^= 1;
a[i + 1][j] ^= 1;
a[i][j + 1] ^= 1;
a[i + 1][j + 1] ^= 1;
}
if (b[i][j]) {
b[i][j] ^= 1;
b[i + 1][j] ^= 1;
b[i][j + 1] ^= 1;
b[i + 1][j + 1] ^= 1;
}
}
if (a[i][j] != b[i][j]) {
cout << "No"
<< "\n";
return 0;
}
}
}
cout << "Yes"
<< "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
inline void Max(int &a, int b) {
if (b > a) a = b;
}
inline void Min(int &a, int b) {
if (b < a) a = b;
}
const int N = (int)505;
int n, m;
int A[N][N], B[N][N];
int diff_row(int i) {
int res = 0;
for (int j = (0), _t = (m); j < _t; ++j) res += A[i][j] != B[i][j];
return res;
}
int diff_col(int j) {
int res = 0;
for (int i = (0), _t = (n); i < _t; ++i) res += A[i][j] != B[i][j];
return res;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = (0), _t = (n); i < _t; ++i)
for (int j = (0), _t = (m); j < _t; ++j) cin >> A[i][j];
for (int i = (0), _t = (n); i < _t; ++i)
for (int j = (0), _t = (m); j < _t; ++j) cin >> B[i][j];
for (int i = (0), _t = (n); i < _t; ++i)
if (diff_row(i) & 1) {
cout << "No\n";
return 0;
}
for (int i = (0), _t = (m); i < _t; ++i)
if (diff_col(i) & 1) {
cout << "No\n";
return 0;
}
cout << "Yes\n";
return 0;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3010;
const long long Mod = 998244353;
int a[505][505];
int b[505][505];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n, m;
cin >> n >> m;
int q1 = 0, q2 = 0, w1 = 0, w2 = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int f = 0;
for (int i = 1; i <= n; i++) {
q1 = 0;
q2 = 0;
for (int j = 1; j <= m; j++) {
cin >> b[i][j];
if (b[i][j]) q2++;
if (a[i][j]) q1++;
}
if ((q1 - q2) % 2 != 0) {
f = 1;
break;
}
}
for (int i = 1; i <= m; i++) {
q1 = 0;
q2 = 0;
for (int j = 1; j <= n; j++) {
if (b[j][i]) q2++;
if (a[j][i]) q1++;
}
if ((q1 - q2) % 2 != 0) {
f = 1;
break;
}
}
if (f == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
long long n, m;
cin >> n >> m;
vector<vector<long long>> mp1(n, vector<long long>(m));
vector<vector<long long>> mp2(n, vector<long long>(m));
map<long long, long long> row;
map<long long, long long> col;
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
cin >> mp1[i][j];
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
cin >> mp2[i][j];
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
if (mp1[i][j] != mp2[i][j]) {
row[i]++;
col[j]++;
}
}
}
bool flag = true;
for (auto cur : row) {
flag &= cur.second % 2 == 0;
}
for (auto cur : col) {
flag &= cur.second % 2 == 0;
}
if (flag) {
cout << "Yes\n";
} else {
cout << "No\n";
}
return 0;
}
|
#include <bits/stdc++.h>
const int mod = (int)1000000007;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
vector<vector<int>> b(n, vector<int>(m));
bool ok = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) cin >> b[i][j];
}
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) cnt++;
}
if (cnt % 2) ok = 0;
}
for (int i = 0; i < m; i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if (a[j][i] != b[j][i]) cnt++;
}
if (cnt % 2) ok = 0;
}
if (ok)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
return 0;
}
|
#include <bits/stdc++.h>
const int mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using namespace std;
template <class myType>
void p(vector<myType>& v) {
for (myType i : v) cout << i << " ";
cout << endl;
}
template <class myType>
void pv(vector<vector<myType>>& vv) {
for (auto& v : vv) p(v);
}
template <class myType>
void GetInputV(vector<myType>& v, int n) {
v.resize(n);
for (myType& i : v) cin >> i;
}
template <class myType>
void GetInputVV(vector<vector<myType>>& vv, int m, int n) {
vv.resize(m);
for (vector<myType>& v : vv) GetInputV(v, n);
}
void same(vector<vector<int>>& A, vector<vector<int>>& B) {
for (int i = 0; i < A.size(); i++) {
for (int j = 0; j < A[0].size(); j++) {
if (A[i][j] != B[i][j]) {
cout << "No" << endl;
return;
}
}
}
cout << "Yes" << endl;
}
void flip(vector<vector<int>>& A, int i, int j) {
A[i][j] = !A[i][j];
A[i + 1][j] = !A[i + 1][j];
A[i][j + 1] = !A[i][j + 1];
A[i + 1][j + 1] = !A[i + 1][j + 1];
}
int main() {
int m, n;
cin >> m >> n;
vector<vector<int>> A, B;
GetInputVV(A, m, n);
GetInputVV(B, m, n);
for (int i = 0; i < m - 1; i++) {
for (int j = 0; j < n - 1; j++) {
if (A[i][j] != B[i][j]) {
flip(A, i, j);
}
}
}
same(A, B);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool sortinrev(long long x, long long y) { return x > y; }
void swap(long long* a, long long* b) {
long long temp = *a;
*a = *b;
*b = temp;
}
long long div_ceil(long long a, long long b) { return (a + b - 1) / b; }
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
const int MOD = 1000 * 1000 * 1000 + 7;
const long long INF = 1e18L + 5;
long long fpow(long long a, long long b) {
if (b == 0) return 1;
if (b % 2 == 1) {
return fpow(a, b - 1) * a % MOD;
} else {
long long b2 = fpow(a, b / 2) % MOD;
return b2 * b2 % MOD;
}
}
const int nax = 200005;
const int N = int(1e5) + 5;
void solve() {
long long n, m;
cin >> n >> m;
vector<vector<long long>> matA(n + 1, vector<long long>(m + 1));
vector<vector<long long>> matB(n + 1, vector<long long>(m + 1));
long long sum1 = 0, sum2 = 0;
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
cin >> matA[i][j];
sum1 += 0;
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
cin >> matB[i][j];
sum2 += 0;
}
}
if (sum1 % 2 != sum2 % 2) {
cout << "NO\n";
return;
}
bool flag = 1;
long long cnt1 = 0, cnt2 = 0;
for (long long i = 0; i < n; ++i) {
long long cnt11 = 0, cnt12 = 0;
for (long long j = 0; j < m; ++j) {
cnt11 += matA[i][j];
cnt12 += matB[i][j];
}
if (cnt11 % 2 != cnt12 % 2) {
flag = 0;
break;
}
}
for (long long j = 0; j < m; ++j) {
long long cnt21 = 0, cnt22 = 0;
for (long long i = 0; i < n; ++i) {
cnt21 += matA[i][j];
cnt22 += matB[i][j];
}
if (cnt21 % 2 != cnt22 % 2) {
flag = 0;
break;
}
}
if (flag)
cout << "YES\n";
else
cout << "NO\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
long long T = 1;
while (t--) {
cerr << "TEST-CASE #" << T << "\n";
solve();
T++;
cerr << "\n";
}
cerr << "\nI am Winning";
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int mp1[505][505], mp2[505][505];
int e1 = 0, o1 = 0, e2 = 0, o2 = 0;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> mp1[i][j];
if (mp1[i][j] == 1) {
if ((i + j) % 2 == 0)
e1++;
else
o1++;
}
}
}
int cnt = 0, falg = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> mp2[i][j];
if (mp2[i][j] != mp1[i][j]) cnt++;
}
if (cnt % 2 == 1) falg = 1;
cnt = 0;
}
for (int j = 1; j <= m; j++) {
for (int i = 1; i <= n; i++) {
if (mp2[i][j] != mp1[i][j]) cnt++;
}
if (cnt % 2 == 1) falg = 1;
cnt = 0;
}
if (!falg) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[505][505], b[505][505];
void load() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &b[i][j]);
a[i][j] ^= b[i][j];
}
}
}
void solve() {
for (int i = 0; i < n; i++) {
int s = 0;
for (int j = 0; j < m; j++) {
s += a[i][j];
}
if (s % 2 == 1) {
cout << "No\n";
return;
}
}
for (int j = 0; j < m; j++) {
int s = 0;
for (int i = 0; i < n; i++) {
s += a[i][j];
}
if (s % 2 == 1) {
cout << "No\n";
return;
}
}
cout << "Yes\n";
}
int main() {
load();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int m, n;
cin >> m >> n;
int A[m][n];
int B[m][n];
int ans[m][n];
int column[m];
int row[n];
for (long long int i = 0; i <= m - 1; i++) {
for (long long int j = 0; j <= n - 1; j++) cin >> A[i][j];
}
for (long long int i = 0; i <= m - 1; i++) {
for (long long int j = 0; j <= n - 1; j++) cin >> B[i][j];
}
for (long long int i = 0; i <= m - 1; i++) {
for (long long int j = 0; j <= n - 1; j++) {
if (A[i][j] == B[i][j])
ans[i][j] = 0;
else
ans[i][j] = 1;
}
}
for (long long int i = 0; i <= m - 1; i++) {
int temp = 0;
for (long long int j = 0; j <= n - 1; j++) temp += ans[i][j];
column[i] = temp;
}
for (long long int j = 0; j <= n - 1; j++) {
int temp = 0;
for (long long int i = 0; i <= m - 1; i++) temp += ans[i][j];
row[j] = temp;
}
int mis = 0;
for (long long int i = 0; i <= m - 1; i++) mis += column[i];
if (mis % 2 != 0) {
cout << "No";
return 0;
} else {
int flag = 0;
for (long long int i = 0; i <= m - 1; i++) {
if (column[i] % 2 != 0) {
cout << "No";
return 0;
}
}
for (long long int i = 0; i <= n - 1; i++) {
if (row[i] % 2 != 0) {
cout << "No";
return 0;
}
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.14159265358979323846264338327950288419716939937510582097494459230781641;
const long long int M = 1e18;
const long long int MAXN = 100200;
void solve() {
long long int n, m;
cin >> n >> m;
vector<vector<long long int> > a(n, vector<long long int>(m)),
b(n, vector<long long int>(m));
vector<long long int> x(n), y(n), r(m), s(m);
for (long long int i = 0; i < n; i++) {
long long int sum = 0;
for (long long int j = 0; j < m; j++) {
cin >> a[i][j];
sum += a[i][j];
}
sum %= 2;
x[i] = sum;
}
for (long long int i = 0; i < n; i++) {
long long int sum = 0;
for (long long int j = 0; j < m; j++) {
cin >> b[i][j];
sum += b[i][j];
}
sum %= 2;
y[i] = sum;
}
for (long long int i = 0; i < m; i++) {
long long int sum = 0;
for (long long int j = 0; j < n; j++) {
sum += a[j][i];
}
sum %= 2;
r[i] = sum;
}
for (long long int i = 0; i < m; i++) {
long long int sum = 0;
for (long long int j = 0; j < n; j++) {
sum += b[j][i];
}
sum %= 2;
s[i] = sum;
}
if (x != y || r != s) {
cout << "No";
} else {
cout << "Yes";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long int test = 1;
for (long long int t = 1; t < test + 1; t++) {
solve();
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int wannabe[n][m];
int aim[n][m];
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> wannabe[i][j];
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> aim[i][j];
int XOR = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
XOR = XOR ^ (wannabe[i][j] ^ aim[i][j]);
}
if (XOR == 1) {
cout << "No";
exit(0);
}
}
XOR = 0;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
XOR = XOR ^ (wannabe[j][i] ^ aim[j][i]);
}
if (XOR == 1) {
cout << "No";
exit(0);
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n][m];
int b[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> b[i][j];
int ic[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) ic[i][j] = (int)(a[i][j] != b[i][j]);
bool ans = true;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) cnt += (ic[i][j] == 1);
if (cnt & 1) ans = false;
}
for (int j = 0; j < m; j++) {
int cnt = 0;
for (int i = 0; i < n; i++) {
cnt += (ic[i][j] == 1);
}
if (cnt & 1) ans = false;
}
cout << ((ans) ? "Yes" : "No") << (char)0x0A;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long a[555][555];
long long b[555][555];
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= m; j++) {
cin >> b[i][j];
}
}
for (long long i = 1; i < n; i++) {
for (long long j = 1; j <= m; j++) {
if (a[i][j] != b[i][j]) {
for (long long k = j + 1; k <= m; k++) {
if (a[i][k] != b[i][k]) {
a[i][j] ^= 1, a[i][k] ^= 1;
a[i + 1][j] ^= 1, a[i + 1][k] ^= 1;
j = k;
break;
}
}
}
}
}
bool bad = 0;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= m; j++) {
if (a[i][j] != b[i][j]) {
bad = 1;
}
}
}
cout << (bad ? "No" : "Yes") << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
int a[maxn][maxn], b[maxn][maxn], n, m;
int ra[maxn], ca[maxn], rb[maxn], cb[maxn];
int main() {
cin >> n >> m;
memset(ra, 0, sizeof(ra));
memset(ca, 0, sizeof(ca));
memset(rb, 0, sizeof(rb));
memset(cb, 0, sizeof(cb));
int flag = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
if (a[i][j] == 1) ra[i]++;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (a[j][i] == 1) ca[i]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
if (b[i][j] == 1) rb[i]++;
}
if (ra[i] % 2 != rb[i] % 2) {
flag = 0;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (b[j][i] == 1) cb[i]++;
}
if (ca[i] % 2 != cb[i] % 2) {
flag = 0;
}
}
if (flag)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 555;
int n, m;
int a[N][N];
int main() {
scanf("%d%d", &n, &m);
for (int k = 0; k < 2; k++)
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int x;
scanf("%d", &x);
a[i][j] ^= x;
}
for (int i = 1; i < n; i++)
for (int j = 1; j < m; j++) {
if (a[i][j]) {
a[0][0] ^= 1;
a[i][0] ^= 1;
a[0][j] ^= 1;
a[i][j] ^= 1;
}
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
if (a[i][j]) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 5e2 + 10;
long long n, m, ar[N][N], mat[N][N];
long long dx[4] = {0, 0, -1, -1};
long long dy[4] = {0, -1, 0, -1};
bool is_val(long long x, long long y) {
return x >= 0 && x < n && y >= 0 && y < m;
}
void change(long long x, long long y) {
for (long long i = 0; i < 4; i++) {
long long nx = x + dx[i], ny = y + dy[i];
if (is_val(nx, ny)) ar[nx][ny] ^= 1;
}
}
int32_t main() {
cin >> n >> m;
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) cin >> ar[i][j];
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++) cin >> mat[i][j];
if (n == 1) {
for (long long j = 0; j < m; j++)
if (ar[0][j] != mat[0][j]) return cout << "No", 0;
return cout << "Yes", 0;
}
if (m == 1) {
for (long long i = 0; i < n; i++)
if (ar[i][0] != mat[i][0]) return cout << "No", 0;
return cout << "Yes", 0;
}
for (long long sum = n + m - 2; sum >= 0; sum--)
for (long long i = 0; i < n; i++) {
long long j = sum - i;
if (is_val(i, j) && min(i, j)) {
if (ar[i][j] != mat[i][j]) change(i, j);
}
}
for (long long i = 0; i < n; i++)
for (long long j = 0; j < m; j++)
if (ar[i][j] != mat[i][j]) return cout << "No", 0;
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using ll = long long;
const int N = 500;
bool a[N][N], b[N][N];
int col[N], row[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = int(0); i < int(n); i++)
for (int j = int(0); j < int(m); j++) cin >> a[i][j];
for (int i = int(0); i < int(n); i++)
for (int j = int(0); j < int(m); j++) cin >> b[i][j];
for (int i = int(0); i < int(n); i++)
for (int j = int(0); j < int(m); j++) {
int c = a[i][j] ^ b[i][j];
row[i] += c;
col[j] += c;
}
bool can = true;
for (int i = int(0); i < int(n); i++) can &= row[i] % 2 == 0;
for (int j = int(0); j < int(m); j++) can &= col[j] % 2 == 0;
cout << (can ? "Yes" : "No") << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = int_fast64_t;
using ulli = uint_fast64_t;
template <typename T>
T ncr(T left, T right) {
right = min(left - right, right);
T ans = 1;
for (T i = 1; i <= right; i++) {
ans = ans * (left - right + i) / i;
}
return ans;
}
const lli MOD = 1000000007;
const lli LIMIT = 10000000000000000 * 5;
const int tenfive = 100000;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(N, vector<int>(M));
vector<vector<int>> B(N, vector<int>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
vector<vector<int>> need = A;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> B[i][j];
need[i][j] ^= B[i][j];
}
}
bool needwide = false;
int save = -1;
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (need[i][j]) {
if (needwide) {
if (i == N - 1) {
cout << "No" << endl;
return 0;
}
need[i][save] ^= 1;
need[i + 1][save] ^= 1;
need[i][j] ^= 1;
need[i + 1][j] ^= 1;
} else {
save = j;
}
needwide = !needwide;
}
}
if (needwide) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5E2 + 5;
bool A[maxn][maxn], B[maxn][maxn], C[maxn][maxn];
int main() {
int n, m;
while (cin >> n >> m) {
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> A[i][j];
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> B[i][j];
bool flag = 1;
for (int i = 0; i < n; ++i) {
int ans = 0;
for (int j = 0; j < m; ++j) {
C[i][j] = A[i][j] ^ B[i][j];
ans += C[i][j];
}
if (ans & 1) flag = 0;
cout << endl;
}
for (int j = 0; j < m; ++j) {
int ans = 0;
for (int i = 0; i < n; ++i) ans += C[i][j];
if (ans & 1) flag = 0;
}
if (flag)
cout << "Yes";
else
cout << "No";
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[505][505], b[505][505], c[505][505];
int n, m;
bool check() {
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = 1; j <= m; j++) sum += c[i][j];
if (sum % 2 == 1) return 0;
}
for (int i = 1; i <= m; i++) {
int sum = 0;
for (int j = 1; j <= n; j++) sum += c[j][i];
if (sum % 2 == 1) return 0;
}
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &b[i][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] == b[i][j])
c[i][j] = 0;
else
c[i][j] = 1;
}
}
if (check())
cout << "Yes\n";
else
cout << "No\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M;
int A[505][505], B[505][505];
int ro[505], co[505];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
for (int i = 0; i <= N - 1; i++)
for (int j = 0; j <= M - 1; j++) cin >> A[i][j];
for (int i = 0; i <= N - 1; i++)
for (int j = 0; j <= M - 1; j++) cin >> B[i][j];
for (int i = 0; i <= N - 1; i++)
for (int j = 0; j <= M - 1; j++) {
ro[i] += (A[i][j] != B[i][j]);
co[j] += (A[i][j] != B[i][j]);
}
bool first = 0;
for (int i = 0; i <= N - 1; i++)
if (ro[i] % 2) first = 1;
for (int i = 0; i <= M - 1; i++)
if (co[i] % 2) first = 1;
cout << (first ? "No\n" : "Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 501;
int n, m, a[2][N][N], foo[2];
bool check() {
if (foo[0] != foo[1]) return 0;
for (int i = 1; i <= n; i++) {
foo[0] = foo[1] = 0;
for (int j = 1; j <= m; j++) {
for (int k = 0; k <= 1; k++) {
foo[k] = (foo[k] + a[k][i][j]) % 2;
}
}
if (foo[0] != foo[1]) return 0;
}
for (int i = 1; i <= m; i++) {
foo[0] = foo[1] = 0;
for (int j = 1; j <= n; j++) {
for (int k = 0; k <= 1; k++) {
foo[k] = (foo[k] + a[k][j][i]) % 2;
}
}
if (foo[0] != foo[1]) return 0;
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i <= 1; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= m; k++) {
cin >> a[i][j][k];
foo[i] = (foo[i] + a[i][j][k]) % 2;
}
}
}
if (check())
cout << "Yes" << '\n';
else
cout << "No" << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int a[550][550], b[550][550], vis[550][550] = {0};
int main() {
int n, m, i, j, fl = 0;
cin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) cin >> a[i][j];
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
cin >> b[i][j];
if (a[i][j] != b[i][j]) vis[i][j] = 1;
}
for (i = 1; i < n; i++) {
for (j = 1; j < m; j++)
if (vis[i][j]) {
vis[i][j] = vis[i][j] ^ 1;
vis[i + 1][j] = vis[i + 1][j] ^ 1;
vis[i][j + 1] = vis[i][j + 1] ^ 1;
vis[i + 1][j + 1] = vis[i + 1][j + 1] ^ 1;
}
for (j = 1; j <= m; j++)
if (vis[i][j] == 1) {
fl = 1;
break;
}
}
for (j = 1; j <= m; j++)
if (vis[n][j] == 1) fl = 1;
if (fl == 1)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int hang[505], lie[505];
int main() {
int n, m;
cin >> n >> m;
int a[505][505], b[505][505];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &b[i][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (a[i][j] != b[i][j]) hang[i]++;
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (a[j][i] != b[j][i]) lie[i]++;
}
}
int flag = 0;
for (int i = 1; i <= n; i++) {
if (hang[i] % 2 != 0) {
flag = 1;
break;
}
}
if (!flag) {
for (int i = 1; i <= m; i++) {
if (lie[i] % 2 != 0) {
flag = 1;
break;
}
}
}
if (flag)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return f ? -x : x;
}
void write(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) write(x / 10);
putchar(x % 10 + '0');
}
long long n, m, a[560][560], b[560][560], hang[560], lie[560];
signed main() {
n = read();
m = read();
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) a[i][j] = read();
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) b[i][j] = read();
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) {
if (a[i][j] != b[i][j]) hang[i]++, lie[j]++;
}
long long flag = 1;
for (long long i = 1; i <= n; i++)
if (hang[i] % 2 == 1) {
flag = 0;
break;
}
for (long long j = 1; j <= m; j++)
if (lie[j] % 2 == 1) {
flag = 0;
break;
}
if (flag)
puts("Yes");
else
puts("No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
long long power(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2) res *= a;
a *= a;
n /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, m;
cin >> n >> m;
int a[n][m], b[n][m];
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) cin >> a[i][j];
}
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) cin >> b[i][j];
}
int diff[n][m], diffc[m];
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (m); ++j) {
if (a[i][j] != b[i][j])
diff[i][j] = 1;
else
diff[i][j] = 0;
}
}
int e = 0;
for (int i = (0); i < (n); ++i) {
int cnt = 0;
for (int j = (0); j < (m); ++j) {
if (diff[i][j] == 1) cnt++;
}
if (cnt % 2 == 1) {
e = 1;
break;
}
}
if (e == 1)
cout << "No";
else {
for (int i = (0); i < (m); ++i) {
int cnt = 0;
for (int j = (0); j < (n); ++j) {
if (diff[j][i] == 1) cnt++;
}
if (cnt % 2 == 1) {
e = 1;
break;
}
}
if (e == 1)
cout << "No";
else
cout << "Yes";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int m1[503][503], m2[503][503], col[503];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < 503; i++) {
col[i] = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> m1[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> m2[i][j];
if (m1[i][j] != m2[i][j]) {
col[j]++;
}
}
}
for (int i = 0; i < m; i++) {
if (col[i] % 2 == 1) {
cout << "No\n";
return 0;
}
}
for (int i = 0; i < n; i++) {
int cnt = 0, x, y;
for (int j = 0; j < m; j++) {
if (m1[i][j] != m2[i][j]) {
cnt++;
if (cnt == 1) {
x = j;
} else {
y = j;
}
}
if (cnt == 2) {
cnt = 0;
}
}
if (cnt == 1) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
bool get(vector<vector<int> > &a, vector<vector<int> > &b) {
for (int i = 1; i <= (int)(n - 1); ++i)
for (int j = 1; j <= (int)(m - 1); ++j) {
if (a[i][j] != b[i][j]) {
a[i][j] ^= 1;
a[0][j] ^= 1;
a[i][0] ^= 1;
a[0][0] ^= 1;
}
}
return a == b;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(10);
cout << fixed;
while (cin >> n >> m) {
vector<vector<int> > a(n, vector<int>(m)), b(n, vector<int>(m));
for (int i = 0; i < (int)(n); ++i)
for (int j = 0; j < (int)(m); ++j) cin >> a[i][j];
for (int i = 0; i < (int)(n); ++i)
for (int j = 0; j < (int)(m); ++j) cin >> b[i][j];
cout << (get(a, b) ? "YES" : "NO") << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 501, P = 1e9 + 7;
int a[N][N], b[N][N], c[N][N];
int cnt_r[N], cnt_c[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
c[i][j] = a[i][j] ^ b[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (c[i][j]) cnt_r[i]++;
}
if (cnt_r[i] & 1) {
cout << "No\n";
return 0;
}
}
for (int j = 0; j < m; j++) {
for (int i = 0; i < n; i++) {
if (c[i][j]) cnt_c[j]++;
}
if (cnt_c[j] & 1) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[505][505], res[505][505];
int change, a, b;
bool jud() {
int mid = 0;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
mid ^= res[i][j];
}
if (mid) return false;
}
for (int j = 0; j < b; j++) {
for (int i = 0; i < a; i++) {
mid ^= res[i][j];
}
if (mid) return false;
}
return true;
}
int main(void) {
while (~scanf("%d%d", &a, &b)) {
change = 0;
int mid;
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
scanf("%d", &arr[i][j]);
}
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
scanf("%d", &mid);
if (mid != arr[i][j])
res[i][j] = 1;
else
res[i][j] = 0;
}
}
if (jud())
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500;
int a[maxn + 5][maxn + 5], b[maxn + 5][maxn + 5];
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &b[i][j]);
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) a[i][j] = a[i][j] ^ b[i][j];
for (int i = 1; i < n; i++) {
int cnt = 0;
for (int j = 1; j <= m; j++)
if (a[i][j] == 1) cnt++;
if (cnt % 2 == 1) {
printf("No\n");
return 0;
}
for (int j = 1; j <= m; j++)
if (a[i][j]) {
a[i][j] = 0;
a[i + 1][j] = 1 - a[i + 1][j];
}
}
for (int i = 1; i <= m; i++)
if (a[n][i]) {
printf("No\n");
return 0;
}
printf("Yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, a;
cin >> n >> m;
vector<vector<int>> A(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) cin >> A[i][j];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a;
if (a != A[i][j])
A[i][j] = 1;
else
A[i][j] = 0;
}
}
for (int i = 0; i < n - 1; ++i) {
int cnt = 0;
for (int j = 0; j < m; ++j) {
if (A[i][j]) {
A[i + 1][j] = 1 - A[i + 1][j];
++cnt;
}
}
if (cnt & 1) {
cout << "No";
return 0;
}
}
for (int j = 0; j < m; ++j) {
if (A[n - 1][j]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <class T>
void _print(T t) {
cerr << t;
}
template <class T, class V>
void _print(pair<T, V> p) {
cerr << "{";
_print(p.first);
cerr << ",";
_print(p.second);
cerr << "}";
}
template <class T>
void _print(vector<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(set<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
cerr << "[ ";
for (T i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
cerr << "[ ";
for (auto i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
template <class T, class V>
void _print(unordered_map<T, V> v) {
cerr << "[ ";
for (auto i : v) {
_print(i);
cerr << " ";
}
cerr << "]";
}
vector<long long> sieve(long long n) {
long long *arr = new long long[n + 1]();
vector<long long> vect;
for (long long i = 2; i <= n; i++)
if (arr[i] == 0) {
vect.push_back(i);
for (long long j = 2 * i; j <= n; j += i) arr[j] = 1;
}
return vect;
}
void cp() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long a[501][501], b[2][501];
void solve() {
long long n, m;
cin >> n >> m;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
long long x;
cin >> x;
if (x != a[i][j]) {
b[0][i]++;
b[1][j]++;
}
}
}
for (long long i = 0; i < n; i++) {
if (b[0][i] % 2) {
cout << "NO"
<< "\n";
return;
}
}
for (long long i = 0; i < m; i++) {
if (b[1][i] % 2) {
cout << "NO"
<< "\n";
return;
}
}
cout << "YES"
<< "\n";
}
int32_t main() {
cp();
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
vector<vector<int>> b(n, vector<int>(m));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> b[i][j];
}
}
for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (a[i][j]) {
a[i][j] ^= 1;
a[i][0] ^= 1;
a[0][j] ^= 1;
a[0][0] ^= 1;
}
if (b[i][j]) {
b[i][j] ^= 1;
b[i][0] ^= 1;
b[0][j] ^= 1;
b[0][0] ^= 1;
}
}
}
cout << (a == b ? "Yes" : "No") << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, k;
cin >> n >> m;
int a[n][m], b[n][m];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) cin >> a[i][j];
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) cin >> b[i][j];
}
for (i = 0; i < n; i++) {
int cnt = 0;
for (j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) cnt++;
}
if (cnt % 2 == 1) {
cout << "No\n";
return 0;
}
}
for (j = 0; j < m; j++) {
int cnt = 0;
for (i = 0; i < n; i++) {
if (a[i][j] != b[i][j]) cnt++;
}
if (cnt % 2 == 1) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char buf[1 << 21], *p1 = buf, *p2 = buf;
template <class T>
void read(T &x) {
x = 0;
int c = getchar();
int flag = 0;
while (c < '0' || c > '9') flag |= (c == '-'), c = getchar();
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
if (flag) x = -x;
}
template <class T>
T _max(T a, T b) {
return b < a ? a : b;
}
template <class T>
T _min(T a, T b) {
return a < b ? a : b;
}
template <class T>
bool checkmax(T &a, T b) {
return a < b ? a = b, 1 : 0;
}
template <class T>
bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}
int n, m;
int a[505][505], b[505][505];
void init() {
read(n);
read(m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) read(a[i][j]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) read(b[i][j]);
}
void solve() {
for (int i = 1; i < n; ++i) {
for (int j = 1; j < m; ++j) {
if (a[i][j] != b[i][j]) {
a[i][j] ^= 1, a[i][m] ^= 1;
a[n][j] ^= 1, a[n][m] ^= 1;
}
}
}
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
if (a[i][j] != b[i][j]) {
printf("No\n");
return;
}
printf("Yes\n");
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int> > a(n, vector<int>(m)), b(n, vector<int>(m));
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> b[i][j];
vector<int> cr(n, 0), cc(m, 0);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (a[i][j] != b[i][j]) {
cr[i]++;
cc[j]++;
}
bool check = true;
for (int i = 0; i < n; i++)
if (cr[i] % 2 == 1) {
check = false;
break;
}
if (check)
for (int i = 0; i < m; i++)
if (cc[i] % 2 == 1) {
check = false;
break;
}
if (check)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, b[505][505], a[505][505], i = 0, j = 0, srb[505], scb[505],
sra[505], sca[505];
int main(void) {
for (cin >> n >> m; i < n; i++) {
for (j = 0; j < m; j++)
cin >> b[i][j], srb[i] += b[i][j], scb[j] += b[i][j];
}
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j], sra[i] += a[i][j], sca[j] += a[i][j];
for (i = 0; i < n; i++)
if ((sra[i] % 2) != (srb[i] % 2)) return cout << "No", 0;
for (i = 0; i < m; i++)
if ((sca[i] % 2) != (scb[i] % 2)) return cout << "No", 0;
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NUM = 2e5 + 5;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << "\n";
err(++it, args...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int num_tests = 1;
while (num_tests-- > 0) {
int n, m;
cin >> n >> m;
int a[n][m], b[n][m];
int cnta = 0, cntb = 0;
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < m; j++) {
cin >> a[i][j];
if (a[i][j]) cnta++;
}
for (long long int i = 0; i < n; i++)
for (long long int j = 0; j < m; j++) {
cin >> b[i][j];
if (b[i][j]) cntb++;
}
if (cnta % 2 != cntb % 2) {
cout << "No";
return 0;
}
for (long long int i = 0; i < n; i++) {
int cnt1 = 0, cnt2 = 0;
for (long long int j = 0; j < m; j++) {
if (a[i][j]) cnt1++;
if (b[i][j]) cnt2++;
}
if (cnt1 % 2 != cnt2 % 2) {
cout << "No";
return 0;
}
}
for (long long int i = 0; i < m; i++) {
int cnt1 = 0, cnt2 = 0;
for (long long int j = 0; j < n; j++) {
if (a[j][i]) cnt1++;
if (b[j][i]) cnt2++;
}
if (cnt1 % 2 != cnt2 % 2) {
cout << "No";
return 0;
} else
cnt1 = 0, cnt2 = 0;
}
cout << "Yes";
}
}
|
#include <bits/stdc++.h>
const long long mod = 490019;
void fail() {
std::cout << "No\n";
exit(0);
}
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, m;
cin >> n >> m;
long long pre[2][n + m + 2][2];
memset(pre, 0, sizeof(pre));
long long a[n + 1][m + 1], b[n + 1][m + 1];
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) {
cin >> a[i][j];
pre[0][i + j][a[i][j]]++;
}
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++) {
cin >> b[i][j];
pre[1][i + j][b[i][j]]++;
}
for (long long i = 1; i <= n; i++) {
long long chk = 0;
for (long long j = 1; j <= m; j++) chk ^= (a[i][j] != b[i][j]);
if (chk) fail();
}
for (long long i = 1; i <= m; i++) {
long long chk = 0;
for (long long j = 1; j <= n; j++) {
chk ^= (a[j][i] != b[j][i]);
}
if (chk) fail();
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<vector<int>> a(n, vector<int>(m));
vector<vector<int>> b(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
int sm = 0;
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) {
sm++;
}
}
if (sm % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
for (int j = 0; j < m; j++) {
int sm = 0;
for (int i = 0; i < n; i++) {
if (a[i][j] != b[i][j]) {
sm++;
}
}
if (sm % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, m;
int a[N][N], b[N][N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
int num = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &b[i][j]);
b[i][j] ^= a[i][j];
if (b[i][j]) num++;
}
}
for (int i = 1; i <= n; i++) {
int num = 0;
for (int j = 1; j <= m; j++) {
if (b[i][j]) num++;
}
if (num & 1) {
puts("No");
return 0;
}
}
for (int j = 1; j <= m; j++) {
int num = 0;
for (int i = 1; i <= n; i++)
if (b[i][j]) num++;
if (num & 1) {
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
int i, j, a[501][501], b[501][501];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
scanf("%d", &b[i][j]);
}
}
int c[501][501];
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (a[i][j] == b[i][j])
c[i][j] = 0;
else
c[i][j] = 1;
}
}
int count[501][2] = {0};
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) count[i][0] += c[i][j];
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) count[i][1] += c[j][i];
}
int val = 1;
for (i = 0; i < n; i++) {
if (count[i][0] % 2) val = 0;
}
for (i = 0; i < m; i++) {
if (count[i][1] % 2) val = 0;
}
if (val)
printf("YES\n");
else
printf("NO\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n, m;
cin >> n >> m;
long long int a[n][m], b[n][m], i, j, c[n][m], count = 0, flag = 1;
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> a[i][j];
c[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
cin >> b[i][j];
if (a[i][j] != b[i][j]) {
c[i][j] = 1;
count++;
}
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (c[i][j] == 1) {
if (i == n - 1 || j == m - 1)
flag = 0;
else {
c[i][j] = 0;
c[i + 1][j] = !c[i + 1][j];
c[i][j + 1] = !c[i][j + 1];
c[i + 1][j + 1] = !c[i + 1][j + 1];
}
}
}
}
if (!flag) {
cout << "no" << endl;
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (c[i][j] == 1) {
flag = 0;
break;
}
}
}
if (!flag) {
cout << "no" << endl;
return 0;
} else {
cout << "yes" << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, k, x, y, z;
int a[510][510], b[510][510], c[510][510];
bool fl = true;
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) cin >> a[i][j];
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
cin >> b[i][j];
c[i][j] = a[i][j] ^ b[i][j];
}
for (i = 1; i <= n; i++) {
x = 0;
for (j = 1; j <= m; j++) x += c[i][j];
if (x & 1) {
fl = false;
break;
}
}
if (fl)
for (j = 1; j <= m; j++) {
x = 0;
for (i = 1; i <= n; i++) x += c[i][j];
if (x & 1) {
fl = false;
break;
}
}
if (fl)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[502][502], b[502][502];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) {
if (i + 1 < n && j + 1 < m) {
a[i][j] ^= 1;
a[i][j + 1] ^= 1;
a[i + 1][j] ^= 1;
a[i + 1][j + 1] ^= 1;
} else {
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int em(long long int x, long long int Mod, long long int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return em((x % Mod * x % Mod) % Mod, Mod, n / 2) % Mod;
else
return (x % Mod * em((x % Mod * x % Mod) % Mod, Mod, (n - 1) / 2)) % Mod;
}
long long int tochangerow[502], tochangecol[502];
int32_t main() {
std::ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, m, i, j, k, l;
cin >> n >> m;
long long int arr1[n + 1][m + 1];
long long int arr2[n + 1][m + 1];
for (long long int i = (long long int)1; i < (long long int)n + 1; i++) {
for (long long int j = (long long int)1; j < (long long int)m + 1; j++)
cin >> arr1[i][j];
}
for (long long int i = (long long int)1; i < (long long int)n + 1; i++) {
for (long long int j = (long long int)1; j < (long long int)m + 1; j++)
cin >> arr2[i][j];
}
for (long long int i = (long long int)1; i < (long long int)n + 1; i++) {
for (long long int j = (long long int)1; j < (long long int)m + 1; j++) {
if (arr1[i][j] != arr2[i][j]) {
tochangerow[i]++;
tochangecol[j]++;
}
}
}
long long int flag = 0;
for (long long int i = (long long int)1; i < (long long int)n + 1; i++) {
for (long long int j = (long long int)1; j < (long long int)m + 1; j++) {
if (arr1[i][j] != arr2[i][j]) {
if ((tochangerow[i] % 2 != 0) || (tochangecol[j] % 2 != 0)) flag = 1;
}
}
}
if (flag == 1)
cout << "No\n";
else
cout << "Yes\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500 + 10;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
int n, m;
int a[maxn][maxn], b[maxn][maxn];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> b[i][j];
a[i][j] ^= b[i][j];
}
}
int flag = 0;
for (int i = 1; i <= n; i++) {
int tm = 0;
for (int j = 1; j <= m; j++) {
tm += a[i][j];
}
if (tm % 2) flag = 1;
}
for (int i = 1; i <= m; i++) {
int tm = 0;
for (int j = 1; j <= n; j++) {
tm += a[j][i];
}
if (tm % 2) flag = 1;
}
if (flag)
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int> > a(n, vector<int>(m, 0));
vector<vector<int> > b(n, vector<int>(m, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
int sa = 0;
int sb = 0;
for (int j = 0; j < m; j++) {
sa ^= a[i][j];
sb ^= b[i][j];
}
if (sa != sb) {
cout << "No";
return 0;
}
}
for (int j = 0; j < m; j++) {
int sa = 0;
int sb = 0;
for (int i = 0; i < n; i++) {
sa ^= a[i][j];
sb ^= b[i][j];
}
if (sa != sb) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
long long int power(long long int a, long long int b) {
long long int aa = 1;
while (b) {
if (b & 1) {
aa = aa * a;
aa %= 1000000007;
}
a = a * a;
a %= 1000000007;
b /= 2;
}
return aa;
}
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
;
int n, m;
cin >> n >> m;
int a[n][m], b[n][m], c[n][m];
int flag = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) cin >> b[i][j];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (a[i][j] == b[i][j])
c[i][j] = 0;
else
c[i][j] = 1;
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (c[i][j] == 1) {
int t1 = i + 1, t2 = j + 1;
while (t1 < n && c[t1][j] == 0) t1++;
while (t2 < m && c[i][t2] == 0) t2++;
if (t1 == n || t2 == m) {
flag = 1;
break;
}
c[i][t2] = 0;
c[t1][j] = 0;
c[t1][t2] = 1 - c[t1][t2];
}
}
}
if (!flag)
cout << "Yes";
else
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
int m1[502][502], m2[502][502];
int num[502], lie[502];
vector<int> v;
const int INF = 0x3f3f3f3f;
int main(void) {
int a, b, i, j, flag = 1, sum = 0;
scanf("%d %d", &a, &b);
for (i = 0; i < a; i++) {
for (j = 0; j < b; j++) {
scanf("%d", &m1[i][j]);
}
}
for (i = 0; i < a; i++) {
for (j = 0; j < b; j++) {
scanf("%d", &m2[i][j]);
}
}
for (i = 0; i < b; i++) {
num[i] = lie[i] = 0;
}
for (i = 0; i < a; i++) {
for (j = 0; j < b; j++) {
num[j] += m1[i][j] ^ m2[i][j];
lie[i] += m1[i][j] ^ m2[i][j];
}
}
for (i = 0; i < b; i++) {
if (num[i] % 2) {
flag = 0;
break;
}
}
for (i = 0; i < a; i++) {
if (lie[i] % 2) {
flag = 0;
break;
}
}
if (flag) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int a[n][m];
int c[m], d[n];
for (int i = 0; i < n; i++) {
d[i] = 0;
for (int j = 0; j < m; j++) {
c[j] = 0;
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int b;
cin >> b;
if (b != a[i][j]) c[j]++, d[i]++;
}
}
if (n == 1 || m == 1) {
for (int i = 0; i < m; i++)
if (c[i]) {
cout << "No" << endl;
return 0;
}
for (int i = 0; i < n; i++)
if (d[i]) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < m; i++)
if (c[i] % 2) {
cout << "No" << endl;
return 0;
}
for (int i = 0; i < n; i++)
if (d[i] % 2) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = (long long)(998244353)) {
return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = (long long)(998244353)) {
return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = (long long)(998244353)) {
long long r = 1;
for (; k; k >>= 1) {
if (k & 1) r = r * n % p;
n = n * n % p;
}
return r;
}
long long inv(long long a, long long p = (long long)(998244353)) {
return fpow(a, p - 2, p);
}
bool sa(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
bool fd(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
bool sd(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second > b.second);
}
long long dx[4] = {0, 0, 1, -1};
long long dy[4] = {1, -1, 0, 0};
bool valid(long long x, long long y, long long n, long long m) {
if (x < 0 || y < 0) {
return false;
} else if (x >= n || y >= m) {
return false;
} else
return true;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, c = 0, f = 0;
cin >> n >> m;
vector<long long> v1, v2;
long long a[n + 5][m + 5], b[n + 5][m + 5];
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (long long i = 0; i < n; i++) {
long long k = 0;
for (long long j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) k++;
}
v1.push_back(k);
}
for (long long j = 0; j < m; j++) {
long long k = 0;
for (long long i = 0; i < n; i++) {
if (a[i][j] != b[i][j]) k++;
}
v2.push_back(k);
}
for (long long i = 0; i < v1.size(); i++) {
if (v1[i] % 2) {
cout << "No";
return 0;
}
}
for (long long i = 0; i < v2.size(); i++) {
if (v2[i] % 2) {
cout << "No";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
long long n, m;
cin >> n >> m;
vector<bool> b(m, 0);
vector<vector<bool>> a1(n, b), a2(n, b);
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
bool t;
cin >> t;
a1[i][j] = t;
}
}
for (long long i = 0; i < n; ++i) {
for (long long j = 0; j < m; ++j) {
bool t;
cin >> t;
a2[i][j] = t;
}
}
for (long long i = 0; i < n - 1; ++i) {
long long par = 0;
bool flag = 0;
for (long long j = 0; j < m; ++j) {
if (a1[i][j] != a2[i][j]) {
++par;
a1[i + 1][j] = !a1[i + 1][j];
}
}
if (par & 1) {
cout << "No";
return 0;
}
for (long long j = 0; j < m; ++j) {
if (a1[i][j] != a2[i][j]) {
}
}
}
for (long long j = 0; j < m; ++j) {
if (a1[n - 1][j] != a2[n - 1][j]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int A[N][N], B[N][N];
int G[N], T[N];
void solve() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
scanf("%d", &A[i][j]);
}
}
int x;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
scanf("%d", &x);
A[i][j] ^= x;
G[j] ^= A[i][j];
T[i] ^= A[i][j];
}
}
for (int i = 1; i <= n; ++i) {
if (T[i] > 0) {
printf("No\n");
return;
}
}
for (int i = 1; i <= m; ++i) {
if (G[i] > 0) {
printf("No\n");
return;
}
}
printf("Yes\n");
}
int main() { solve(); }
|
#include <bits/stdc++.h>
using namespace std;
int a[500][500];
int b[500][500];
int main() {
int n, m;
cin >> n >> m;
int e;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> e;
a[i][j] = e;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> e;
b[i][j] = e;
}
}
for (int i = 0; i < n; i++) {
int f;
int s = f = 0;
for (int j = 0; j < m; j++) {
f += a[i][j];
s += b[i][j];
}
if ((f - s) % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < m; i++) {
int f;
int s = f = 0;
for (int j = 0; j < n; j++) {
f += a[j][i];
s += b[j][i];
}
if ((f - s) % 2 != 0) {
cout << "No" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n, m;
cin >> n >> m;
long long x = 0, y = 0, c = 0, d = 0;
vector<vector<long long>> a(n, vector<long long>(m)),
b(n, vector<long long>(m));
for (vector<long long>& i : a)
for (long long& j : i) {
cin >> j;
}
for (vector<long long>& i : b)
for (long long& j : i) {
cin >> j;
}
for (long long i = 0; i < n; i++) {
long long f = 0, s = 0;
for (long long j = 0; j < m; j++) {
if (a[i][j]) f++;
if (b[i][j]) s++;
}
if (f % 2 != s % 2) {
cout << "No";
return 0;
}
}
for (long long j = 0; j < m; j++) {
long long f = 0, s = 0;
for (long long i = 0; i < n; i++) {
if (a[i][j]) f++;
if (b[i][j]) s++;
}
if (f % 2 != s % 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
const long long int mxn = 1e5 + 1;
const string fuck = "fuck";
void solve() {
long long int n, m;
cin >> n >> m;
vector<vector<long long int> > a(n, vector<long long int>(m)),
b(n, vector<long long int>(m));
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
cin >> b[i][j];
}
}
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) {
a[i][j] ^= 1;
a[0][j] ^= 1;
a[i][0] ^= 1;
a[0][0] ^= 1;
}
}
}
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
if (a[i][j] != b[i][j]) {
cout << "No";
return;
}
}
}
cout << "Yes";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long int cse = 1;
while (cse--) {
solve();
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
cin >> n >> m;
long long int a[n][m], b[n][m];
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
long long int g = 0;
for (long long int i = 0; i < n; i++) {
long long int f = 0;
for (long long int j = 0; j < m; j++) {
cin >> b[i][j];
if (a[i][j] != b[i][j]) {
f++;
}
}
if (f % 2 != 0) {
g = 1;
}
}
if (g) {
cout << "NO" << endl;
return 0;
} else {
for (long long int i = 0; i < m; i++) {
long long int f = 0;
for (long long int j = 0; j < n; j++) {
if (a[j][i] != b[j][i]) {
f++;
}
}
if (f % 2 != 0) {
g = 1;
}
}
if (g) {
cout << "NO";
} else {
cout << "YES";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int A[600][600];
long long int B[600][600];
long long int d[600][600];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, m;
cin >> n >> m;
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
cin >> A[i][j];
}
}
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
cin >> B[i][j];
}
}
memset(d, 0, sizeof d);
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < m; j++) {
d[i][j] = A[i][j] != B[i][j];
}
}
for (long long int row = 0; row < n; row++) {
long long int s = 0;
for (long long int col = 0; col < m; col++) {
s += d[row][col];
}
if (s % 2) {
cout << "No" << endl;
return 0;
}
}
for (long long int col = 0; col < m; col++) {
long long int s = 0;
for (long long int row = 0; row < n; row++) {
s += d[row][col];
}
if (s % 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e3 + 4;
long long int modPow(long long int a, long long int b) {
long long int res = 1;
a %= 1000000001;
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000001;
a = a * a % 1000000001;
}
return res;
}
long long int nCr(long long int n, long long int k) {
long long int res = 1;
if (n < k) return 0;
if (k > n - k) k = n - k;
for (long long int i = 0; i < k; ++i) {
res = (res * (n - i)) % 1000000001;
res = (res * modPow(i + 1, 1000000001 - 2)) % 1000000001;
}
return res;
}
long long int factorial(long long int n) {
if (n == 1) return 1;
return (n * factorial(n - 1)) % 1000000001;
}
long long int n, i, j, d, y, x, m, p, q, f, r, ans;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
long long int a[n + 1][m + 1];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> x;
if (a[i][j] == x) continue;
if (i == (n - 1) || j == (m - 1)) {
cout << "No";
return 0;
}
a[i][j] = 1 - a[i][j];
a[i + 1][j] = 1 - a[i + 1][j];
a[i][j + 1] = 1 - a[i][j + 1];
a[i + 1][j + 1] = 1 - a[i + 1][j + 1];
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[510][510];
int b[510][510];
int c[510][510];
int main() {
memset(c, 0, sizeof(c));
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%d", &a[i][j]);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%d", &b[i][j]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (a[i][j] != b[i][j])
c[i][j] = 1;
else
c[i][j] = 0;
}
}
bool flag = false;
for (int i = 0; i < n; i++) {
int sumr = 0;
for (int j = 0; j < m; j++) {
sumr += c[i][j];
}
if (sumr % 2) {
flag = true;
break;
}
}
for (int i = 0; i < m; i++) {
int sumc = 0;
for (int j = 0; j < n; j++) {
sumc += c[j][i];
}
if (sumc % 2) {
flag = true;
break;
}
}
if (flag)
printf("NO\n");
else
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 1;
int a[N][N], b[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
}
bool fd = true;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
int x;
scanf("%d", &x);
a[i][j] ^= x ^ a[i - 1][j - 1] ^ a[i - 1][j] ^ a[i][j - 1];
if (a[i][j] == 1 && (i == n || j == m)) {
printf("No");
return 0;
}
}
}
printf("Yes");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class customIO {
public:
istream& in;
ostream& out;
customIO(istream& _in, ostream& _out) : in(_in), out(_out) {}
string next() {
string s;
in >> s;
return s;
}
double nextDouble() { return stod(next()); }
int nextInt() { return stoi(next()); }
long long nextLong() { return stoll(next()); }
template <typename T>
void print(T t) {
out << t;
}
template <typename T, typename... U>
void print(T t, U... u) {
out << t;
print(u...);
}
template <typename T, typename... U>
void println(T t, U... u) {
print(t, u..., "\n");
}
void println() { print("\n"); }
};
int diff[505][505];
class CF1119C {
public:
void solve(customIO& io) {
int n = io.nextInt();
int m = io.nextInt();
vector<vector<int> > a, b;
for (int i = 0; i < n; ++i) {
vector<int> cur;
for (int j = 0; j < m; ++j) {
cur.push_back(io.nextInt());
}
a.push_back(cur);
}
for (int i = 0; i < n; ++i) {
vector<int> cur;
for (int j = 0; j < m; ++j) {
cur.push_back(io.nextInt());
}
b.push_back(cur);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (a[i][j] != b[i][j]) ++diff[i][j];
}
}
for (int i = 0; i < n; ++i) {
int c = 0;
for (int j = 0; j < m; ++j) {
c += diff[i][j];
}
if (c % 2 == 1) {
io.println("No");
return;
}
}
for (int i = 0; i < m; ++i) {
int c = 0;
for (int j = 0; j < n; ++j) {
c += diff[j][i];
}
if (c % 2 == 1) {
io.println("No");
return;
}
}
io.println("Yes");
return;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed;
cout.precision(20);
istream& in(std::cin);
ostream& out(std::cout);
customIO io(in, out);
CF1119C solver;
solver.solve(io);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
for (int i = 0; i < int(a.size()); ++i)
out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(12) << fixed;
smain();
}
void smain() {
int n, m;
cin >> n >> m;
vector<vector<int> > a(n, vector<int>(m, 0));
vector<vector<int> > b(n, vector<int>(m, 0));
for (int i = 0; i < int(n); ++i) {
for (int j = 0; j < int(m); ++j) cin >> a[i][j];
}
for (int i = 0; i < int(n); ++i) {
for (int j = 0; j < int(m); ++j) cin >> b[i][j];
}
vector<int> fa(n - 1, 0), fb(n - 1, 0);
vector<int> sa(m - 1, 0), sb(m - 1, 0);
int cora = a[n - 1][m - 1], corb = b[n - 1][m - 1];
for (int i = 0; i < int(n - 1); ++i) {
fa[i] = a[i][m - 1];
fb[i] = b[i][m - 1];
}
for (int j = 0; j < int(m - 1); ++j) {
sa[j] = a[n - 1][j];
sb[j] = b[n - 1][j];
}
for (int i = 0; i < int(n - 1); ++i) {
for (int j = 0; j < int(m - 1); ++j) {
cora ^= a[i][j];
corb ^= b[i][j];
fa[i] ^= a[i][j];
fb[i] ^= b[i][j];
sa[j] ^= a[i][j];
sb[j] ^= b[i][j];
}
}
if (cora == corb && fa == fb && sa == sb)
cout << "Yes";
else
cout << "No";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int a[N][N], b[N][N];
int n, m;
bool check() {
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = 1; j <= m; j++)
if (a[i][j]) ++cnt;
if (cnt & 1) return 0;
}
for (int j = 1; j <= m; j++) {
int cnt = 0;
for (int i = 1; i <= n; i++)
if (a[i][j]) ++cnt;
if (cnt & 1) return 0;
}
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) scanf("%d", &b[i][j]);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
a[i][j] = a[i][j] ^ b[i][j];
}
if (check())
printf("Yes\n");
else
printf("No\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long LINF = (long long)1e18 + 47;
const int INF = 1e9 + 47;
const int MOD = 998244353;
const int modulo = 1e8;
const int nax = 3 * (int)1e5 + 10;
const double EPS = 1e-9;
const double PI = acos(-1.0);
int a[510][510];
int b[510][510];
int col_a[510];
int row_a[510];
int col_b[510];
int row_b[510];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
;
int n, m;
cin >> n >> m;
for (int i = (0); i < (n); i++)
for (int j = (0); j < (m); j++) {
cin >> a[i][j];
}
for (int i = (0); i < (n); i++)
for (int j = (0); j < (m); j++) {
cin >> b[i][j];
}
bool ok = true;
for (int i = (0); i < (n); i++) {
for (int j = (0); j < (m); j++) {
col_a[i] += a[i][j];
col_b[i] += b[i][j];
}
if (col_a[i] % 2 != col_b[i] % 2) ok = false;
}
for (int j = (0); j < (m); j++) {
for (int i = (0); i < (n); i++) {
row_a[j] += a[i][j];
row_b[j] += b[i][j];
}
if (row_a[j] % 2 != row_b[j] % 2) ok = false;
}
if (ok)
cout << "Yes\n";
else
cout << "No\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
long long n, m, k, a[N][N], b[N][N], res;
map<long long, long long> freq;
int solve() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%lld", &a[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%lld", &b[i][j]);
b[i][j] ^= a[i][j];
}
}
for (int i = 0; i < n - 1; i++) {
long long pc = -1, ok = 0;
for (int j = 0; j < m; j++) {
if (b[i][j] == 1) {
ok++;
if (pc == -1) {
pc = j;
} else {
b[i + 1][pc] ^= 1;
b[i + 1][j] ^= 1;
}
}
}
if (ok == 1) {
printf("No\n");
return 0;
}
}
for (int j = 0; j < m; j++) {
if (b[n - 1][j]) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
int main() { return solve(); }
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
bool row[maxn], col[maxn];
int n, m;
int A[maxn][maxn], B[maxn][maxn];
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> A[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> B[i][j];
if (A[i][j] != B[i][j]) {
row[i] = col[j] = true;
}
}
}
int cnt;
for (int i = 1; i <= n; i++) {
if (!row[i]) continue;
cnt = 0;
for (int j = 1; j <= m; j++) {
if (A[i][j] != B[i][j]) cnt++;
}
if (cnt & 1) {
cout << "No";
return 0;
}
}
for (int i = 1; i <= m; i++) {
if (!col[i]) continue;
cnt = 0;
for (int j = 1; j <= n; j++) {
if (A[j][i] != B[j][i]) cnt++;
}
if (cnt & 1) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int inp[n][m], target[n][m];
int cnt[2] = {0}, cnt2[2] = {0};
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) scanf("%d", &inp[i][j]), cnt[inp[i][j] % 2]++;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
scanf("%d", &target[i][j]), cnt2[target[i][j] % 2]++;
bool ok = true;
if ((cnt[0] % 2 == cnt2[0] % 2) && (cnt[1] % 2 == cnt2[1] % 2)) {
for (int i = 0; i < n; i++) {
int sum = 0, sum2 = 0;
for (int j = 0; j < m; j++) {
sum += inp[i][j];
sum2 += target[i][j];
}
if (sum % 2 != sum2 % 2) {
ok = false;
goto done;
}
}
for (int j = 0; j < m; j++) {
int sum = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
sum += inp[i][j];
sum2 += target[i][j];
}
if (sum % 2 != sum2 % 2) {
ok = false;
goto done;
}
}
} else {
ok = false;
}
done:
printf("%s\n", ok ? "Yes" : "No");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100001;
const int MOD = 1e9 + 7;
mt19937 rnd(100);
int main(int argc, char* argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m, x;
vector<vector<int> > a;
cin >> n >> m;
a.assign(n, vector<int>(m));
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
cin >> x;
a[i][j] = (int)(x != a[i][j]);
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) sum += a[i][j];
if (sum % 2) {
cout << "No";
return 0;
}
}
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < n; j++) sum += a[j][i];
if (sum % 2) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (y == 0) return x;
return gcd(y, x % y);
}
long long absol(long long x) {
if (x < 0) {
return -x;
}
return x;
}
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
greater<pair<long long, long long> > >
pq;
long long expo(long long b, long long n, long long m) {
long long r, p;
p = 1;
b = b % m;
while (n > 0) {
r = n % 2;
if (r == 1) p = ((p % m) * (b % m)) % m;
b = ((b % m) * (b % m)) % m;
n = n / 2;
}
return (p % m);
}
long long divide1(long long a, long long b, long long m) {
long long r, p, n;
p = a % m;
n = m - 2;
while (n > 0) {
r = n % 2;
if (r == 1) p = ((p % m) * (b % m)) % m;
b = ((b % m) * (b % m)) % m;
n = n / 2;
}
return (p % m);
}
long long mat1[600][600], mat2[600][600], diff1[600][600], coun[609],
coun1[600];
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
long long n, m;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> mat1[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> mat2[i][j];
if (mat1[i][j] == mat2[i][j]) {
diff1[i][j] = 0;
} else
diff1[i][j] = 1;
coun[i] += diff1[i][j];
coun1[j] += diff1[i][j];
}
}
for (int i = 0; i < n; ++i) {
if (coun[i] & 1) {
cout << "No"
<< "\n";
return 0;
}
}
for (int i = 0; i < m; ++i) {
if (coun1[i] & 1) {
cout << "No"
<< "\n";
return 0;
}
}
cout << "Yes"
<< "\n";
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.