Submission #1625431

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
using namespace std;
//---------------------------------------------------
//ライブラリゾーン！！！！
#define int long long
#define str string
#define rep(i,j) for(int i=0;i<(int)(j);i++)
typedef long long ll;
typedef long double ld;
const ll inf = 4523372036854775807;
const int inf2 = 1145141919;
const ld pi = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899;
struct P {
	ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {//隣接リスト表現
	ll to, cost;
};
struct S {//辺の情報を入れる変数
	int from, to, cost;
};
bool operator<(S a, S b) { return a.cost < b.cost; }
bool operator>(S a, S b) { return a.cost > b.cost; }
struct H {
	int x, y;
};
ll gcm(ll i, ll j) {//最大公約数
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcm(j%i, i);
}
ld rad(ld a, ld b, ld c, ld d) {
	return sqrt(pow(a - c, 2) + pow(b - d, 2));
}//rad＝座標上の2点間の距離
 //---------------------------------------------------
 //+++++++++++++++++++++++++++++++++++++++++++++++++++
int b[3][3], c[3][3];
struct A {
	int a, b;
};
bool operator+(A a, A b) { return  a.a + b.a, a.b + b.b ; }
short a[3][3];
A solve(int x) {
	if (x == 9) {
		A d = A{ 0,0 };
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < 3; j++) {
				if (a[i][j] == a[i + 1][j])
					d.a += b[i][j];
				else
					d.b += b[i][j];
			}
		}
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 2; j++) {
				if (a[i][j] == a[i][j + 1])
					d.a += c[i][j];
				else
					d.b += c[i][j];
			}
		}
		return d;
	}
	A d = A{ 0,0 };
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			if (!a[i][j]) {
				if (x % 2 == 0) {//ちょくだい
					a[i][j] = 1;
					A e = solve(x + 1);
					a[i][j] = 0;
					if (e.a > d.a) 
						d = e;
				}
				else {//ちょく子
					a[i][j] = 2;
					A e = solve(x + 1);
					a[i][j] = 0;
					if (e.b > d.b)
						d = e;
				}
			}
		}
	}
	return d;
}
signed main() {
	for (int i = 0; i < 2; i++) 
		for (int j = 0; j < 3; j++)
			cin >> b[i][j];
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 2; j++)
			cin >> c[i][j];
	cout << solve(0).a<<"\n"<<solve(0).b << endl;
	getchar(); getchar();
}

Submission Info

Judge Result