Submission #980438

# Submission time Handle Problem Language Result Execution time Memory
980438 2024-05-12T07:22:52 Z 54skyxenon Bank (IZhO14_bank) C++17
100 / 100
111 ms 8792 KB
// https://oj.uz/problem/view/IZhO14_bank 

#include <bits/stdc++.h>
using namespace std;

pair<int, int> better(pair<int, int> p1, pair<int, int> p2) {
    if (p1.first != p2.first) {
        return p1.first > p2.first ? p1 : p2;
    }
    return p1.second >= p2.second ? p1 : p2;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    vector<int> A(n);
    for (int& a : A) {
        cin >> a;
    }

    vector<int> B(m);
    for (int& b : B) {
        cin >> b;
    }

    vector<pair<int, int>> dp(1 << m);

    for (int bitmask = 1; bitmask < (1 << m); bitmask++) {
        for (int last = 0; last < m; last++) {
            if (!(bitmask & (1 << last))) {
                continue;
            }

            int previous = bitmask ^ (1 << last);
            auto [employee, remaining] = dp[previous];
            int sum = remaining + B[last];

            // Matches the current employee's salary, can go to the next one
            pair<int, int> state;
            if (sum == A[employee]) {
                state = {employee + 1, 0};
            }
            // Push this banknote onto the leftover amount
            else {
                state = {employee, sum};
            }

            dp[bitmask] = better(dp[bitmask], state);
        }

        if (dp[bitmask].first == n) {
            cout << "YES\n";
            return 0;
        }
    }

    cout << "NO\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 85 ms 8540 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 82 ms 8540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 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 600 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 85 ms 8540 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 82 ms 8540 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 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 600 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 388 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 95 ms 8536 KB Output is correct
32 Correct 95 ms 8540 KB Output is correct
33 Correct 99 ms 8540 KB Output is correct
34 Correct 91 ms 8540 KB Output is correct
35 Correct 96 ms 8792 KB Output is correct
36 Correct 85 ms 8536 KB Output is correct
37 Correct 88 ms 8540 KB Output is correct
38 Correct 83 ms 8540 KB Output is correct
39 Correct 2 ms 8536 KB Output is correct
40 Correct 84 ms 8540 KB Output is correct
41 Correct 84 ms 8736 KB Output is correct
42 Correct 111 ms 8536 KB Output is correct
43 Correct 91 ms 8540 KB Output is correct
44 Correct 83 ms 8540 KB Output is correct
45 Correct 3 ms 8540 KB Output is correct
46 Correct 101 ms 8536 KB Output is correct
47 Correct 85 ms 8540 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 84 ms 8536 KB Output is correct
50 Correct 87 ms 8540 KB Output is correct
51 Correct 91 ms 8540 KB Output is correct
52 Correct 90 ms 8536 KB Output is correct
53 Correct 95 ms 8792 KB Output is correct
54 Correct 93 ms 8540 KB Output is correct
55 Correct 86 ms 8540 KB Output is correct
56 Correct 88 ms 8540 KB Output is correct
57 Correct 88 ms 8792 KB Output is correct
58 Correct 89 ms 8540 KB Output is correct