Submission #1590223

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int b[2][3], c[3][2], total = 0;
int a[3][3];

int calc(void) {
  int M = 0, W = 0;
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 3; j++) {
      if (a[i][j] == a[i + 1][j]) {
        M += b[i][j];
      } else {
        W += b[i][j];
      }
    }
  }
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 2; j++) {
      if (a[i][j] == a[i][j + 1]) {
        M += c[i][j];
      } else {
        W += c[i][j];
      }
    }
  }
  return M - W;
}

int dfs(int s) {
  if (s == 9) return calc();

  int res = s & 1 ? 1e9 : -1e9;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (a[i][j]) continue;
      if (s & 1) {
        a[i][j] = -1;
        res = min(res, dfs(s + 1));
      } else {
        a[i][j] = 1;
        res = max(res, dfs(s + 1));
      }
      a[i][j] = 0;
    }
  }

  return res;
}

int main(void) {
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 3; j++) {
      cin >> b[i][j];
      total += b[i][j];
    }
  }
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 2; j++) {
      cin >> c[i][j];
      total += c[i][j];
    }
  }

  int score = dfs(0);
  cout << (total + score) / 2 << endl;
  cout << (total - score) / 2 << endl;

  return 0;
}

Submission Info

Judge Result