Submission #1672704

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <vector>
#include <assert.h>
#include <algorithm>
using namespace std;

#define REP(i,a,b) for(int i = a; i < (int)b;i++)
#define rep(i, n) REP(i,0,n)
int B[2][3], C[3][2];
int board[3][3];

pair<int, int> dfs(bool is_man, int cnt) {
  if (cnt == 9) {
    int man = 0, woman = 0;
    rep(i, 2) rep(j, 3) {
      (board[i][j] == board[i + 1][j] ? man : woman) += B[i][j];
    }
    rep(i, 3) rep(j, 2) {
      (board[i][j] == board[i][j + 1] ? man : woman) += C[i][j];
    }
    return {man, woman};
  }

  pair<int, int> ret;
  rep(i, 3) rep(j, 3) {
    if (board[i][j] == -1) {
      board[i][j] = is_man;
      auto r = dfs(!is_man, cnt + 1);
      bool cond = is_man ?
        ret.first < r.first : ret.second < r.second;
      if (cond) {
        ret = r;
      }
      board[i][j] = -1;
    }
  }
  return ret;
}

int main() {
  rep(i, 3) rep(j, 3) board[i][j] = -1;
  rep(i, 2) rep(j, 3) cin >> B[i][j];
  rep(i, 3) rep(j, 2) cin >> C[i][j];
  auto r = dfs(true, 0);
  std::cout << r.first << "\n" << r.second << "\n";
}

Submission Info

Judge Result