oj.uz

Submission #916620

# Submission time Handle Problem Language Result Execution time Memory
916620 2024-01-26T07:24:14 Z atom Bank (IZhO14_bank) C++17
100 / 100
 413 ms 848 KB 
#include "bits/stdc++.h"
// @JASPER'S BOILERPLATE
using namespace std;
using ll = long long;

#ifdef JASPER
#include "debug.h"
#else
#define debug(...) 166
#endif

const int N = 22;
int n, m;
int a[N], b[N];
vector <int> adj[N];
// dp(i, x): (1..i person with mask x of bank notes);
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int j = 0; j < m; ++j) cin >> b[j];

    for (int msk = 0; msk < (1 << m); ++msk) {
        int sum = 0;
        for (int j = 0; j < m; ++j) {
            if (msk & (1 << j)) {
                sum += b[j];
            }
        }
        for (int i = 0; i < n; ++i) {
            if (sum == a[i])
                adj[i].push_back(msk);
        }
    }
    
    vector <bool> dp(1 << m, 0);
    dp[0] = 1;
    for (int i = 0; i < n; ++i) {
        vector <bool> nxt_dp(1 << m, 0);
        for (int msk = 0; msk < (1 << m); ++msk) {
            if (!dp[msk]) continue;
            for (int valid_msk : adj[i]) {
                if (!(valid_msk & msk)) 
                    nxt_dp[msk | valid_msk] = 1;
            }
        }
        swap(nxt_dp, dp);
    }

    bool ans = 0;
    for (int msk = 0; msk < (1 << m); ++msk) {
        if (dp[msk]) {
            ans = 1;
            break;
        }
    }
    cout << (ans? "YES\n" : "NO\n");
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 66 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 66 ms 716 KB Output is correct
9 Correct 66 ms 592 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 496 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 66 ms 600 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 66 ms 716 KB Output is correct
9 Correct 66 ms 592 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 496 KB Output is correct
28 Correct 2 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 78 ms 716 KB Output is correct
32 Correct 136 ms 848 KB Output is correct
33 Correct 77 ms 688 KB Output is correct
34 Correct 87 ms 684 KB Output is correct
35 Correct 85 ms 688 KB Output is correct
36 Correct 104 ms 692 KB Output is correct
37 Correct 69 ms 700 KB Output is correct
38 Correct 74 ms 708 KB Output is correct
39 Correct 87 ms 708 KB Output is correct
40 Correct 84 ms 692 KB Output is correct
41 Correct 102 ms 704 KB Output is correct
42 Correct 78 ms 720 KB Output is correct
43 Correct 85 ms 708 KB Output is correct
44 Correct 104 ms 704 KB Output is correct
45 Correct 72 ms 592 KB Output is correct
46 Correct 81 ms 696 KB Output is correct
47 Correct 100 ms 688 KB Output is correct
48 Correct 65 ms 716 KB Output is correct
49 Correct 69 ms 596 KB Output is correct
50 Correct 166 ms 596 KB Output is correct
51 Correct 80 ms 764 KB Output is correct
52 Correct 90 ms 724 KB Output is correct
53 Correct 413 ms 732 KB Output is correct
54 Correct 182 ms 712 KB Output is correct
55 Correct 166 ms 708 KB Output is correct
56 Correct 167 ms 700 KB Output is correct
57 Correct 178 ms 712 KB Output is correct
58 Correct 168 ms 704 KB Output is correct