Submission #2116139

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007

int b[6],c[6];
int board[9];
const int INF=INT_MAX/2;

int solve(bool T){
  bool flag=1;
  for(int i=0;i<9;i++){
    if(board[i]==0) flag=0;
  }
  if(flag){
    int res=0;
    for(int i=0;i<6;i++){
      if(board[i]==board[i+3]){
        res+=b[i];
      }else{
        res-=b[i];
      }
    }
    for(int i=0;i<9;i+=3){
      for(int j=0;j<2;j++){
        if(board[i+j]==board[i+j+1]){
          res+=c[(i/3)*2+j];
        }else{
          res-=c[(i/3)*2+j];
        }
      }
    }
    return res;
  }
  int ans;
  if(T) ans=-INF;
  else ans=INF;
  for(int i=0;i<9;i++){
    if(board[i]==0){
      if(T){
        board[i]=1;
        ans=max(ans,solve(0));
        board[i]=0;
      }else{
        board[i]=2;
        ans=min(ans,solve(1));
        board[i]=0;
      }
    }
  }
  return ans;
}

int main(){
  for(int i=0;i<6;i++) cin>>b[i];
  for(int i=0;i<6;i++) cin>>c[i];
  for(int i=0;i<9;i++) board[i]=0;
  int ans=-INF;
  for(int i=0;i<9;i++){
    board[i]=1;
    ans=max(ans,solve(0));
    board[i]=0;
  }
  int sum=0;
  for(int i=0;i<6;i++) sum+=b[i];
  for(int i=0;i<6;i++) sum+=c[i];
  cout<<(sum+ans)/2<<endl;
  cout<<(sum-ans)/2<<endl;
  return 0;
}

Submission Info

Judge Result