Submission #4659090

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(x) (x).begin(),(x).end()

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

typedef long long ll;

using namespace std;
int flag[3][3];
vector<vector<int>>dp(1<<10,vector<int>(2,-1));
int va[2][3],vb[3][2];
vector<int> calc()
{
  int a=0;
  rep(i,3)rep(j,3)a+=(1<<(i*3+j))*flag[i][j];
  if(dp[a][0]>-1)return dp[a];
  int p=0,q=0;
  rep(i,2)rep(j,3)
  {
    if(flag[i][j]==flag[i+1][j])p+=va[i][j];
    else q+=va[i][j];
  }
  rep(i,3)rep(j,2)
  {
    if(flag[i][j]==flag[i][j+1])p+=vb[i][j];
    else q+=vb[i][j];
  }
  dp[a]={q,p};
  return {q,p};
}
vector<int> rec(int n=1)
{
  vector<int> res={-1,-1};
  if(n==10)return calc();
  int idx=n&1;
  rep(i,3)rep(j,3)
  {
    if(flag[i][j]==-1)
    {
      flag[i][j]=idx;
      auto t=rec(n+1);
      if(t[idx]>res[idx])res=t;
      flag[i][j]=-1;
    }
  }
  return res;
}


int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  rep(i,3)rep(j,3)flag[i][j]=-1;
  rep(i,2)rep(j,3)cin>>va[i][j];
  rep(i,3)rep(j,2)cin>>vb[i][j];
  auto retv=rec();
  cout<<retv[1]<<endl;
  cout<<retv[0]<<endl;
  return 0;

}

Submission Info

Judge Result