Submission #4032912

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)

int B[2][3];
int C[3][2];

typedef struct tokuten{
    int t;
    int n;
}toku;

toku dfs(bool tyo, int state[3][3], int round){
    toku ret = {0, 0};
    if(round == 9) {
        REP(i,2) 
            REP(j,3){
                if(state[i][j] == state[i+1][j]) ret.t += B[i][j];
                else ret.n += B[i][j];
            }
        REP(i,3) 
            REP(j,2){
                if(state[i][j] == state[i][j+1]) ret.t += C[i][j];
                else ret.n += C[i][j];
            }
    }
    else{
        int num = -1;
        for(int i = 0; i < 3; i++){
            for(int j = 0; j < 3; j++){
                if(state[i][j] != 0) continue;
                int tmp[3][3];
                REP(s,3) REP(t,3) tmp[s][t] = state[s][t];
                tmp[i][j] = tyo ? 1 : -1;
                toku x = dfs(!tyo, tmp, round+1);
                int val;
                if(tyo) val = x.t;
                else val = x.n;
                if(val > num){
                    num = val;
                    ret = x;
                }
            }
        }
    }
    return ret;
}

int main(){
    REP(i,2){
        REP(j,3){
            cin >> B[i][j];
        }
    }
    REP(i,3){
        REP(j,2){
            cin >> C[i][j];
        }
    }

    toku ans;
    int state[3][3];
    REP(s,3) REP(t,3) state[s][t] = 0;
    ans = dfs(true, state, 0);
    cout << ans.t << endl;
    cout << ans.n << endl;
    return 0;
}

Submission Info

Judge Result