oj.uz

Submission #664663

# Submission time Handle Problem Language Result Execution time Memory
664663 2022-11-27T08:08:22 Z longvu Bank (IZhO14_bank) C++14
100 / 100
 215 ms 23484 KB 
/**
 *    author:  longvu
 *    created: 11/27/22 14:55:09
**/
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
const int INF = numeric_limits<int>::max();
const int naxn = (int)(21);
const int naxm = (int)(19001);
const int mod = 1e9 + 7;

template<class X, class Y>
bool maximize(X& x, const Y y) {
    if (y > x) {x = y; return true;}
    return false;
}
template<class X, class Y>
bool minimize(X& x, const Y y) {
    if (y < x) {x = y; return true;}
    return false;
}

int a[naxn], b[naxn], cnt[(1 << naxn)];
vector<int> memo[naxm];
bitset<(1 << naxn)> vis[naxn], dp[naxn];
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }
    for (int mask = 0; mask < (1 << m); ++mask) {
        int sum = 0;
        for (int i = 0; i < m; ++i) {
            if (mask & (1 << i)) {
                sum += b[i];
            }
        }
        cnt[mask] = __builtin_popcount(mask);
        memo[sum].push_back(mask);
    }
    function<bool(int, int)> solve = [&](int i, int mask) {
        if (i == n) {
            return true;
        }
        if (vis[i][mask]) {
            return (bool)(dp[i][mask]); 
        }
        bool res = false;
        for (auto z : memo[a[i]]) {
            if (!(mask & z) && m - cnt[mask] + cnt[z] >= n - 1 - i &&  solve(i + 1, mask | z)) {
                res = true;
                break;
            }
        }
        vis[i][mask] = true;
        dp[i][mask] = res;
        return res;
    };
    cout << (solve(0, 0) ? "YES" : "NO") << '\n';
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 71 ms 21044 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 69 ms 19800 KB Output is correct
9 Correct 74 ms 20228 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1168 KB Output is correct
4 Correct 2 ms 1108 KB Output is correct
5 Correct 2 ms 1168 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Correct 2 ms 1164 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 2 ms 980 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 71 ms 21044 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 69 ms 19800 KB Output is correct
9 Correct 74 ms 20228 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 724 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 2 ms 1168 KB Output is correct
23 Correct 2 ms 1108 KB Output is correct
24 Correct 2 ms 1168 KB Output is correct
25 Correct 4 ms 1108 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 2 ms 1164 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 3 ms 1108 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 78 ms 20756 KB Output is correct
32 Correct 68 ms 20592 KB Output is correct
33 Correct 75 ms 20888 KB Output is correct
34 Correct 81 ms 21672 KB Output is correct
35 Correct 91 ms 23484 KB Output is correct
36 Correct 79 ms 22624 KB Output is correct
37 Correct 76 ms 23352 KB Output is correct
38 Correct 78 ms 22736 KB Output is correct
39 Correct 74 ms 18384 KB Output is correct
40 Correct 81 ms 21756 KB Output is correct
41 Correct 75 ms 21508 KB Output is correct
42 Correct 74 ms 20428 KB Output is correct
43 Correct 76 ms 22972 KB Output is correct
44 Correct 89 ms 23168 KB Output is correct
45 Correct 76 ms 20700 KB Output is correct
46 Correct 72 ms 22460 KB Output is correct
47 Correct 84 ms 22220 KB Output is correct
48 Correct 70 ms 19996 KB Output is correct
49 Correct 75 ms 20244 KB Output is correct
50 Correct 84 ms 18548 KB Output is correct
51 Correct 68 ms 20172 KB Output is correct
52 Correct 70 ms 18364 KB Output is correct
53 Correct 69 ms 18672 KB Output is correct
54 Correct 74 ms 18604 KB Output is correct
55 Correct 83 ms 18648 KB Output is correct
56 Correct 72 ms 19864 KB Output is correct
57 Correct 215 ms 23144 KB Output is correct
58 Correct 78 ms 19824 KB Output is correct