DFS CCPC2017 南宁I题

The designers have come up with a new simple game called “Rake It In”. Two players, Alice and Bob, initially select an integer k and initialize a score indicator. An 4 \times 44×4 board is created with 16 values placed on the board. Starting with player Alice, each player in a round selects a 2 \times 22×2 region of the board, adding the sum of values in the region to the score indicator, and then rotating these four values 9090 degrees counterclockwise.

After 22k rounds in total, each player has made decision in k times. The ultimate goal of Alice is to maximize the final score. However for Bob, his goal is to minimize the final score.

In order to test how good this game is, you are hired to write a program which can play the game. Specifically, given the starting configuration, they would like a program to determine the final score when both players are entirely rational.

Input

The input contains several test cases and the first line provides an integer t (1 \le t \le 200)t(1≤t≤200)which is the number of test cases.

Each case contains five lines. The first line provides the integer k (1 \le k \le 3)k(1≤k≤3). Each of the following four lines contains four integers indicating the values on the board initially. All values are integers between 11 to 1010.

Output

For each case, output an integer in a line which is the predicted final score.

样例输入

4
1
1 1 2 2
1 1 2 2
3 3 4 4
3 3 4 4
2
1 2 3 4
1 2 3 4
1 2 3 4
1 2 3 4
3
1 1 4 4
4 4 1 1
1 1 4 4
1 4 1 4
3
1 2 3 4
5 1 2 3
4 5 1 2
3 4 5 1

样例输出复制

20
40
63
71

之前搜有大佬说需要用到alpha-beta剪枝，但是数据范围非常小，似乎不需要

还是贴个链接吧，如果有需要的可以看看https://blog.csdn.net/qq_27008079/article/details/60869054

暴力DFS，回溯，感觉没太多好讲的

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 const double pi=acos(-);
 const int mod=1e9+;
 const int inf=<<;
 const int maxn=1e5+;
 int a[][];
 int k;
 int val(int i,int j){
     return a[i][j]+a[i+][j]+a[i][j+]+a[i+][j+];
 }
 void rotat(int i,int j){
     int a1=a[i][j],a2=a[i][j+],a3=a[i+][j],a4=a[i+][j+];
     a[i][j]=a2,a[i][j+]=a4,a[i+][j]=a1,a[i+][j+]=a3;
 }
 void retat(int i,int j){
     int a1=a[i][j],a2=a[i][j+],a3=a[i+][j],a4=a[i+][j+];
     a[i][j]=a3,a[i][j+]=a1,a[i+][j]=a4,a[i+][j+]=a2;
 }
 int dfs(int t){
     int ans;
     if(t==*k-){
         ans=inf;
         for(int i=;i<;i++)
         for(int j=;j<;j++)
         ans=min(ans,val(i,j));
         return ans;
     }
     else if(t%==){
         ans=;
         for(int i=;i<;i++)
         for(int j=;j<;j++){
             rotat(i,j);
             int tmp=val(i,j);
             ans=max(ans,tmp+dfs(t+));
             retat(i,j);
         }
     }
     else{
         ans=inf;
         for(int i=;i<;i++)
         for(int j=;j<;j++){
             rotat(i,j);
             int tmp=val(i,j);
             ans=min(ans,tmp+dfs(t+));
             retat(i,j);
         }
     }
     return ans;
 }
 int main(){
     int T;scanf("%d",&T);
     while(T--){
         scanf("%d",&k);
         for(int i=;i<;i++){
             for(int j=;j<;j++){
                 scanf("%d",&a[i][j]);
             }
         }
         cout<<dfs()<<endl;
     }
     return ;
 }