Submission #4658622

---

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];
using P=pair<int,int>;
vector<P>dp(1<<10,{-1,-1});
int va[2][3],vb[3][2];
P calc()
{
  int p=0,q=0;
  int a=0;
  rep(i,3)rep(j,3)a+=(1<<(i*3+j))*flag[i][j];
  if(dp[a]!=make_pair(-1,-1))return dp[a];
  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]={p,q};
  //if(p==15&& q==80)cout<<" YES"<<endl;
  //cout<<p<<" "<<q<<endl;
  return {p,q};
}
vector<P> rec(int n=1)
{
  vector<P> resv;
  if(n==10)
  {
    resv.push_back(calc());
    return resv;
  }
  rep(i,3)rep(j,3)
  {
    if(flag[i][j]==-1)
    {
      if(n&1)
      {
        flag[i][j]=1;
        auto t=rec(n+1);
        for(auto ti:t)resv.push_back(ti);
        flag[i][j]=-1;
      }
      else
      {
        flag[i][j]=0;
        auto t=rec(n+1);
        for(auto ti:t)resv.push_back(ti);
        flag[i][j]=-1;
      }
    }
  }
  vector<P> ret;
  if(n&1)
  {
    auto maxp=-1;
    for(auto ti :resv)
    {
      if(ti.first>maxp)maxp=ti.first;
    }
    for(auto ti :resv)
    {
      if(ti.first==maxp)ret.push_back(ti);
    }
  }
  else
  {
    auto maxp=-1;
    for(auto ti :resv)
    {
      if(ti.second>maxp)maxp=ti.second;
    }
    for(auto ti :resv)
    {
      if(ti.second==maxp)ret.push_back(ti);
    }
  }
  ret.erase(unique(all(ret)),ret.end());
  return ret;
}


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();
  for(auto res:retv)
  {
  cout<<res.first<<endl;
  cout<<res.second<<endl;
  }
  return 0;

}

Submission Info

Judge Result