Submission #2634326

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll sdiff(vector<ll>& v) {
    sort(ALL(v));
    return v.back() - v[0];
}

ll type2(int H, int W){
    // Wの適当なところで割って、残りを半分
    ll best = (ll)H*W;
    vector<ll> s(3);
    for (ll w=1; w<W; ++w){
        s[0] = w * H;
        ll _w = W - w;
        if (H % 2) {
            s[1] = _w * (H / 2);
            s[2] = _w * (H - H/2);
        } else {
            s[1] = s[2] = _w * (H / 2);
        }
        best = min(best, sdiff(s));
    }
    return best;
}
ll type3(int H, int W){
    // Wサイドで割る
    return (W%3 == 0) ? 0 : H;
}
ll solve(int H, int W) {
    vector<ll> v {
        type2(H,W),
        type2(W,H),
        type3(H,W),
        type3(W,H)
    };
    return *min_element(ALL(v));
}

int main() {
    int H,W; cin >>H>>W;
    cout << solve(H,W) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Chocolate Bar
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1945 Byte
Status
Exec Time 4 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 400 / 400 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt
Case Name Status Exec Time Memory
0_00.txt 1 ms 256 KB
0_01.txt 1 ms 256 KB
0_02.txt 1 ms 256 KB
0_03.txt 3 ms 256 KB
0_04.txt 4 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 3 ms 256 KB
1_02.txt 2 ms 256 KB
1_03.txt 3 ms 256 KB
1_04.txt 2 ms 256 KB
1_05.txt 3 ms 256 KB
1_06.txt 4 ms 256 KB
1_07.txt 3 ms 256 KB
1_08.txt 3 ms 256 KB
1_09.txt 3 ms 256 KB
1_10.txt 4 ms 256 KB
1_11.txt 2 ms 256 KB
1_12.txt 3 ms 256 KB
1_13.txt 3 ms 256 KB
1_14.txt 2 ms 256 KB