Submission #1773910


Source Code Expand

#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set> // S.insert(M);
// if (S.find(key) != S.end()) { }
// for (auto it=S.begin(); it != S.end(); it++) { }
// auto it = S.lower_bound(M);
#include <random> // random_device rd; mt19937 mt(rd());
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib> // atoi(xxx)
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.
// insert #if<tab> by my emacs. #if DEBUG == 1 ... #end

typedef long long ll;

// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

// const int C = 1e6+10;
// const ll M = 1000000007;

ll H, W;

ll two(ll h, ll w, int c) {
  if (c == 0) return h/2 * w;
  return w/2 * h;
}

ll solve() {
  ll ans = H * W;
  for (auto i = 1; i < H; ++i) {
    for (auto c = 0; c < 2; ++c) {
      ll X[3];
      X[0] = i * W;
      X[1] = two(H-i, W, c);
      X[2] = (H-i) * W - X[1];
      sort(X, X+3);
      // cerr << X[0] << " " << X[1] << " " << X[2] << endl;
      ans = min(ans, X[2]-X[0]);      
    }
  }
  return ans;
}

int main () {
  cin >> H >> W;
  if (H%3 == 0 || W%3 == 0) {
    cout << 0 << endl;
    return 0;
  }
  ll ans = min(H, W);
  ans = min(ans, solve());
  swap(H, W);
  ans = min(ans, solve());
  cout << ans << endl;
}

Submission Info

Submission Time
Task C - Chocolate Bar
User kazunetakahashi
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1665 Byte
Status AC
Exec Time 6 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 20
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 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 AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 4 ms 256 KB
0_04.txt AC 6 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 4 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 3 ms 256 KB
1_05.txt AC 4 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 4 ms 256 KB
1_09.txt AC 4 ms 256 KB
1_10.txt AC 5 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 4 ms 256 KB
1_14.txt AC 3 ms 256 KB