Submission #3974654

---

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];

P my_max(P a, P b, int type){
    if(type == 0){
        return a.first == b.first ? a.second < b.second ? a : b : a.first < b.first ? b : a;
    }else{
        return a.second == b.second ? a.first < b.first ? a : b : a.second < b.second ? b : a;
    }
}

P solve(vector< vector<int> > mp, int turn){
    P res = {0, 0};
    if(turn == 9){
        rep(i, 2){
            rep(j, 3){
                if(mp[i][j] == mp[i + 1][j]){
                    res.first += b[i][j];
                }else{
                    res.second += b[i][j];
                }
            }
        }
        rep(i, 3){
            rep(j, 2){
                if(mp[i][j] == mp[i][j + 1]){
                    res.first += c[i][j];
                }else{
                    res.second += c[i][j];
                }
            }
        }
        return res;
    }
    rep(i, 9){
        int y = i / 3, x = i % 3;
        if(mp[y][x] == -1){
            mp[y][x] = turn % 2;
            res = my_max(res, solve(mp, turn + 1), turn % 2);
            mp[y][x] = -1;
        }
    }
    return res;
}

int main(){
    rep(i, 2){
        rep(j, 3){
            cin >> b[i][j];
        }
    }
    rep(i, 3){
        rep(j, 2){
            cin >> c[i][j];
        }
    }
    vector< vector<int> > mp(3, vector<int>(3, -1));
    P ans = solve(mp, 0);
    cout << ans.first << endl << ans.second << endl;
    return 0;
}

Submission Info

Judge Result