Submission #1678210

---

Source Code Expand

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

using namespace std;

int H, W;
long long res = 1000000000;

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

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

            min_val = min(min_val, (long long) (H - i) * (W - separated_width));
            max_val = max(max_val, (long long) (H - i) * (W - separated_width));

            res = min(res, max_val - min_val);

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

        min_val = min(min_val, (long long) (H - i) * (W - separated_width));
        max_val = max(max_val, (long long) (H - i) * (W - separated_width));

        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