[搜索] ACM-ICPC 2017 Asia Nanning Rake It In

112 阅读 0 评论 74 点赞

我是靠谱客的博主单纯篮球，这篇文章主要介绍[搜索] ACM-ICPC 2017 Asia Nanning Rake It In，现在分享给大家，希望可以做个参考。

Rake It In

https://nanti.jisuanke.com/t/A1538
一个另类的搜索吧
A要最大的 B要最小的如此对抗的进行
直接搜很容易但是什么状态是我们需要的才是关键
A是奇数轮 B是偶数轮所以在奇数轮 A选择之后所有状态最大的
B偶数轮选择之后状态最小的这样我们把所有状态都枚举了也得到了他们博弈选择的最优解

复制代码

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
const int INF = 0x3f3f3f3f;
int n, m, k;
int cas;
int mp[maxn][maxn];
void cg1(int x, int y) {
int t = mp[x][y];
mp[x][y] = mp[x][y + 1];
mp[x][y + 1] = mp[x + 1][y + 1];
mp[x + 1][y + 1] = mp[x + 1][y];
mp[x + 1][y] = t;
}
void cg2(int x, int y) {
int t = mp[x + 1][y];
mp[x + 1][y] = mp[x + 1][y + 1];
mp[x + 1][y + 1] = mp[x][y + 1];
mp[x][y + 1] = mp[x][y];
mp[x][y] = t;
}
int resum(int x, int y) {
return mp[x][y] + mp[x + 1][y] + mp[x][y + 1] + mp[x + 1][y + 1];
}
int dfs(int u) {
if(u > 2 * k)
return 0;
int ans = 0;
if(u & 1) {
ans = 0;
for(int i = 1; i <= 3; i ++) {
for(int j = 1; j <= 3; j ++) {
cg1(i, j);
ans = max(ans, dfs(u + 1) + resum(i, j));
cg2(i, j);
}
}
} else {
ans = INF;
for(int i = 1; i <= 3; i ++) {
for(int j = 1; j <= 3; j ++) {
cg1(i, j);
ans = min(ans, dfs(u + 1) + resum(i, j));
cg2(i, j);
}
}
}
return ans;
}
signed main() {
scanf("%d", &cas);
while(cas --) {
scanf("%d", &k);
for(int i = 1; i <= 4; i ++)
for(int j = 1; j <= 4; j ++)
scanf("%d", &mp[i][j]);
cout << dfs(1) << endl;
}
return 0;
}

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
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
const int INF = 0x3f3f3f3f;
int n, m, k;
int cas;
int mp[maxn][maxn];
void cg1(int x, int y) {
int t = mp[x][y];
mp[x][y] = mp[x][y + 1];
mp[x][y + 1] = mp[x + 1][y + 1];
mp[x + 1][y + 1] = mp[x + 1][y];
mp[x + 1][y] = t;
}
void cg2(int x, int y) {
int t = mp[x + 1][y];
mp[x + 1][y] = mp[x + 1][y + 1];
mp[x + 1][y + 1] = mp[x][y + 1];
mp[x][y + 1] = mp[x][y];
mp[x][y] = t;
}
int resum(int x, int y) {
return mp[x][y] + mp[x + 1][y] + mp[x][y + 1] + mp[x + 1][y + 1];
}
int dfs(int u) {
if(u > 2 * k)
return 0;
int ans = 0;
if(u & 1) {
ans = 0;
for(int i = 1; i <= 3; i ++) {
for(int j = 1; j <= 3; j ++) {
cg1(i, j);
ans = max(ans, dfs(u + 1) + resum(i, j));
cg2(i, j);
}
}
} else {
ans = INF;
for(int i = 1; i <= 3; i ++) {
for(int j = 1; j <= 3; j ++) {
cg1(i, j);
ans = min(ans, dfs(u + 1) + resum(i, j));
cg2(i, j);
}
}
}
return ans;
}
signed main() {
scanf("%d", &cas);
while(cas --) {
scanf("%d", &k);
for(int i = 1; i <= 4; i ++)
for(int j = 1; j <= 4; j ++)
scanf("%d", &mp[i][j]);
cout << dfs(1) << endl;
}
return 0;
}