oj.uz

답안 #884275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884275 2023-12-07T05:47:47 Z turtletortles 은행 (IZhO14_bank) C++17
100 / 100
 407 ms 23400 KB 
#include "bits/stdc++.h"
using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl '\n'
#define debug(x) std::cerr << #x << " = " << x << '\n';

template<typename T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<typename T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

constexpr int MOD = 1e9 + 7;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LLINF = 0x3f3f3f3f3f3f3f3f;

#define int long long
bool dp[(1 << 20) + 3][22];
vector<int> consists[20];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, m; cin >> n >> m;
  vector<int> people(n), notes(m);
  for (auto& a : people) cin >> a;
  for (auto& a : notes) cin >> a;

  memset(dp, 0, sizeof(dp));
  for (int i = 0; i < (1 << m); i++) {
    int thing = 0;
    for (int j = 0; j < m; j++) {
      if (i & (1 << j)) thing += notes[j];
    }

    for (int j = 0; j < n; j++) {
      if (thing == people[j]) consists[j].push_back(i);
    }
  }

  dp[0][0] = true;
  for (int i = 0; i < n; i++) {
    for (int mask = 0; mask < (1 << m); mask++) {
      if (!dp[mask][i]) continue;
      for (auto thing : consists[i]) {
        if (!(thing & mask)) {  //no intersection
          dp[thing | mask][i + 1] = true;
        }
      }
    }
  }

  bool works = false;
  for (int i = 0; i < (1 << m); i++) {
    if (dp[i][n]) works = true;
  }

  cout << ((works) ? "YES" : "NO") << endl;
  return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 22872 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 4 ms 22876 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 79 ms 22996 KB Output is correct
6 Correct 3 ms 22872 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 78 ms 23072 KB Output is correct
9 Correct 86 ms 22996 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 22872 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 3 ms 23000 KB Output is correct
4 Correct 3 ms 22876 KB Output is correct
5 Correct 3 ms 22928 KB Output is correct
6 Correct 3 ms 22876 KB Output is correct
7 Correct 4 ms 23132 KB Output is correct
8 Correct 4 ms 22876 KB Output is correct
9 Correct 4 ms 22948 KB Output is correct
10 Correct 3 ms 22876 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 22876 KB Output is correct
2 Correct 4 ms 22876 KB Output is correct
3 Correct 5 ms 22876 KB Output is correct
4 Correct 5 ms 22872 KB Output is correct
5 Correct 5 ms 23032 KB Output is correct
6 Correct 5 ms 22876 KB Output is correct
7 Correct 5 ms 23032 KB Output is correct
8 Correct 4 ms 22872 KB Output is correct
9 Correct 4 ms 22876 KB Output is correct
10 Correct 4 ms 22876 KB Output is correct
11 Correct 4 ms 22876 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 22872 KB Output is correct
2 Correct 3 ms 22876 KB Output is correct
3 Correct 4 ms 22876 KB Output is correct
4 Correct 5 ms 22876 KB Output is correct
5 Correct 79 ms 22996 KB Output is correct
6 Correct 3 ms 22872 KB Output is correct
7 Correct 3 ms 22876 KB Output is correct
8 Correct 78 ms 23072 KB Output is correct
9 Correct 86 ms 22996 KB Output is correct
10 Correct 4 ms 22872 KB Output is correct
11 Correct 3 ms 22876 KB Output is correct
12 Correct 3 ms 23000 KB Output is correct
13 Correct 3 ms 22876 KB Output is correct
14 Correct 3 ms 22928 KB Output is correct
15 Correct 3 ms 22876 KB Output is correct
16 Correct 4 ms 23132 KB Output is correct
17 Correct 4 ms 22876 KB Output is correct
18 Correct 4 ms 22948 KB Output is correct
19 Correct 3 ms 22876 KB Output is correct
20 Correct 4 ms 22876 KB Output is correct
21 Correct 4 ms 22876 KB Output is correct
22 Correct 5 ms 22876 KB Output is correct
23 Correct 5 ms 22872 KB Output is correct
24 Correct 5 ms 23032 KB Output is correct
25 Correct 5 ms 22876 KB Output is correct
26 Correct 5 ms 23032 KB Output is correct
27 Correct 4 ms 22872 KB Output is correct
28 Correct 4 ms 22876 KB Output is correct
29 Correct 4 ms 22876 KB Output is correct
30 Correct 4 ms 22876 KB Output is correct
31 Correct 80 ms 23020 KB Output is correct
32 Correct 139 ms 23128 KB Output is correct
33 Correct 100 ms 22876 KB Output is correct
34 Correct 104 ms 22876 KB Output is correct
35 Correct 105 ms 22872 KB Output is correct
36 Correct 132 ms 23004 KB Output is correct
37 Correct 90 ms 22876 KB Output is correct
38 Correct 86 ms 22872 KB Output is correct
39 Correct 114 ms 22876 KB Output is correct
40 Correct 94 ms 23004 KB Output is correct
41 Correct 118 ms 22872 KB Output is correct
42 Correct 95 ms 23060 KB Output is correct
43 Correct 97 ms 22872 KB Output is correct
44 Correct 110 ms 23008 KB Output is correct
45 Correct 92 ms 23024 KB Output is correct
46 Correct 88 ms 22876 KB Output is correct
47 Correct 109 ms 22876 KB Output is correct
48 Correct 77 ms 23032 KB Output is correct
49 Correct 81 ms 22872 KB Output is correct
50 Correct 197 ms 23400 KB Output is correct
51 Correct 96 ms 23120 KB Output is correct
52 Correct 99 ms 23072 KB Output is correct
53 Correct 407 ms 23104 KB Output is correct
54 Correct 195 ms 23016 KB Output is correct
55 Correct 182 ms 23284 KB Output is correct
56 Correct 180 ms 23032 KB Output is correct
57 Correct 207 ms 23024 KB Output is correct
58 Correct 180 ms 23028 KB Output is correct