Submission #1190208

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
typedef pair<int, int> P;
typedef long long ll;

int b[3][3], c[3][3];
int board[3][3];

int get_score() {
    int score = 0;
    rep(i,2) rep(j,3) {
        score += (board[i][j] == board[i+1][j] ? 1 : -1) * b[i][j];
    }
    rep(i,3) rep(j,2) {
        score += (board[i][j] == board[i][j+1] ? 1 : -1) * c[i][j];
    }
    return score;
}

int play(int turn) {
    if (turn >= 9) return get_score();
    if (turn%2==0) {
        int res=-1e8;
        rep(i,3) rep(j,3) {
            if (board[i][j] == -1) {
                board[i][j] = 1;
                res = max(res, play(turn+1));
                board[i][j] = -1;
            }
        }
        return res;
    }
    else {
        int res=1e8;
        rep(i,3) rep(j,3) {
            if (board[i][j] == -1) {
                board[i][j] = 0;
                res = min(res, play(turn+1));
                board[i][j] = -1;
            }
        }
        return res;
    }
}

int main() {
    int sum = 0;
    rep(i,2) rep(j,3) {
        cin >> b[i][j];
        sum += b[i][j];
    }
    rep(i,3) rep(j,2) {
        cin >> c[i][j];
        sum += c[i][j];
    }
    rep(i,3) rep(j,3) board[i][j] = -1;
    int ans = play(0);
    cout << (sum+ans)/2 << endl;
    cout << (sum-ans)/2 << endl;
}

Submission Info

Judge Result