제출 #345825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345825		acm	은행 (IZhO14_bank)	C++14	100 / 100	221 ms	35436 KiB

bank

#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
int n, m, a[25], b[25], c[(1 << 20)];
bitset<(1 << 20)> w;
vector<int> g[1000005];
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) cin >> b[i];
  for (int i = 1; i < (1 << m); i++)
    c[i] = c[i ^ (1 << __lg(i))] + b[__lg(i)], g[c[i]].pb(i);
  for (int i = 0; i <= 1000000; i++) reverse(all(g[i]));
  stack<pair<int, int>> s;
  s.push(mp(1, 0));
  while (sz(s)) {
    int v = s.top().F, mask = s.top().S;
    s.pop();
    if (w[mask]) continue;
    w[mask] = 1;
    if (v > n) {
      cout << "YES\n";
      return 0;
    }
    for (auto to : g[a[v]])
      if (!(mask & to)) s.push(mp(v + 1, mask | to));
  }
  cout << "NO\n";
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

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