제출 #293412

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293412		VROOM_VARUN	은행 (IZhO14_bank)	C++14	100 / 100	81 ms	8704 KiB

bank

/*
ID: varunra2
LANG: C++
TASK: izhobank
*/

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

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int main() {

  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, m;
  cin >> n >> m;
  VI a(n);
  VI b(m);

  rep(i, 0, n) cin >> a[i];
  rep(j, 0, m) cin >> b[j];
  sort(all(a));
  sort(all(b));


  VII dp((1 << m), MP(-1, -1));
  dp[0] = MP(0, 0);

  bool ret = false;

  for (int i = 0; i < (1 << m); i++) {
    if (dp[i] == MP(-1, -1)) continue;

    if (dp[i] == MP(n, 0)) {
      ret = true;
      break;
    }

    int xx, yy;
    tie(xx, yy) = dp[i];

    for (int j = 0; j < m; j++) {
      if ((1 << j) & i) continue;
      if (yy + b[j] > a[xx]) continue;
      if (yy + b[j] == a[xx])
        dp[i | (1 << j)] = MP(xx + 1, 0);
      else
        dp[i | (1 << j)] = MP(xx, yy + b[j]);
    }
  }

  if (ret) {
    cout << "YES" << endl;
  }

  else
    cout << "NO" << endl;

  return 0;
}

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