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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define getFro(vec) (vec.empty()?0:vec.front())
#define getBac(vec) (vec.empty()?0:vec.front())
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define DEBUG(variable) \
do { \
std::cerr << #variable << ":"; \
for (const auto& elem : variable) { \
std::cerr << elem << " "; \
} \
std::cerr << "\n"; \
} while (0)
#define uniVec(var) \
do { \
sort(var.begin(),var.end());\
var.resize(unique(var.begin(),var.end())-var.begin());\
} while (0)
#define debugN(var,N) \
do{ \
std::cerr<<#var<<":"; \
FOR(i,1,N){ \
std::cerr<<var[i]<<" "; \
} \
std::cerr<<"\n"; \
}while(0)
#define debugMap(variable) \
do { \
std::cerr << #variable << ":\n"; \
for (const auto& pair : variable) { \
std::cerr << " " << pair.first << " => " << pair.second << "\n"; \
} \
std::cerr << std::endl; \
} while (0)
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
#define vecMxx(vec,x) (vec.end()-lower_bound(all(vec),x)) // vec中大于x的数有几个
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr3;
typedef array<ll,2> arr2;
typedef double DB;
typedef long double LD;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e18)+3;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,Q,X,K,lT,A[25][25];
bool vis[25][25];
ll ans, total_xor;
inline void solve(){
cin >> N >> M;
total_xor = 0;
ans = 0;
CLR(vis, false);
FOR(i, 1, N) {
FOR(j, 1, M) {
cin >> A[i][j];
total_xor ^= A[i][j];
}
}
function<void(ll)> dfs = [&](ll covered_xor) {
// 找到第一个未被覆盖的格子
ll next_i = -1, next_j = -1;
FOR(i, 1, N) {
FOR(j, 1, M) {
if (!vis[i][j]) {
next_i = i;
next_j = j;
goto found;
}
}
}
found:
// 如果所有格子都处理完了，计算得分
if (next_i == -1) {
ll score = total_xor ^ covered_xor;
ans = max(ans, score);
return;
}
ll i = next_i, j = next_j;
// 选择1：不放多米诺骨牌，跳过当前格子
vis[i][j] = true;
dfs(covered_xor);
vis[i][j] = false;
// 选择2：尝试垂直放置多米诺骨牌 (向下)
if (i + 1 <= N && !vis[i + 1][j]) {
vis[i][j] = vis[i + 1][j] = true;
dfs(covered_xor ^ A[i][j] ^ A[i + 1][j]);
vis[i][j] = vis[i + 1][j] = false;
}
// 选择3：尝试水平放置多米诺骨牌 (向右)
if (j + 1 <= M && !vis[i][j + 1]) {
vis[i][j] = vis[i][j + 1] = true;
dfs(covered_xor ^ A[i][j] ^ A[i][j + 1]);
vis[i][j] = vis[i][j + 1] = false;
}
};
dfs(0);
cout << ans << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// cin>>lT;
// while(lT--){
// solve();
// }
solve();
return 0;
}
/*
AC
https://atcoder.jp/contests/abc407/submissions/66113167
*/
|
