Submission #796974

# Submission time Handle Problem Language Result Execution time Memory
796974 2023-07-29T02:04:07 Z Github Bank (IZhO14_bank) C++14
100 / 100
104 ms 8516 KB
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <climits>
#include <algorithm>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
const int MOD = 1e9+7;

int main(){
    speedup
    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    for (int i = 0; i < m; i++){
        cin >> b[i];
    }
    pair<int, int> dp[1<<m];
    dp[0] = {0, 0};
    for (int i = 1; i < (1<<m); i++){
        dp[i] = {-1, -1};
        for (int j = 0; j < m; j++){
            if (i&(1<<j)){
                int new_state = i^(1<<j);
                if (dp[new_state] == make_pair(-1, -1)){
                    continue;
                }
                int left_over = dp[new_state].second+b[j];
                int required = a[dp[new_state].first];
                if (left_over < required){
                    if (dp[i].first < dp[new_state].first){
                        dp[i] = {dp[new_state].first, left_over};
                    }
                }else if (left_over == required){
                    dp[i] = {dp[new_state].first+1, 0};
                }
            }
        }
        if (dp[i].first == n){
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 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 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 71 ms 8404 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 75 ms 8504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 2 ms 340 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 340 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 320 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
# 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 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 71 ms 8404 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 75 ms 8504 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 88 ms 8504 KB Output is correct
32 Correct 86 ms 8508 KB Output is correct
33 Correct 73 ms 8504 KB Output is correct
34 Correct 68 ms 8404 KB Output is correct
35 Correct 67 ms 8404 KB Output is correct
36 Correct 74 ms 8500 KB Output is correct
37 Correct 68 ms 8504 KB Output is correct
38 Correct 73 ms 8404 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 73 ms 8404 KB Output is correct
41 Correct 68 ms 8404 KB Output is correct
42 Correct 104 ms 8508 KB Output is correct
43 Correct 72 ms 8404 KB Output is correct
44 Correct 73 ms 8500 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 90 ms 8516 KB Output is correct
47 Correct 70 ms 8508 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 74 ms 8504 KB Output is correct
50 Correct 79 ms 8504 KB Output is correct
51 Correct 73 ms 8504 KB Output is correct
52 Correct 68 ms 8404 KB Output is correct
53 Correct 90 ms 8508 KB Output is correct
54 Correct 85 ms 8504 KB Output is correct
55 Correct 77 ms 8504 KB Output is correct
56 Correct 79 ms 8404 KB Output is correct
57 Correct 80 ms 8404 KB Output is correct
58 Correct 84 ms 8504 KB Output is correct