Submission #2215664

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define INF 1000000000
#define INFL 10000000000000000LL
#define pb push_back
#define ll long long int

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

int solve(int d){
  if(d == 9){
    int res = 0;
    REP(i, 2){
      REP(j, 3){
        if(brd[i][j] == brd[i+1][j]) res += b[i][j];
        else res -= b[i][j];
      }
    }
    REP(i, 3){
      REP(j, 2){
        if(brd[i][j] == brd[i][j+1]) res += c[i][j];
        else res -= c[i][j];
      }
    }
    return res;
  }
  else{
    if(d%2 == 0){
      int mx = -1000000;
      REP(i, 3){
        REP(j, 3){
          if(brd[i][j] == 0){
            brd[i][j] = 1;
            mx = max(mx, solve(d+1));
            brd[i][j] = 0;
          }
        }
      }
      return mx;
    }
    else{
      int mn = 1000000;
      REP(i, 3){
        REP(j, 3){
          if(brd[i][j] == 0){
            brd[i][j] = -1;
            mn = min(mn, solve(d+1));
            brd[i][j] = 0;
          }
        }
      }
      return mn;
    }
  }
}

int main() {
  REP(i, 3)REP(j, 3)brd[i][j] = 0;
  int sum = 0;
  REP(i, 2){
    cin >> b[i][0] >> b[i][1] >> b[i][2];
    sum += b[i][0] + b[i][1] + b[i][2];
  }
  REP(i, 3){
    cin >> c[i][0] >> c[i][1];
    sum += c[i][0] + c[i][1];
  }
  int d = solve(0);
  cout << (sum+d)/2 << endl << (sum-d)/2 << endl;
}

Submission Info

Judge Result