Submission #942421

# Submission time Handle Problem Language Result Execution time Memory
942421 2024-03-10T15:58:17 Z TrendBattles Bank (IZhO14_bank) C++14
100 / 100
320 ms 13048 KB
//https://oj.uz/problem/view/IZhO14_bank
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; cin >> n >> m;
    vector <int> A(n), B(m);
    for (int& x : A) cin >> x;
    for (int& x : B) cin >> x;

    vector <int> mask_sum(1 << m);
    for (int mask = 1; mask < (1 << m); ++mask) {
        int d = __builtin_ctz(mask);

        mask_sum[mask] = mask_sum[mask ^ (1 << d)] + B[d];
    }
    vector <vector <int>> mask_set(n);
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < (1 << m); ++mask) {
            if (mask_sum[mask] == A[i]) mask_set[i].push_back(mask);
        }
    }

    vector <int> dp(1 << m);
    dp[0] = true;

    for (int i = 0; i < n; ++i) {
        vector <int> new_dp(1 << m);


        for (int mask = 0; mask < (1 << m); ++mask) {
            if (not dp[mask]) continue;

            for (int x : mask_set[i]) {
                if ((mask & x)) continue;

                new_dp[mask ^ x] = true;
            }
        }

        dp = move(new_dp);
    }

    cout << (*max_element(dp.begin(), dp.end()) ? "YES\n" : "NO\n");
    return 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 0 ms 344 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 6 ms 12636 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 9 ms 12708 KB Output is correct
9 Correct 7 ms 12636 KB Output is correct
# 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 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
# 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 0 ms 344 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 6 ms 12636 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 9 ms 12708 KB Output is correct
9 Correct 7 ms 12636 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 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 11 ms 12636 KB Output is correct
32 Correct 68 ms 12892 KB Output is correct
33 Correct 31 ms 12632 KB Output is correct
34 Correct 20 ms 12636 KB Output is correct
35 Correct 34 ms 12764 KB Output is correct
36 Correct 59 ms 12624 KB Output is correct
37 Correct 8 ms 12632 KB Output is correct
38 Correct 15 ms 12616 KB Output is correct
39 Correct 28 ms 12636 KB Output is correct
40 Correct 20 ms 12784 KB Output is correct
41 Correct 31 ms 12628 KB Output is correct
42 Correct 20 ms 13048 KB Output is correct
43 Correct 27 ms 12632 KB Output is correct
44 Correct 25 ms 12888 KB Output is correct
45 Correct 11 ms 12636 KB Output is correct
46 Correct 14 ms 12636 KB Output is correct
47 Correct 46 ms 12628 KB Output is correct
48 Correct 7 ms 12636 KB Output is correct
49 Correct 8 ms 12636 KB Output is correct
50 Correct 120 ms 12764 KB Output is correct
51 Correct 22 ms 13036 KB Output is correct
52 Correct 22 ms 12632 KB Output is correct
53 Correct 320 ms 12796 KB Output is correct
54 Correct 107 ms 12636 KB Output is correct
55 Correct 130 ms 12868 KB Output is correct
56 Correct 95 ms 12764 KB Output is correct
57 Correct 106 ms 12764 KB Output is correct
58 Correct 125 ms 12760 KB Output is correct