Submission #4651257

---

Source Code Expand

#include"bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const long long mod = 1000000007;
const long long inf = 11451419198109130;
typedef pair<int, int> P;
typedef pair<P, int> PP;
typedef pair<int, PP> PPP;
struct edge { int to; int to2; int cost; };

int b[2][3], c[3][2];
int let[3][3];
int A, B;

int score() {
	int D = 0, K = 0;
	rep(i, 2) {
		rep(j, 3) {
			if (let[i][j] == let[i + 1][j])D += b[i][j];
			else K += b[i][j];
		}
	}
	rep(i, 3) {
		rep(j, 2) {
			if (let[i][j] == let[i][j + 1])D += c[i][j];
			else K += c[i][j];
		}
	}
	return D - K;
}

int dfs() {
	int fil = 0;
	rep(i, 3)rep(j, 3)if (let[i][j])fil++;
	
	if (fil == 9) {
		int D = 0, K = 0;
		rep(i, 2) {
			rep(j, 3) {
				if (let[i][j] == let[i + 1][j])D += b[i][j];
				else K += b[i][j];
			}
		}
		rep(i, 3) {
			rep(j, 2) {
				if (let[i][j] == let[i][j + 1])D += c[i][j];
				else K += c[i][j];
			}
		}
		return D-K;
	}
	else {
		int ans;
		if (fil & 1)ans = -inf;
		else ans = inf;
		rep(i, 3) {
			rep(j, 3) {
				if (!let[i][j]) {
					if (fil & 1) {
						let[i][j] = 1;
						ans = max(ans, dfs());
					}
					else {
						let[i][j] = -1;
						ans = min(ans, dfs());
					}
					let[i][j] = 0;
				}
			}
		}
		return ans;
	}
}

signed main() {
	rep(i, 2)rep(j, 3)cin >> b[i][j];
	rep(i, 3)rep(j, 2)cin >> c[i][j];
	int x = dfs();
	rep(i, 2)rep(j, 3)B += b[i][j];
	rep(i, 3)rep(j, 2)B += c[i][j];
	cout << (B + x) / 2 << endl << (B - x) / 2 << endl;;
}

Submission Info

Judge Result