Submission #3975141

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
/* clang-format on */

const int INF = 1 << 28;

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

int score() {
  int s = 0;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 3; j++)
      s += b[i][j] * (a[i][j] == a[i + 1][j] ? 1 : -1);
  for (int i = 0; i < 3; i++)
    for (int j = 0; j < 2; j++)
      s += c[i][j] * (a[i][j] == a[i][j + 1] ? 1 : -1);
  return s;
}

int dfs(int turn = 0) {
  if (turn == 9)
    return -score();
  int res = -INF;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (a[i][j] == 0) {
        a[i][j] = turn % 2 + 1;
        res = max(res, -dfs(turn + 1));
        a[i][j] = 0;
      }
    }
  }
  return res;
}

int main() {
  int s = 0;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 3; j++) cin >> b[i][j], s += b[i][j];
  for (int i = 0; i < 3; i++)
    for (int j = 0; j < 2; j++) cin >> c[i][j], s += c[i][j];
  int d = dfs();
  int x = (s + d) / 2;
  int y = s - x;
  cout << x << endl;
  cout << y << endl;
  return 0;
}

Submission Info

Judge Result