oj.uz

Submission #676330

# Submission time Handle Problem Language Result Execution time Memory
676330 2022-12-30T10:48:43 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 181 ms 111200 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define piii pair<pii, int>
#define pllll pair<ll, ll>
#define pb push_back
#define all(v) v.begin(), v.end()
#define size(v) v.size()
#define INF 2e18
#define f first
#define s second

using namespace std;


int n, m;
vector<int>costMask[30005];
int dp[2000000][25];
vector<int>a, b;

int Bank(int mask, int i){
    if(i == 0) return 1;
    if(dp[mask][i] != -1) return dp[mask][i];

    for(int Submask : costMask[a[i]]){
        if((mask & Submask) == Submask){
            if(Bank(mask ^ Submask, i - 1)){
                return dp[mask][i] = 1;
            }
        }
    }
    return dp[mask][i] = 0;
}

void solve(){

    cin >> n >> m;
    a.resize(n + 1), b.resize(m + 1);
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }for(int i = 1; i <= m; ++i){
        cin >> b[i];
    }
    for(int mask = 0; mask < (1 << m); ++mask){
        int Total = 0;
        for(int i = 0; i < m; ++i){
            if(mask & (1 << i)){
                Total += b[i + 1];
            }
        }
        costMask[Total].pb(mask);
    }
    for(int mask = 0; mask < (1 << m); mask++){
        for(int i = 1; i <= n; ++i){
            dp[mask][i] = -1;
        }
    }

    if(Bank((1 << m) - 1, n)) cout << "YES\n";
    else cout << "NO\n";
}

int main(){
    int t;
    t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 104 ms 110128 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 101 ms 108948 KB Output is correct
9 Correct 103 ms 109400 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 4 ms 4308 KB Output is correct
5 Correct 104 ms 110128 KB Output is correct
6 Correct 1 ms 1108 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 101 ms 108948 KB Output is correct
9 Correct 103 ms 109400 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 1108 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 3 ms 2772 KB Output is correct
21 Correct 3 ms 2644 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 3 ms 2772 KB Output is correct
26 Correct 3 ms 2644 KB Output is correct
27 Correct 3 ms 2644 KB Output is correct
28 Correct 3 ms 2772 KB Output is correct
29 Correct 3 ms 2772 KB Output is correct
30 Correct 3 ms 2644 KB Output is correct
31 Correct 107 ms 110048 KB Output is correct
32 Correct 114 ms 109320 KB Output is correct
33 Correct 107 ms 109816 KB Output is correct
34 Correct 131 ms 110172 KB Output is correct
35 Correct 120 ms 111200 KB Output is correct
36 Correct 115 ms 110568 KB Output is correct
37 Correct 112 ms 110924 KB Output is correct
38 Correct 106 ms 110596 KB Output is correct
39 Correct 105 ms 108480 KB Output is correct
40 Correct 112 ms 110448 KB Output is correct
41 Correct 109 ms 109892 KB Output is correct
42 Correct 106 ms 109132 KB Output is correct
43 Correct 104 ms 110712 KB Output is correct
44 Correct 112 ms 110960 KB Output is correct
45 Correct 108 ms 109772 KB Output is correct
46 Correct 107 ms 110792 KB Output is correct
47 Correct 123 ms 110344 KB Output is correct
48 Correct 103 ms 109240 KB Output is correct
49 Correct 115 ms 109520 KB Output is correct
50 Correct 108 ms 108496 KB Output is correct
51 Correct 112 ms 109448 KB Output is correct
52 Correct 181 ms 108368 KB Output is correct
53 Correct 103 ms 108544 KB Output is correct
54 Correct 115 ms 108608 KB Output is correct
55 Correct 112 ms 108544 KB Output is correct
56 Correct 106 ms 108568 KB Output is correct
57 Correct 126 ms 108580 KB Output is correct
58 Correct 107 ms 108588 KB Output is correct