Submission #1128249

---

Source Code Expand

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


typedef vector<vector<int>> vii;
pair<int,int> dfs(int turn,vii &ban,vii& b,vii& c){
	if(turn==9){
		pair<int,int> res=make_pair(0,0);
		for(int i=0;i<2;i++){
			for(int j=0;j<3;j++){
				if(ban[i+1][j]==ban[i][j]){
					res.first+=b[i][j];
				}
				else{
					res.second+=b[i][j];
				}
			}
		}
		for(int i=0;i<3;i++){
			for(int j=0;j<2;j++){
				if(ban[i][j+1]==ban[i][j]){
					res.first+=c[i][j];
				}
				else{
					res.second+=c[i][j];
				}
			}

		}
		return res;

	}
	pair<int,int> res=make_pair(-1,-1);
	int score=-100;
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			if(ban[i][j]==-1){
				ban[i][j]=turn%2;
				auto ret=dfs(turn+1,ban,b,c);
				int sc;
				if(turn%2==0){
					sc=ret.first;
				}
				else{
					sc=ret.second;
				}
				if(sc>score){
					score=sc;
					res=ret;
				}
				ban[i][j]=-1;
			}
		}
	}
	return res;
}

int main(){
	vector<vector<int>> b(2,vector<int>(3));
	for(int i=0;i<2;i++){
		for(int j=0;j<3;j++)cin>>b[i][j];
	}
	vector<vector<int>> c(3,vector<int>(2));
	for(int i=0;i<3;i++){
		for(int j=0;j<2;j++)cin>>c[i][j];
	}
	vector<vector<int>> ban(3,vector<int>(3,-1));
	pair<int,int> res=dfs(0,ban,b,c);
	cout<<res.first<<endl;
	cout<<res.second<<endl;
	return 0;
}

Submission Info

Judge Result