oj.uz

Submission #679296

# Submission time Handle Problem Language Result Execution time Memory
679296 2023-01-08T02:08:56 Z Hacv16 Bank (IZhO14_bank) C++17
100 / 100
 675 ms 110952 KB 
#include<bits/stdc++.h>
using namespace std;
 
const int MAX = 25;
const int MAXM = 25500;
const int INF = 0x3f3f3f3f;
 
int n, m, a[MAX], b[MAX];
int dp[MAX][(1 << 20) + 5];
vector<int> g[MAXM];

int solve(int i, int mask){ //current index, who I have already used
    if(dp[i][mask] != -1) return dp[i][mask];
    if(i == n + 1) return true;

    int targ = a[i], resp = 0;

    for(auto sub : g[targ]){
        if((sub & mask) != 0) continue;
        if(solve(i + 1, mask | sub)) resp = 1;
    }

    return dp[i][mask] = resp;
}
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    cin >> n >> m;
 
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
 
    for(int mask = 0; mask < (1 << m); mask++){
        int cur = 0;

        for(int i = 0; i < m; i++)
            if(mask & (1 << i)) cur += b[i];

        g[cur].emplace_back(mask);
    }

    memset(dp, -1, sizeof(dp));
 
    cout << (solve(1, 0) ? "YES" : "NO") << '\n';
 
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 103500 KB Output is correct
2 Correct 43 ms 103404 KB Output is correct
3 Correct 39 ms 103460 KB Output is correct
4 Correct 39 ms 103704 KB Output is correct
5 Correct 106 ms 109848 KB Output is correct
6 Correct 38 ms 103444 KB Output is correct
7 Correct 38 ms 103508 KB Output is correct
8 Correct 99 ms 108876 KB Output is correct
9 Correct 107 ms 109492 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 103396 KB Output is correct
2 Correct 38 ms 103444 KB Output is correct
3 Correct 38 ms 103452 KB Output is correct
4 Correct 45 ms 103428 KB Output is correct
5 Correct 46 ms 103492 KB Output is correct
6 Correct 38 ms 103428 KB Output is correct
7 Correct 41 ms 103468 KB Output is correct
8 Correct 39 ms 103500 KB Output is correct
9 Correct 40 ms 103524 KB Output is correct
10 Correct 37 ms 103404 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 103604 KB Output is correct
2 Correct 40 ms 103548 KB Output is correct
3 Correct 39 ms 103628 KB Output is correct
4 Correct 38 ms 103512 KB Output is correct
5 Correct 39 ms 103556 KB Output is correct
6 Correct 43 ms 103564 KB Output is correct
7 Correct 38 ms 103528 KB Output is correct
8 Correct 39 ms 103608 KB Output is correct
9 Correct 40 ms 103580 KB Output is correct
10 Correct 47 ms 103584 KB Output is correct
11 Correct 38 ms 103516 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 103500 KB Output is correct
2 Correct 43 ms 103404 KB Output is correct
3 Correct 39 ms 103460 KB Output is correct
4 Correct 39 ms 103704 KB Output is correct
5 Correct 106 ms 109848 KB Output is correct
6 Correct 38 ms 103444 KB Output is correct
7 Correct 38 ms 103508 KB Output is correct
8 Correct 99 ms 108876 KB Output is correct
9 Correct 107 ms 109492 KB Output is correct
10 Correct 38 ms 103396 KB Output is correct
11 Correct 38 ms 103444 KB Output is correct
12 Correct 38 ms 103452 KB Output is correct
13 Correct 45 ms 103428 KB Output is correct
14 Correct 46 ms 103492 KB Output is correct
15 Correct 38 ms 103428 KB Output is correct
16 Correct 41 ms 103468 KB Output is correct
17 Correct 39 ms 103500 KB Output is correct
18 Correct 40 ms 103524 KB Output is correct
19 Correct 37 ms 103404 KB Output is correct
20 Correct 39 ms 103604 KB Output is correct
21 Correct 40 ms 103548 KB Output is correct
22 Correct 39 ms 103628 KB Output is correct
23 Correct 38 ms 103512 KB Output is correct
24 Correct 39 ms 103556 KB Output is correct
25 Correct 43 ms 103564 KB Output is correct
26 Correct 38 ms 103528 KB Output is correct
27 Correct 39 ms 103608 KB Output is correct
28 Correct 40 ms 103580 KB Output is correct
29 Correct 47 ms 103584 KB Output is correct
30 Correct 38 ms 103516 KB Output is correct
31 Correct 104 ms 109944 KB Output is correct
32 Correct 198 ms 109128 KB Output is correct
33 Correct 114 ms 109604 KB Output is correct
34 Correct 104 ms 109968 KB Output is correct
35 Correct 110 ms 110952 KB Output is correct
36 Correct 109 ms 110488 KB Output is correct
37 Correct 118 ms 110840 KB Output is correct
38 Correct 105 ms 110556 KB Output is correct
39 Correct 120 ms 108380 KB Output is correct
40 Correct 102 ms 110396 KB Output is correct
41 Correct 111 ms 109912 KB Output is correct
42 Correct 105 ms 108936 KB Output is correct
43 Correct 103 ms 110688 KB Output is correct
44 Correct 110 ms 110844 KB Output is correct
45 Correct 101 ms 109772 KB Output is correct
46 Correct 108 ms 110848 KB Output is correct
47 Correct 105 ms 110280 KB Output is correct
48 Correct 99 ms 109124 KB Output is correct
49 Correct 105 ms 109328 KB Output is correct
50 Correct 258 ms 108368 KB Output is correct
51 Correct 101 ms 109268 KB Output is correct
52 Correct 106 ms 108348 KB Output is correct
53 Correct 675 ms 108368 KB Output is correct
54 Correct 299 ms 108312 KB Output is correct
55 Correct 270 ms 108304 KB Output is correct
56 Correct 237 ms 108576 KB Output is correct
57 Correct 251 ms 108516 KB Output is correct
58 Correct 257 ms 108580 KB Output is correct