Submission #3974794

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define p_ary(ary,a,b,i) do { cout << "["; for (int i = a;i < b;++i) cout << ary[i] << (b-1 == i ? "]\n" : ", "); } while(0)
#define p_map(map,it) do {cout << "{";for (auto it = map.begin();;++it) {if (it == map.end()) {cout << "}\n";break;}else cout << "" << it->first << "=>" << it->second << ", ";}}while(0)

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

int rec(int cnt,int used,int s) {
    if (cnt == 9) {
        int ret = 0;
        for (int i = 0;i < 2;++i) for (int j = 0;j < 3;++j) if (((s>>(i*3+j))&1) == ((s>>(i*3+j+3))&1)) ret += b[i][j];
        for (int i = 0;i < 3;++i) for (int j = 0;j < 2;++j) if (((s>>(i*3+j))&1) == ((s>>(i*3+j+1))&1)) ret += c[i][j];
        return ret;
    } else {
        if (cnt&1) {
            int ret = 10000,temp = 0;
            for (int i = 0;i < 9;++i) if (!(used&(1<<i))) {
                temp = rec(cnt+1,used^(1<<i),s^(1<<i));
                ret = min(ret,temp);
            }
            return ret;
        } else {
            int ret = 0,temp = 0;
            for (int i = 0;i < 9;++i) if (!(used&(1<<i))) {
                temp = rec(cnt+1,used^(1<<i),s);
                ret = max(ret,temp);
            }
            return ret;
        }
    }
}

int main() {
    for (int i = 0;i < 2;++i) for (int j = 0;j < 3;++j) cin >> b[i][j];
    for (int i = 0;i < 3;++i) for (int j = 0;j < 2;++j) cin >> c[i][j];
    int a = rec(0,0,0),sum = 0;
    for (int i = 0;i < 2;++i) for (int j = 0;j < 3;++j) sum += b[i][j];
    for (int i = 0;i < 3;++i) for (int j = 0;j < 2;++j) sum += c[i][j];
    cout << a << "\n" << sum-a << "\n";
    return 0;
}

Submission Info

Judge Result