oj.uz

Submission #439813

# Submission time Handle Problem Language Result Execution time Memory
439813 2021-06-30T20:45:50 Z training4usaco Bank (IZhO14_bank) C++11
100 / 100
 132 ms 8524 KB 
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> targets(n);
    vector<int> banknotes(m);

    for(int i = 0; i < n; ++i) {
        cin >> targets[i];
    }
    for(int i = 0; i < m; ++i) {
        cin >> banknotes[i];
    }

    // vector<vector<int>> possiblem(n);   // possible masks of banknotes for each target

    // for(int i = 0; i < n; ++i) {
    //     for(int s = 1; s < (1 << m); ++s) {
    //         int money = 0;
    //         for(int j = 0; j < m; ++j) {
    //             if(s & (1 << j)) {
    //                 money += banknotes[j];
    //             }
    //         }

    //         if(money == targets[i]) {
    //             possiblem[i].push_back(s);
    //         }
    //     }
    // }

    vector<int> num_paid((1 << m), -1);       // number of people covered
    vector<int> unused((1 << m), -1);     // amount of money unused

    num_paid[0] = 0;
    unused[0] = 0;

    bool answered = false;

    for(int mask = 0; mask < (1 << m); ++mask) {
        for(int next = 0; next < m; ++next) {
            if((mask & (1 << next)) == 0) {
                // cout << "next: " << next << endl;
                // cout << mask << ": broke" << endl;
                continue;
            }
            // cout << mask << ": didn't break" << endl;
            int prevm = (mask ^ (1 << next));
            // cout << "prevm: " << prevm << endl;
            if(num_paid[prevm] != -1) {
                // cout << "prevm isn't -1" << endl;
                int money = unused[prevm] + banknotes[next];

                if(money < targets[num_paid[prevm]]) {
                    num_paid[mask] = num_paid[prevm];
                    unused[mask] = money;
                }
                else if(money == targets[num_paid[prevm]]) {
                    num_paid[mask] = num_paid[prevm] + 1;
                    unused[mask] = 0;
                }
                else if(unused[prevm] == targets[num_paid[prevm]]) {
                    num_paid[mask] = num_paid[prevm] + 1;
                    unused[mask] = banknotes[next];
                }
            }
        }
        if(num_paid[mask] == n) {
            cout << "YES" << endl;
            answered = true;
            break;
        }
    }

    for(int i = 0; i < (1 << m); ++i) {
        // cout << i << ": " << num_paid[i] << " " << unused[i] << endl;
    }

    if(!answered) {
        cout << "NO" << endl;
    }

}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 77 ms 8396 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 5 ms 8524 KB Output is correct
9 Correct 106 ms 8496 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 77 ms 8396 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 5 ms 8524 KB Output is correct
9 Correct 106 ms 8496 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 420 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 117 ms 8500 KB Output is correct
32 Correct 125 ms 8396 KB Output is correct
33 Correct 89 ms 8496 KB Output is correct
34 Correct 77 ms 8500 KB Output is correct
35 Correct 85 ms 8500 KB Output is correct
36 Correct 79 ms 8396 KB Output is correct
37 Correct 86 ms 8496 KB Output is correct
38 Correct 78 ms 8396 KB Output is correct
39 Correct 5 ms 8524 KB Output is correct
40 Correct 79 ms 8396 KB Output is correct
41 Correct 77 ms 8496 KB Output is correct
42 Correct 130 ms 8500 KB Output is correct
43 Correct 88 ms 8512 KB Output is correct
44 Correct 78 ms 8428 KB Output is correct
45 Correct 7 ms 8396 KB Output is correct
46 Correct 105 ms 8396 KB Output is correct
47 Correct 85 ms 8396 KB Output is correct
48 Correct 5 ms 8480 KB Output is correct
49 Correct 84 ms 8396 KB Output is correct
50 Correct 110 ms 8396 KB Output is correct
51 Correct 81 ms 8504 KB Output is correct
52 Correct 82 ms 8396 KB Output is correct
53 Correct 132 ms 8488 KB Output is correct
54 Correct 120 ms 8396 KB Output is correct
55 Correct 116 ms 8508 KB Output is correct
56 Correct 109 ms 8500 KB Output is correct
57 Correct 107 ms 8504 KB Output is correct
58 Correct 108 ms 8500 KB Output is correct