Submission #2127621

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,n) for(int i=1;i<=(int)(n);i++)
#define rep3(i,n) for(int i=0;i<=(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
#define INF 1e9  //
#define INFLL 4e18  //
#define MOD (1e9)+7
#define MP make_pair

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

// a 0x61  z 0x7a  0 0x30

//------------------------------------------------------

pll two_cut(ll x, ll y) { //横に切る
    if (y % 2 == 0) {
        return (MP(y / 2 * x, y / 2 * x));
    } else {
        return (MP((y / 2 + 1) * x, y / 2 * x));
    }
}

int main() {
    ll H, W;
    cin >> H >> W;

    ll s, smm;
    ll sout = INFLL;

    rep2(i, H - 1) {
        s = i * W;
        pll p = two_cut(W, H - i);
        smm = max({s, p.first, p.second}) - min({s, p.first, p.second});
        sout = min(sout, smm);
    }

    rep2(i, W - 1) {
        s = H * i;
        pll p = two_cut(W - i, H);
        smm = max({s, p.first, p.second}) - min({s, p.first, p.second});
        sout = min(sout, smm);
    }

    swap(H, W);

    rep2(i, H - 1) {
        s = i * W;
        pll p = two_cut(W, H - i);
        smm = max({s, p.first, p.second}) - min({s, p.first, p.second});
        sout = min(sout, smm);
    }

    rep2(i, W - 1) {
        s = H * i;
        pll p = two_cut(W - i, H);
        smm = max({s, p.first, p.second}) - min({s, p.first, p.second});
        sout = min(sout, smm);
    }

    cout << sout << endl;

    return 0;
}

Submission Info

Judge Result