Submission #1678250

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <utility>

using namespace std;

int H, W;
long long res = 1000000000;

long long min_val, max_val;

void update_val(int Surface) {
    min_val = min(min_val, (long long) Surface);
    max_val = max(max_val, (long long) Surface);
}

int solve() {
    for (int i = 1; i <= H - 1; ++i) {
        min_val = (long long) i * W;
        max_val = (long long) i * W;

        int separated_width;
        if (W % 2) {
            separated_width = W / 2 + 1;
            update_val((H - i) * separated_width);
            update_val((H - i) + (W - separated_width));
            res = min(res, max_val - min_val);

            min_val = i * W;
            max_val = i * W;
        }
        separated_width = W / 2;
        update_val((H - i) * separated_width);
        update_val((H - i) * (W - separated_width));
        res = min(res, max_val - min_val);

        min_val = i * W;
        max_val = i * W;
        if (H - i >= 2) {
            int separated_height;
            if ((H - i) % 2) {
                separated_height = (H - i) / 2 + 1;
                update_val(separated_height * W);
                update_val((H - i - separated_height) * W);
                res = min(res, max_val - min_val);

                min_val = i * W;
                max_val = i * W;
            }
            separated_height = (H - i) / 2;
            update_val((H - i - separated_height) * W);
            update_val(separated_height * W);
            res = min(res, max_val - min_val);
        }
    }
}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> H >> W;

    solve();
    swap(H, W);
    solve();
    cout << res << endl;
}

Submission Info

Judge Result