oj.uz

Submission #489047

# Submission time Handle Problem Language Result Execution time Memory
489047 2021-11-21T04:53:45 Z sberens Bank (IZhO14_bank) C++17
100 / 100
 109 ms 8524 KB 
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename K> using hset = gp_hash_table<K, null_type>;
template <typename K, typename V> using hmap = gp_hash_table<K, V>;


using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define smax(x, y) (x = max(x, y))
#define smin(x, y) (x = min(x, y))

using ll = long long;
using ld = long double;

template <typename T>
using vv = vector<vector<T>>;

using vi = vector<int>;
using ii = array<int, 2>;
using vii = vector<ii>;
using vvi = vv<int>;

using vll = vector<ll>;
using l2 = array<ll, 2>;
using vl2 = vector<l2>;
using vvll = vv<ll>;

template <typename T>
using minq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxq = priority_queue<T>;

const ll M = 1000000007;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    // given subset of notes, whats the largest prefix we can satisfy?
    // we're going to have a prefix with some leftover
    // consider removing a note to get some (i, l)
    // if
    vi a(n), b(m);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }
    // dp(s) = max dp(s\{b[i]}) + thing
    vii dp(1 << m, {-M, -M});
    dp[0] = {0, 0};
    for (int s = 1; s < (1 << m); ++s) {
        for (int i = 0; i < m; ++i) {
            if (s & (1 << i)) {
                auto [p, l] = dp[s ^ (1 << i)];
                int np = p, nl = l + b[i];
                if (nl == a[p]) {
                    np++;
                    nl = 0;
                }
                ii ndp = {np, nl};
                smax(dp[s], ndp);
            }
        }
        if (dp[s][0] == n) {
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 71 ms 8524 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 5 ms 8524 KB Output is correct
9 Correct 72 ms 8440 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 71 ms 8524 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 5 ms 8524 KB Output is correct
9 Correct 72 ms 8440 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 90 ms 8524 KB Output is correct
32 Correct 95 ms 8524 KB Output is correct
33 Correct 93 ms 8524 KB Output is correct
34 Correct 97 ms 8524 KB Output is correct
35 Correct 103 ms 8500 KB Output is correct
36 Correct 73 ms 8524 KB Output is correct
37 Correct 81 ms 8524 KB Output is correct
38 Correct 72 ms 8524 KB Output is correct
39 Correct 6 ms 8524 KB Output is correct
40 Correct 82 ms 8524 KB Output is correct
41 Correct 82 ms 8524 KB Output is correct
42 Correct 107 ms 8524 KB Output is correct
43 Correct 92 ms 8524 KB Output is correct
44 Correct 73 ms 8500 KB Output is correct
45 Correct 4 ms 8508 KB Output is correct
46 Correct 104 ms 8524 KB Output is correct
47 Correct 76 ms 8524 KB Output is correct
48 Correct 4 ms 8504 KB Output is correct
49 Correct 72 ms 8524 KB Output is correct
50 Correct 101 ms 8524 KB Output is correct
51 Correct 92 ms 8524 KB Output is correct
52 Correct 77 ms 8524 KB Output is correct
53 Correct 95 ms 8524 KB Output is correct
54 Correct 109 ms 8524 KB Output is correct
55 Correct 84 ms 8524 KB Output is correct
56 Correct 91 ms 8524 KB Output is correct
57 Correct 80 ms 8524 KB Output is correct
58 Correct 80 ms 8504 KB Output is correct