Submission #4635281

---

Source Code Expand

#include <iostream>
#include <climits>
#include <algorithm>
#include <vector>
#include <tuple>
using namespace std;
typedef long long ll;

int b[2][3],c[3][2];
int table[3][3];

tuple<int,int> calc(){
	int sum1=0,sum2=0;
	for(int i=0;i<3;i++){
		for(int j=0;j<2;j++){
			if((table[j][i]==1 && table[j+1][i]==1)  ||  (table[j][i]==2 && table[j+1][i]==2)){
				sum1+=b[j][i];
			}else{
				sum2+=b[j][i];
			}
		}
	}
	for(int i=0;i<3;i++){
		for(int j=0;j<2;j++){
			if((table[i][j]==1 && table[i][j+1]==1)  ||  (table[i][j]==2 && table[i][j+1]==2)){
				sum1+=c[i][j];
			}else{
				sum2+=c[i][j];
			}
		}
	}
	return forward_as_tuple(sum1,sum2);
}

tuple<int,int> dfs(int turn){
	int res=INT_MIN,x,y,re1,re2,choku,naoko;
	if(turn==10){
		tie(choku,naoko)=calc();
		return forward_as_tuple(choku,naoko); 
	}
	if(turn%2==1){//ちょくだい(1)
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				if(table[i][j]!=0) continue;
				table[i][j]=1;
				tie(x,y)=dfs(turn+1);
				if(x-y>res){
					res=x-y;
					re1=x;
					re2=y;
				}
				table[i][j]=0;
			}
		}
	}
	if(turn%2==0){//なおこ(2)
		for(int i=0;i<3;i++){
			for(int j=0;j<3;j++){
				if(table[i][j]!=0) continue;
				table[i][j]=2;
				tie(x,y)=dfs(turn+1);
				if(y-x>res){
					res=y-x;
					re1=x;
					re2=y;
				}
				table[i][j]=0;
			}
		}
	}
	return forward_as_tuple(re1,re2);
}

int main(){
	for(int i=0;i<3;i++){
		for(int j=0;j<3;j++){
			table[i][j]=0;
		}
	}
	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];
		}
	}
	int ans1,ans2;
	tie(ans1,ans2)=dfs(1);
	cout<<ans1<<endl<<ans2<<endl;
    return 0;
}

Submission Info

Judge Result