oj.uz

Submission #659928

# Submission time Handle Problem Language Result Execution time Memory
659928 2022-11-19T18:10:58 Z a_aguilo Bank (IZhO14_bank) C++14
100 / 100
 572 ms 123484 KB 
#include<bits/stdc++.h>

using namespace std;

int n, m;

int getSum(int mask, int banknotes[]){
    int ans = 0;
    for(int i = 0; i < m; ++i){
        if(mask & (1 << i) ) ans+= banknotes[i];
    }
    return ans;
}

int CanWePay(int person, int mask, vector<vector<int>>& DP, unordered_map<int, vector<int>>& WaysToPay, int salaries[]){
    if(person == n) return true;
    if(mask == ((1<<n)-1)) return false;
    if(DP[mask][person] != -1) return DP[mask][person];
    DP[mask][person] = 0;
    for(int payMask: WaysToPay[salaries[person]]){
        if(!(mask & payMask)){
            if(CanWePay(person+1, mask|payMask, DP, WaysToPay, salaries)){
                DP[mask][person] = 1;
                break;
            }
        }
    }
    return DP[mask][person];
}
int main(){
    cin.tie(NULL);
    ios::sync_with_stdio(false);
    int MaxSal;
    cin >> n >> m;
    int salaries[n];
    int banknotes[m];
    cin >> salaries[0];
    MaxSal = salaries[0];
    for(int i = 1; i < n; ++i) {
        cin >> salaries[i];
        MaxSal = max(MaxSal, salaries[i]);
    }
    for(int i = 0; i < m; ++i) cin >> banknotes[i];
    unordered_map <int, vector<int>> WaysToArrive;
    WaysToArrive.reserve(MaxSal);
    for(int mask = 1; mask < (1<<m); ++mask){
        int SumOfNotes = getSum(mask,banknotes);
        if(SumOfNotes > MaxSal) continue;
        if(WaysToArrive.find(SumOfNotes)== WaysToArrive.end()) WaysToArrive[SumOfNotes] = {mask};
        else WaysToArrive[SumOfNotes].push_back(mask);
    }
    vector<vector<int>> DP(1<<m, vector<int>(n, -1));
    if(CanWePay(0, 0, DP, WaysToArrive, salaries)) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 2132 KB Output is correct
5 Correct 134 ms 57772 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 125 ms 60080 KB Output is correct
9 Correct 143 ms 63272 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1492 KB Output is correct
2 Correct 3 ms 1216 KB Output is correct
3 Correct 2 ms 1432 KB Output is correct
4 Correct 2 ms 1748 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 3 ms 1236 KB Output is correct
7 Correct 3 ms 1236 KB Output is correct
8 Correct 3 ms 1236 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 3 ms 1468 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 6 ms 2132 KB Output is correct
5 Correct 134 ms 57772 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 125 ms 60080 KB Output is correct
9 Correct 143 ms 63272 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 1492 KB Output is correct
21 Correct 3 ms 1216 KB Output is correct
22 Correct 2 ms 1432 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1492 KB Output is correct
25 Correct 3 ms 1236 KB Output is correct
26 Correct 3 ms 1236 KB Output is correct
27 Correct 3 ms 1236 KB Output is correct
28 Correct 2 ms 1492 KB Output is correct
29 Correct 3 ms 1468 KB Output is correct
30 Correct 3 ms 1748 KB Output is correct
31 Correct 123 ms 61344 KB Output is correct
32 Correct 120 ms 59752 KB Output is correct
33 Correct 146 ms 74220 KB Output is correct
34 Correct 119 ms 74192 KB Output is correct
35 Correct 118 ms 90584 KB Output is correct
36 Correct 134 ms 123484 KB Output is correct
37 Correct 109 ms 57748 KB Output is correct
38 Correct 106 ms 57768 KB Output is correct
39 Correct 112 ms 74188 KB Output is correct
40 Correct 123 ms 74156 KB Output is correct
41 Correct 145 ms 123348 KB Output is correct
42 Correct 120 ms 57984 KB Output is correct
43 Correct 132 ms 74228 KB Output is correct
44 Correct 125 ms 106940 KB Output is correct
45 Correct 116 ms 57952 KB Output is correct
46 Correct 115 ms 58012 KB Output is correct
47 Correct 128 ms 107036 KB Output is correct
48 Correct 115 ms 58532 KB Output is correct
49 Correct 104 ms 57656 KB Output is correct
50 Correct 138 ms 123392 KB Output is correct
51 Correct 125 ms 75228 KB Output is correct
52 Correct 112 ms 74172 KB Output is correct
53 Correct 112 ms 74188 KB Output is correct
54 Correct 141 ms 123388 KB Output is correct
55 Correct 145 ms 123400 KB Output is correct
56 Correct 135 ms 123440 KB Output is correct
57 Correct 572 ms 123436 KB Output is correct
58 Correct 142 ms 123324 KB Output is correct