Submission #432767

---

Source Code Expand

#include<bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

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

pi rec(int turn){
	
	if(turn == 9){
		int A = 0, B = 0;
		rep(i, 2) rep(j, 3){
			if(board[i][j] == board[i + 1][j]) A += b[i][j];
			else B += b[i][j];
		}
		rep(i, 3) rep(j, 2){
			if(board[i][j] == board[i][j + 1]) A += c[i][j];
			else B += c[i][j];
		}
		return mp(A, B);
	}
	
	pi best(-inf, -inf);
	
	rep(i, 3) rep(j, 3) if(board[i][j] == 0){
		
		board[i][j] = turn % 2 + 1;
		
		pi tmp = rec(turn + 1);
		
		board[i][j] = 0;
		
		if(turn % 2 == 0){
			if(best.first < tmp.first) best = tmp;
		}
		else{
			if(best.second < tmp.second) best = tmp;
		}
	}
	return best;
}

int main(){
	rep(i, 2) rep(j, 3) cin >> b[i][j];
	rep(i, 3) rep(j, 2) cin >> c[i][j];
	
	pi p = rec(0);
	cout << p.first << "\n" << p.second << endl;
	
	return 0;
}

Submission Info

Judge Result