Submission #3974693

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())

const int IINF = 1e9 + 10;
const long long LLINF = (long long)1e18 + 10;
const long long MOD = (long long)1e9 + 7;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

int b[2][3], c[3][2];
vector< vector<int> > mp(3, vector<int>(3, -1));

int solve(int turn){
    int res = 0;
    if(turn == 9){
        rep(i, 2){
            rep(j, 3){
                if(mp[i][j] == mp[i + 1][j]){
                    res += b[i][j];
                }else{
                    res -= b[i][j];
                }
            }
        }
        rep(i, 3){
            rep(j, 2){
                if(mp[i][j] == mp[i][j + 1]){
                    res += c[i][j];
                }else{
                    res -= c[i][j];
                }
            }
        }
        return res;
    }
    if(turn % 2 == 0){
        res = -IINF;
    }else{
        res = IINF;
    }
    rep(i, 9){
        int y = i / 3, x = i % 3;
        if(mp[y][x] == -1){
            mp[y][x] = turn % 2;
            if(turn % 2 == 0){
                res = max(res, solve(turn + 1));
            }else{
                res = min(res, solve(turn + 1));
            }
            mp[y][x] = -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];
        }
    }
    int val = solve(0);
    cout << (sum + val) / 2 << endl << (sum - val) / 2 << endl;
    return 0;
}

// a + b = sum
// a - b = val
// 2a = sum + val
// 2b = sum - val

Submission Info

Judge Result