Submission #432709

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int a[3][3],b[2][3],c[3][2];
int dfs(int k){
	if(k == 9){
		int ret = 0;
		rep(i,2)rep(j,3)if(a[i][j] == a[i+1][j])ret += b[i][j];
		rep(i,3)rep(j,2)if(a[i][j] == a[i][j+1])ret += c[i][j];
		return ret;
	}
	if(k%2 == 0){
		int ret = 0;
		rep(i,3){
			rep(j,3){
				if(a[i][j] == -1){
					a[i][j] = 0;
					ret = max ( ret , dfs(k+1) );
					a[i][j] = -1;
				}
			}
		}
		return ret;
	}
	else {
		int ret = INF;
		rep(i,3){
			rep(j,3){
				if(a[i][j] == -1){
					a[i][j] = 1;
					ret = min ( ret , dfs(k+1) );
					a[i][j] = -1;
				}
			}
		}
		return ret;
	}
}

int main(){
	int 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]; }
	rep(i,3)rep(j,3)a[i][j] = -1;
	int ans = dfs(0);
	printf("%d\n%d\n",ans,sum-ans);
}

Submission Info

Judge Result