2017 ICPC Naning Rake It In

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
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<queue>
#include<map>
#include<vector>
#include<set>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<stack>

typedef long long ll;
const ll mod = 1000000007;
const int inf = unsigned(-1) >> 2;
const int maxn = 1e5 + 5;

using namespace std;

int sum, winx, winy;
int k;
int Map[5][5];

int rote(int x, int y)
{
    swap(Map[x][y], Map[x + 1][y]);
    swap(Map[x][y + 1], Map[x + 1][y + 1]);
    swap(Map[x][y], Map[x + 1][y + 1]);
    return Map[x][y] + Map[x + 1][y] + Map[x][y + 1] + Map[x + 1][y + 1];
}

void rerote(int x, int y)
{
    swap(Map[x][y], Map[x + 1][y + 1]);
    swap(Map[x][y + 1], Map[x + 1][y + 1]);
    swap(Map[x][y], Map[x + 1][y]);
}

int DFS(int sum, int dep, int alpha, int beta)
{
    if(dep == 2 * k)
    {
        return sum;
    }

    for(int i = 0; i < 3; i++)
    {
        for(int j = 0; j < 3; j++)
        {
            int tmp = DFS(sum + rote(i, j), dep + 1, alpha, beta);
            rerote(i, j);
            if(dep & 1)
                beta = min(beta, tmp);
            else
                alpha = max(alpha, tmp);
            if(beta <= alpha)
                return dep & 1 ? beta : alpha;
        }
    }
    return dep & 1 ? beta : alpha;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t;
    cin >> t;
    while(t--)
    {
        cin >> k;
        for(int i = 0; i < 4; i++)
        {
            for(int j = 0; j < 4; j++)
            {
                cin >> Map[i][j];
            }
        }
        cout << DFS(sum, 0, -inf, inf) << endl;
    }

    return 0;
}