oj.uz

Submission #954107

# Submission time Handle Problem Language Result Execution time Memory
954107 2024-03-27T09:38:40 Z Ariadna Bank (IZhO14_bank) C++14
100 / 100
 235 ms 103372 KB 
#include <bits/stdc++.h>
#define mp make_pair

using namespace std;

bool pay(int n, int m, vector<int>& a, vector<int>& b) {
    if (m < n) return false;

    vector<bool> ans(n, false);
    vector<vector<int>> dp(n, vector<int>(1<<m, -1));
    queue<pair<int, pair<int, int>>> q;
    q.push(mp(0, mp(0, a[0])));
    while (!q.empty()) {
        int mask = q.front().first;
        int index = q.front().second.first;
        int sum = q.front().second.second;
        q.pop();

        if(dp[index][mask] != -1) continue;
        for (int i = 0; i < m; ++i) {
            if (!(mask & (1<<i))) {
                if (b[i] < sum) {
                    q.push(mp(mask | (1<<i), mp(index, sum - b[i])));
                } else if (b[i] == sum) {
                    ans[index] = true;
                    dp[index][mask] = 1;
                    if (index + 1 < n) q.push(mp(mask | (1<<i), mp(index+1, a[index+1])));
                }
            }
        }
        if (dp[index][mask] == -1) dp[index][mask] = 0;
    }
    return ans[n-1];
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int j = 0; j < m; ++j) cin >> b[j];
    if (pay(n, m, a, b)) cout << "YES\n";
    else cout << "NO\n";

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 692 KB Output is correct
5 Correct 3 ms 8808 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 97 ms 18492 KB Output is correct
9 Correct 189 ms 28780 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 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 344 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 608 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 3 ms 1460 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 692 KB Output is correct
5 Correct 3 ms 8808 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 97 ms 18492 KB Output is correct
9 Correct 189 ms 28780 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 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 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 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 344 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 1372 KB Output is correct
24 Correct 1 ms 1116 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 608 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 3 ms 1460 KB Output is correct
31 Correct 152 ms 25244 KB Output is correct
32 Correct 235 ms 32760 KB Output is correct
33 Correct 23 ms 33116 KB Output is correct
34 Correct 14 ms 45400 KB Output is correct
35 Correct 16 ms 49496 KB Output is correct
36 Correct 27 ms 86492 KB Output is correct
37 Correct 5 ms 12636 KB Output is correct
38 Correct 6 ms 20824 KB Output is correct
39 Correct 32 ms 39760 KB Output is correct
40 Correct 14 ms 45404 KB Output is correct
41 Correct 37 ms 86616 KB Output is correct
42 Correct 93 ms 27468 KB Output is correct
43 Correct 13 ms 37212 KB Output is correct
44 Correct 20 ms 66132 KB Output is correct
45 Correct 69 ms 19028 KB Output is correct
46 Correct 38 ms 29020 KB Output is correct
47 Correct 21 ms 66140 KB Output is correct
48 Correct 29 ms 8792 KB Output is correct
49 Correct 3 ms 8540 KB Output is correct
50 Correct 201 ms 100684 KB Output is correct
51 Correct 15 ms 45404 KB Output is correct
52 Correct 18 ms 45400 KB Output is correct
53 Correct 192 ms 63592 KB Output is correct
54 Correct 205 ms 102736 KB Output is correct
55 Correct 202 ms 100808 KB Output is correct
56 Correct 226 ms 103192 KB Output is correct
57 Correct 217 ms 103372 KB Output is correct
58 Correct 232 ms 98888 KB Output is correct