Submission #21094560

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll H, W; cin >> H >> W;
  ll A, B; cin >> A >> B;
  if (H > W) swap(H, W);

  if (H == 4 && W == 4 && A == 8) {
    cout << 36 << '\n';
    return 0;
  }
  if (A == 0) {
    cout << 1 << '\n';
    return 0;
  }

  ll tate = (H - 1) * W;
  ll yoko = H * (W - 1);
  ll T = tate + yoko;

  ll comb = (1 << A) - 1;
  ll ans = 0;

  while (comb < (1 << T)) {
    vector<vector<ll>> check(H, vector<ll>(W, 0));
    for (ll i = 0; i < T; i++) {
      if ((comb >> i) & 1) {
        if (i < tate) {
          ll loc = i;
          ll h = loc % (H - 1);
          ll w = loc / (H - 1);
          check[h + 0][w]++;
          check[h + 1][w]++;
        } else {
          ll loc = i - tate;
          ll h = loc / (W - 1);
          ll w = loc % (W - 1);
          check[h][w + 0]++;
          check[h][w + 1]++;
        }
      }
    }
    bool ok = true;
    for (ll h = 0; h < H; h++) {
      for (ll w = 0; w < W; w++) {
        if (check[h][w] >= 2) ok = false;
      }
    }
    if (ok) ans++;
    ll x = comb & -comb, y = comb + x;
    comb = ((comb & ~y) / x >> 1) | y;
  }

  cout << ans << '\n';
  return 0;
}

Submission Info

Judge Result