Submission #433926

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <bitset>

using namespace std;

typedef pair<int, int> pos;
struct ten {
	int bd[3][3];
};
struct ans {
	int ten[2];
	int bd[3][3];
	int te;
};

ten b, c;

ans cao(ans aaa);

int main(){
	for ( int x = 0; x < 3; x++ )
		for ( int y = 0; y < 2; y++ ){
			int b_;
			cin >> b_;
			b.bd[x][y] = b_;
		}
	for ( int x = 0; x < 3; x++ )
		for ( int y = 0; y < 2; y++ ){
			int c_;
			cin >> c_;
			c.bd[x][y] = c_;
		}
	ans answer;
	answer.ten[0] = 0;
	answer.ten[1] = 0;
	for ( int x = 0; x < 3; x++ )
		for ( int y = 0; y < 3; y++ )
			answer.bd[x][y] = -1;
	answer.te = 0;
	answer = cao(answer);
	cout << answer.ten[0] << endl << answer.ten[1] << endl;
	return 0;
}

ans cao(ans a){
	ans max = a;
	a.te++;
	for ( int x = 0; x < 3; x++ )
		for ( int y = 0; y < 3; y++ )
		{
			int player = a.te % 2;
			if ( a.bd[x][y] == -1 ){
				for ( int i = 0; i < 2; i++ )
				{
					ans temp = a;
					temp.te++;
					temp.bd[x][y] = i;
					if ( y < 2 ){
						if ( temp.bd[x][y] == temp.bd[x][y + 1] )
							temp.ten[0] += b.bd[x][y];
						else
							temp.ten[1] += b.bd[x][y];
					}
					if ( x < 2 ){
						if ( temp.bd[x][y] == temp.bd[x + 1][y] )
							temp.ten[0] += c.bd[x][y];
						else
							temp.ten[1] += c.bd[x][y];
					}
					temp = cao(temp);
					if ( temp.ten[player] > max.ten[player] )max = temp;
				}
			}
		}
	return max;
}//´・ω・｀

Submission Info

Judge Result