-
Notifications
You must be signed in to change notification settings - Fork 0
/
F_XOR_Puzzle.cpp
84 lines (73 loc) · 1.79 KB
/
F_XOR_Puzzle.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <algorithm>
#include <iostream>
#include <cstring>
#include <climits>
#include <cstdio>
#include <cmath>
#include <unordered_map>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef map<ll, ll> mll;
typedef set<ll> sll;
typedef queue<ll> qll;
typedef queue<pll> qpll;
#define all(x) x.begin(), x.end()
#define sz(x) (ll) x.size()
#define fr front()
#define bk back()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define FOR(i, a, b, inc) for (ll i = a; i < b; i += inc)
#define RFOR(i, a, b, inc) for (ll i = b - 1; i >= a; i -= inc)
#define REP(i, a) FOR(i, 0, a, 1)
#define RREP(i, a) RFOR(i, 0, a, 1)
#define each(a, x) for (auto& a: x)
const ll INF = 1e9;
const ll M = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n, m; cin >> n >> m;
ll 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 row[n];
for (int i = 0; i < n; i++) {
row[i] = a[i][0]^b[i][0];
for (int j = 0; j < m; j++) {
a[i][j] ^= row[i];
}
}
for (int j = 1; j < m; j++) {
int res = a[0][j]^b[0][j];
for (int i = 1; i < n; i++) {
int cur = a[i][j]^b[i][j];
if (cur != res) {
cout << "NO\n";
return 0;
}
}
}
cout << "YES\n";
}