Submission #1305106

---

Source Code Expand

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

#define first  fs
#define second se
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)

using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;

const int inf = 1001001001;
const lint linf = 1001001001001001001ll;
const int mod = 1e9 + 7;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};

template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } return a > b; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } return a < b; }
template<typename T> inline void print(const T &x, char s = '\n') { cout << x << s; }
template<typename T> inline void print(const vector<T> &v, string s = " ") 
{ rep(i, v.size()) cout << v[i] << (i + 1 == v.size() ? "\n" : s); }
inline bool inside(int y, int x, int H, int W) { return 0 <= y && y < H && 0 <= x && x < W; }
inline lint in() { lint x; std::cin>>x; return x; }

int sum = 0;
int b[2][3];
int c[3][2];

int beet[3][3];

int dfs(int depth = 0) {
	if (depth == 9) {
		int ret = 0;
		rep(i, 2) rep(j, 3) {
			if (beet[i][j] == beet[i + 1][j]) {
				ret += b[i][j];
			}
		}
		rep(i, 3) rep(j, 2) {
			if (beet[i][j] == beet[i][j + 1]) {
				ret += c[i][j];
			}
		}

		return ret;
	}

	int ret = (depth % 2 ? inf : 0);
	rep(i, 3) rep(j, 3) {
		if (~beet[i][j]) continue;

		beet[i][j] = depth % 2;
		int v = dfs(depth + 1);
		beet[i][j] = -1;

		if (depth % 2) {
			chmin(ret, v);
		} else {
			chmax(ret, v);
		}
	}

	return ret;
}

int main() {
	rep(i, 3) rep(j, 3) beet[i][j] = -1;
	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 ans = dfs();

	print(ans);
	print(sum - ans);
}

Submission Info

Judge Result