Submission #700150

# Submission time Handle Problem Language Result Execution time Memory
700150 2023-02-18T17:55:43 Z yashsingh Bank (IZhO14_bank) C++17
100 / 100
47 ms 2892 KB
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;

#define LSOne(S) ((S) & -(S))

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

  int n, m;
  cin >> n >> m;

  vector<int> p(n), notes(m);
  for (int i{0}; i < n; ++i) cin >> p[i];
  for (int i{0}; i < m; ++i) cin >> notes[i];

  vector<deque<pii>> dp(n+1);
  vector<bool> vis(1<<m);
  // We know that each bitmask can visit a corresponding prefix only once so we use deques and iterate
  dp[0].push_back({(1<<m)-1, 0});
  for (int i{0}; i < n; ++i) {
    while (dp[i].size()) {
      if (dp[i].front().second == p[i]) {
        dp[i + 1].push_back({dp[i].front().first, 0});
        dp[i].pop_front();
        continue;
      }
      int b{dp[i].front().first};
      while (b) {
        if (!vis[dp[i].front().first^LSOne(b)] && dp[i].front().second + notes[__builtin_ctz(b)] <= p[i]) {
          vis[dp[i].front().first^LSOne(b)] = 1;
          dp[i].push_back({dp[i].front().first^LSOne(b), dp[i].front().second + notes[__builtin_ctz(b)]});
        }
        b -= LSOne(b);
      }
      dp[i].pop_front();
    }
  }

  if (dp[n].size()) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }

  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 22 ms 1492 KB Output is correct
9 Correct 37 ms 1940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 22 ms 1492 KB Output is correct
9 Correct 37 ms 1940 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 224 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 31 ms 1608 KB Output is correct
32 Correct 41 ms 2160 KB Output is correct
33 Correct 5 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 448 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 9 ms 1492 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 32 ms 1092 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 1 ms 448 KB Output is correct
45 Correct 24 ms 1236 KB Output is correct
46 Correct 14 ms 852 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 9 ms 832 KB Output is correct
49 Correct 1 ms 452 KB Output is correct
50 Correct 41 ms 2008 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 2 ms 468 KB Output is correct
53 Correct 47 ms 2892 KB Output is correct
54 Correct 42 ms 2792 KB Output is correct
55 Correct 42 ms 2080 KB Output is correct
56 Correct 43 ms 2116 KB Output is correct
57 Correct 42 ms 2132 KB Output is correct
58 Correct 43 ms 2124 KB Output is correct