Submission #4036742

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
const int INF=1e9+7;
int b[2][3],c[3][2];
int v[3][3];
int dfs(int p){
    if(p==9){
        int s=0;
        REP(i,2)REP(j,3)s+=(1+v[i][j]*v[i+1][j])*b[i][j]+(1+v[j][i]*v[j][i+1])*c[j][i];
        return s/2;
    }
    int tmp=(p%2)*INF;
    REP(i,3)REP(j,3){
        if(v[i][j])continue;
        v[i][j]=1-2*(p%2);
        if(p%2)tmp=min(tmp,dfs(p+1));
        else tmp=max(tmp,dfs(p+1));
        v[i][j]=0;
    }
    return tmp;
}
int main(){
    int s=0;
    REP(i,2)REP(j,3){
        cin>>b[i][j];
        s+=b[i][j];
    }
    REP(i,3)REP(j,2){
        cin>>c[i][j];
        s+=c[i][j];
    }
    int a=dfs(0);
    cout<<a<<endl;
    cout<<s-a<<endl;
}

Submission Info

Judge Result