Submission #3730344

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223372036854775807LL
using ll = long long;
template<typename T>
using vec = vector<T>;
using P = pair<ll, ll>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
	fill((T *)array, (T *)(array + N), val);
}

const ll INF = 1e16;
const ll MOD = 1e9 + 7;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//ll pas[51][52];

ll b[2][3] ,c[3][2];
ll solve(bool C,int used[3][3]){
	ll M = -114514,m = 114514;
	bool ok = true;
	REP(i,3)REP(j,3){
		int unko[3][3] = {};
		REP(i,3)REP(j,3)unko[i][j] = used[i][j];
		if(used[i][j] == 0){
			ok = false;
			if(C)unko[i][j] = 1;
			else unko[i][j] = 2;
			ll tmp = solve(!C,unko);
			M = max(tmp,M);
			m = min(tmp,m);
		}
	}
	if(!ok){
		return (C ? M : m);
	}
	else{
		ll dif = 0;
		REP(i,2)REP(j,3){
			if(used[i][j] == used[i + 1][j])dif += b[i][j];
			else dif -= b[i][j];
		}
		REP(i,3)REP(j,2){
			if(used[i][j] == used[i][j + 1])dif += c[i][j];
			else dif -= c[i][j];
		}
		return dif;
	}
}

signed main(){
	IOS;
	ll sum = 0;
	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 used[3][3] = {};
	ll dif = solve(true,used);
	cout << (sum + dif) / 2 << endl;
	cout << (sum - dif) / 2 << endl;
}

Submission Info

Judge Result