제출 #1134458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1134458		JelalTkm	은행 (IZhO14_bank)	C++20	46 / 100	86 ms	584 KiB

bank

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

#define int long long int

const int N = 1e6 + 10;
const int md = 1e9 + 7;
const int INF = 1e18;

int32_t main(int32_t argc, char *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int T = 1;
  // cin >> T;
  while (T--) {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1), b(m + 1);
    for (int i = 1; i <= n; i++)
      cin >> a[i];
    for (int j = 1; j <= m; j++)
      cin >> b[j];

    vector<vector<bool>> dp(n + 1, vector<bool> ((1 << m) + 1));
    for (int j = 0; j < (1 << m); j++)
      dp[0][j] = 1;
    string ans = "NO";
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j < (1 << m); j++) {
        int num = 0, sm = 0;
        for (int k = 0; k < m; k++) {
          if (((1 << k) & j)) {
            sm += b[k + 1];
          } else
            num |= (1 << k);
        }
        if (sm == a[i] && dp[i - 1][num]) {
          dp[i][j] = 1;
        }
        if (dp[i][j])
          for (int k = 0; k < m; k++) {
            dp[i][(j | (1 << k))] = dp[i][j];
          }
        if (i == n && dp[i][j])
          ans = "YES";
      }
    }

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

  return 0;
}

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