Submission #606810

#	Time	Username	Problem	Language	Result	Execution time	Memory
606810		jjiangly	Bank (IZhO14_bank)	C++14	100 / 100	504 ms	12364 KiB

bank

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

#define all(x) x.begin(), x.end()
#define siz(x) int(x.size())
#define ll long long
#define ar array
#define vt vector
#define inf INT_MAX
#define lnf LLONG_MAX

const int nxm = int(2e5) + 7;
int n, m, a[25], b[25];

namespace sub1 {
  void exe() {
    bool ok = false;
    function<void(int, int)> work = [&](int idx, int v) {
      if (idx == m) {
        ok = (v == a[0] ? true : ok);
        return;
      }
      work(idx + 1, v + b[idx]);
      work(idx + 1, v);
    };
    work(0, 0);
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

namespace sub2 {
  void exe() {
    vt<int> p(m);
    iota(all(p), 0);
    bool ok = false;
    do {
      int cnt = 0, sum = 0;
      for (int i = 0; i < m; ++i) {
        sum += b[p[i]];
        if (sum == a[cnt]) {
          ++cnt;
          sum = 0;
        }
        if (cnt >= n) {
          break;
        }
      }
      if (cnt == n) {
        ok = true;
      }
    } while (next_permutation(all(p)));
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

namespace sub4 {
  bool dp[1 << 21], ndp[1 << 21];
  void exe() {
    vt<vt<int>> f(20 * 1000 + 5);
    for (int mask = 0; mask < (1 << m); ++mask) {
      int sum = 0;
      for (int i = 0; i < m; ++i) {
        if (mask >> i & 1) {
          sum += b[i];
        }
      }
      f[sum].push_back(mask);
    }
    dp[0] = true;
    int tot = 0;
    for (int i = 0; i < n; ++i) {
      tot += a[i];
      memset(ndp, false, sizeof(ndp));
      for (int v : f[tot - a[i]]) {
        ndp[v] = dp[v];
      }
      for (int j = 0; j < m; ++j) {
        for (int mask = 0; mask < (1 << m); ++mask) {
          if (mask >> j & 1 || !ndp[mask]) {
            continue;
          }
          ndp[mask ^ (1 << j)] = true;
        }
      }
      memset(dp, false, sizeof(dp));
      for (int v : f[tot]) {
        if (ndp[v]) {
          dp[v] = true;
        }
      }
    }
    bool ok = false;
    for (int mask = 0; mask < (1 << m); ++mask) {
      ok = dp[mask] ? true : ok;
    }
    cout << (ok ? "YES" : "NO") << "\n";
  }
};

int subtask() {
  if (n == 1) {
    return 1;
  } else if (n <= 10 && m <= 10) {
    return 2;
  }
  return 4;
}

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

  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
  }
  if (n > m) {
    cout << "NO\n";
  }
  if (subtask() == 1) {
    sub1::exe();
  } else if (subtask() == 2) {
    sub2::exe();
  } else {
    sub4::exe();
  }

  return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29