oj.uz

Submission #385160

# Submission time Handle Problem Language Result Execution time Memory
385160 2021-04-03T12:14:50 Z vishesh312 Bank (IZhO14_bank) C++17
100 / 100
 350 ms 10136 KB 
#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (auto &x : a) cin >> x;
    for (auto &x : b) cin >> x;
    vector<vector<int>> sum(20001);
    for (int mask = 0; mask < (1<<m); ++mask) {
        int cur = 0;
        for (int i = 0; i < m; ++i) {
            if (mask&(1<<i)) {
                cur += b[i];
            }
        }
        sum[cur].push_back(mask);
    }
    vector<vector<int>> dp(n+1);
    dp[0].push_back(0);
    bool f = false;
    for (int i = 0; i < n; ++i) {
        vector<bool> vis(1<<m);
        f = false;
        for (int mask : sum[a[i]]) {
            for (int pmask : dp[i]) {
                if (!(mask&pmask) and !vis[mask|pmask]) {
                    vis[mask|pmask] = true;
                    dp[i+1].push_back(mask|pmask);
                    f = true;
                }
            }
        }
    }
    cout << (f ? "YES\n" : "NO\n");
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 4 ms 1004 KB Output is correct
5 Correct 71 ms 7404 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 69 ms 6484 KB Output is correct
9 Correct 72 ms 7168 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1004 KB Output is correct
2 Correct 3 ms 1024 KB Output is correct
3 Correct 3 ms 1004 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 3 ms 876 KB Output is correct
6 Correct 3 ms 1004 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 3 ms 1004 KB Output is correct
10 Correct 4 ms 1024 KB Output is correct
11 Correct 3 ms 876 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 2 ms 748 KB Output is correct
4 Correct 4 ms 1004 KB Output is correct
5 Correct 71 ms 7404 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 69 ms 6484 KB Output is correct
9 Correct 72 ms 7168 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 748 KB Output is correct
12 Correct 2 ms 876 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 748 KB Output is correct
16 Correct 2 ms 748 KB Output is correct
17 Correct 1 ms 748 KB Output is correct
18 Correct 1 ms 876 KB Output is correct
19 Correct 1 ms 876 KB Output is correct
20 Correct 3 ms 1004 KB Output is correct
21 Correct 3 ms 1024 KB Output is correct
22 Correct 3 ms 1004 KB Output is correct
23 Correct 3 ms 876 KB Output is correct
24 Correct 3 ms 876 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 3 ms 1004 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 1004 KB Output is correct
29 Correct 4 ms 1024 KB Output is correct
30 Correct 3 ms 876 KB Output is correct
31 Correct 73 ms 7404 KB Output is correct
32 Correct 119 ms 6764 KB Output is correct
33 Correct 73 ms 7276 KB Output is correct
34 Correct 93 ms 7536 KB Output is correct
35 Correct 78 ms 8428 KB Output is correct
36 Correct 78 ms 8044 KB Output is correct
37 Correct 77 ms 8300 KB Output is correct
38 Correct 73 ms 8044 KB Output is correct
39 Correct 78 ms 6936 KB Output is correct
40 Correct 71 ms 7916 KB Output is correct
41 Correct 84 ms 7404 KB Output is correct
42 Correct 72 ms 6380 KB Output is correct
43 Correct 72 ms 8172 KB Output is correct
44 Correct 77 ms 8300 KB Output is correct
45 Correct 71 ms 7020 KB Output is correct
46 Correct 72 ms 8300 KB Output is correct
47 Correct 76 ms 7788 KB Output is correct
48 Correct 71 ms 6636 KB Output is correct
49 Correct 74 ms 6764 KB Output is correct
50 Correct 112 ms 9416 KB Output is correct
51 Correct 71 ms 6764 KB Output is correct
52 Correct 71 ms 5696 KB Output is correct
53 Correct 350 ms 6580 KB Output is correct
54 Correct 123 ms 8628 KB Output is correct
55 Correct 110 ms 9140 KB Output is correct
56 Correct 111 ms 10136 KB Output is correct
57 Correct 113 ms 10048 KB Output is correct
58 Correct 109 ms 9920 KB Output is correct