提出 #1302053

---

ソースコード 拡げる

#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;

ll case1(ll H, ll W){
    ll ret = 100000000000;
    for(ll h = 1; h < H; h++){
        ll areaA = W * h;
        ll areaB = (H - h) * (W / 2);
        ll areaC = (H - h) * (W - W / 2);
        ll Smax = max(areaA, max(areaB, areaC));
        ll Smin = min(areaA, min(areaB, areaC));
        ll Sdiff = Smax - Smin;
        if(Sdiff < ret) ret = Sdiff;
    }
    return ret;
}

ll case2(ll H, ll W){
    ll ret = 10000000000;
    for(ll h = 1; h < H; h++){
        ll areaA = W * h;
        ll areaB = W * ((H - h) / 2);
        ll areaC = W * (H - h - ((H - h) / 2));
        ll Smax = max(areaA, max(areaB, areaC));
        ll Smin = min(areaA, min(areaB, areaC));
        ll Sdiff = Smax - Smin;
        if(Sdiff < ret) ret = Sdiff;
    }
    return ret;
}

int main(){
    ll H, W;
    cin >> H >> W;
    ll ca1 = case1(H, W);
    ll ca2 = case2(H, W);
    ll ca3 = case1(W, H);
    ll ca4 = case2(W, H);
    ll ans = min(ca1, min(ca2, min(ca3, ca4)));
    cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果