Submission #433739

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define loop for(;;)
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;
#define inf (1e9)
#define eps (1e-9)
using Integer = long long;
using Real = long double;
const Real PI = acos(-1);

template<class S, class T> inline
ostream& operator<<(ostream&os, pair<S,T> p) {
  return os << '(' << p.first << ", " << p.second << ')';
}

template<class S, class T, class U> inline
ostream& operator<<(ostream&os, tuple<S,T,U> t) {
  return os << '('
    << get<0>(t) << ", "
    << get<1>(t) << ", "
    << get<2>(t) << ')';
}

template<class T> inline
ostream& operator<<(ostream&os, vector<T> v) {
  if (v.size() == 0) { return os << "(empty)"; }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

template<class T> inline
istream& operator>>(istream&is, vector<T>&v) {
  rep (i, v.size()) is >> v[i];
  return is;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = {  0, -1, 0, 1 };

using vi = vector<int>;
using vvi = vector<vi>;

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

bool eq(int x, int y) {
  return (x != 0) and (x == y);
}

bool ne(int x, int y) {
  return (x * y == 2);
}

pair<int, int> score() {
  int x = 0;
  int y = 0;
  rep (i, 2) rep (j, 3) {
    if (eq(a[i][j], a[i+1][j])) x += b[i][j];
    else if (ne(a[i][j], a[i+1][j])) y += b[i][j];
  }
  rep (i, 3) rep (j, 2) {
    if (eq(a[i][j], a[i][j+1])) x += c[i][j];
    else if (ne(a[i][j], a[i][j+1])) y += c[i][j];
  }
  return {x,y};
}

pair<int, int> f(int mark, int cx) {
  vector<pair<int, int>> ar;
  rep (i, 3) rep (j, 3) {
    if (a[i][j] == 0) ar.push_back({ i, j });
  }
  if (ar.size() == 0) return score();

  pair<int, int> ac = { -1e7, -1e7 };

  for (auto&x: ar) {
    a[x.first][x.second] = mark;
    auto p = f(3-mark, cx+1);

    if (
        ((mark == 1) and (ac.first < p.first))
          or
        ((mark == 2) and (ac.second < p.second))
       ) {
      ac = p;
    }

    a[x.first][x.second] = 0;
  }

  return ac;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.setf(ios::fixed);
  cout.precision(10);
  random_device dev;
  mt19937 rand(dev());

  rep (i, 2) rep (j, 3)
    cin >> b[i][j];
  rep (i, 3) rep (j, 2)
    cin >> c[i][j];

  rep (i, 3) rep (j, 3)
    a[i][j] = 0;

  auto p = f(1, 0);
  cout << p.first << endl;
  cout << p.second << endl;

  return 0;
}

Submission Info

Judge Result