oj.uz

Submission #485422

# Submission time Handle Problem Language Result Execution time Memory
485422 2021-11-07T17:32:54 Z danielliu04 Bank (IZhO14_bank) C++17
100 / 100
 119 ms 8516 KB 
// Link: https://cses.fi/problemset/task/2181

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

#define ll long long
#define lc (node<<1)+1
#define rc (node<<1)+2
#define endl '\n'
#define INF 1e9

const int max_n = 20;

int n, m;

int ppl[max_n];
int notes[max_n];

pair<int, int> dp[(1 << max_n)];

int main() {
	
	cin.tie(0);
    ios::sync_with_stdio(0);    
	
    cin >> n >> m;

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

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

    // maximum possible value is {n, 0};
    for(int i = 0; i < (1 << m); i ++){
        dp[i] = {0, 0};
    }

    for(int i = 0; i < (1 << m) - 1; i ++){

        int current = dp[i].first;
        int curr_w = dp[i].second;

        for(int j = 0; j < m; j ++){

            if((1 << j) & i) continue;

            if(current == n) dp[i | (1 << j)] = {n, 0};
            else{
                if(curr_w + notes[j] == ppl[current]){
                    dp[i | (1 << j)] = max(dp[i | (1 << j)], {current + 1, 0});
                }
                else if(curr_w + notes[j] < ppl[current]){
                    dp[i | (1 << j)] = max(dp[i | (1 << j)], {current, curr_w + notes[j]});
                }   
                else{
                    dp[i | (1 << j)] = max(dp[i | (1 << j)], dp[i]);
                }
            }
        }
    }

    if(dp[(1 << m) - 1].first == n) cout << "YES" << endl;
    else cout << "NO" << endl;

}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 72 ms 8500 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 94 ms 8396 KB Output is correct
9 Correct 75 ms 8396 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 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 332 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 1 ms 448 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 72 ms 8500 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 94 ms 8396 KB Output is correct
9 Correct 75 ms 8396 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 332 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 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 2 ms 448 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 2 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 89 ms 8500 KB Output is correct
32 Correct 91 ms 8516 KB Output is correct
33 Correct 99 ms 8496 KB Output is correct
34 Correct 85 ms 8512 KB Output is correct
35 Correct 86 ms 8500 KB Output is correct
36 Correct 77 ms 8396 KB Output is correct
37 Correct 82 ms 8396 KB Output is correct
38 Correct 75 ms 8396 KB Output is correct
39 Correct 66 ms 8396 KB Output is correct
40 Correct 82 ms 8396 KB Output is correct
41 Correct 74 ms 8500 KB Output is correct
42 Correct 115 ms 8516 KB Output is correct
43 Correct 88 ms 8396 KB Output is correct
44 Correct 72 ms 8496 KB Output is correct
45 Correct 119 ms 8396 KB Output is correct
46 Correct 107 ms 8504 KB Output is correct
47 Correct 77 ms 8512 KB Output is correct
48 Correct 83 ms 8504 KB Output is correct
49 Correct 73 ms 8396 KB Output is correct
50 Correct 79 ms 8512 KB Output is correct
51 Correct 84 ms 8396 KB Output is correct
52 Correct 78 ms 8396 KB Output is correct
53 Correct 90 ms 8396 KB Output is correct
54 Correct 79 ms 8396 KB Output is correct
55 Correct 74 ms 8396 KB Output is correct
56 Correct 76 ms 8516 KB Output is correct
57 Correct 74 ms 8396 KB Output is correct
58 Correct 74 ms 8512 KB Output is correct