Submission #1752049

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}

vvi v(3,vi(3,-1));
int b[2][3],c[3][2],sum=0;
int dfs(int d,int player){
	if(d==0){
		int tmp=0;
		rep(i,2)rep(j,3){
			if(v[i][j]==v[i+1][j]){
				tmp+=b[i][j];
			}
		}
		rep(i,3)rep(j,2){
			if(v[i][j]==v[i][j+1]){
				tmp+=c[i][j];
			}
		}
		return tmp;
	}
	vi score;
	rep(i,3){
		rep(j,3){
			if(v[i][j]!=-1)continue;
			v[i][j]=player;
			score.pb(dfs(d-1,!player));
			v[i][j]=-1;
		}
	}
	if(player==0)
		return *max_element(ALL(score));
	else
		return *min_element(ALL(score));

}
int main(){
	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 res=dfs(9,0);
	cout<<res<<endl<<sum-res<<endl;
	return 0;
}

Submission Info

Judge Result