Submission #432754

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cassert>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <complex>
#include <random>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

struct B {
    int d[3][3];
};

int p1[3][3], p2[3][3];
int sm;

int calc(B b) {
    int re = 0;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 3; j++) {
            if (b.d[i][j] == b.d[i+1][j]) {
                re += p1[i][j];
            }
        }
    }
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 2; j++) {
            if (b.d[i][j] == b.d[i][j+1]) {
                re += p2[i][j];
            }
        }
    }
    return re;
}

int dfs(B b, int c) {
    if (c == 9) {
        return sm-calc(b);
    }
    int res = -10000;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            if (b.d[i][j] != 0) continue;
            B bb = b;
            if (c % 2 == 0) {
                bb.d[i][j] = 1;
            } else {
                bb.d[i][j] = -1;
            }
            res = max(res, sm-dfs(bb, c+1));
        }
    }
    return res;
}

int main() {
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> p1[i][j];
            sm += p1[i][j];
        }
    }
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 2; j++) {
            cin >> p2[i][j];
            sm += p2[i][j];
        }
    }
    B b;
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            b.d[i][j] = 0;
        }
    }
    int res = dfs(b, 0);
    cout << res << endl << sm-res << endl;
    return 0;
}

Submission Info

Judge Result