oj.uz

Submission #679290

# Submission time Handle Problem Language Result Execution time Memory
679290 2023-01-08T02:04:18 Z Hacv16 Bank (IZhO14_bank) C++17
71 / 100
 254 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
const int MAX = 21;
const int MAXM = 30005;
const int INF = 0x3f3f3f3f;
 
int n, m, a[MAX], b[MAX];
int dp[MAX][1 << MAX];
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 79 ms 173280 KB Output is correct
2 Correct 70 ms 173328 KB Output is correct
3 Correct 77 ms 173372 KB Output is correct
4 Correct 71 ms 173516 KB Output is correct
5 Correct 100 ms 179708 KB Output is correct
6 Correct 72 ms 173292 KB Output is correct
7 Correct 74 ms 173364 KB Output is correct
8 Correct 112 ms 178804 KB Output is correct
9 Correct 110 ms 179352 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 173328 KB Output is correct
2 Correct 71 ms 173376 KB Output is correct
3 Correct 79 ms 173392 KB Output is correct
4 Correct 71 ms 173364 KB Output is correct
5 Correct 87 ms 173292 KB Output is correct
6 Correct 74 ms 173308 KB Output is correct
7 Correct 71 ms 173288 KB Output is correct
8 Correct 76 ms 173312 KB Output is correct
9 Correct 67 ms 173340 KB Output is correct
10 Correct 74 ms 173340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 173424 KB Output is correct
2 Correct 70 ms 173468 KB Output is correct
3 Correct 72 ms 173520 KB Output is correct
4 Correct 71 ms 173412 KB Output is correct
5 Correct 74 ms 173496 KB Output is correct
6 Correct 68 ms 173452 KB Output is correct
7 Correct 73 ms 173424 KB Output is correct
8 Correct 71 ms 173532 KB Output is correct
9 Correct 73 ms 173488 KB Output is correct
10 Correct 69 ms 173432 KB Output is correct
11 Correct 71 ms 173444 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 173280 KB Output is correct
2 Correct 70 ms 173328 KB Output is correct
3 Correct 77 ms 173372 KB Output is correct
4 Correct 71 ms 173516 KB Output is correct
5 Correct 100 ms 179708 KB Output is correct
6 Correct 72 ms 173292 KB Output is correct
7 Correct 74 ms 173364 KB Output is correct
8 Correct 112 ms 178804 KB Output is correct
9 Correct 110 ms 179352 KB Output is correct
10 Correct 75 ms 173328 KB Output is correct
11 Correct 71 ms 173376 KB Output is correct
12 Correct 79 ms 173392 KB Output is correct
13 Correct 71 ms 173364 KB Output is correct
14 Correct 87 ms 173292 KB Output is correct
15 Correct 74 ms 173308 KB Output is correct
16 Correct 71 ms 173288 KB Output is correct
17 Correct 76 ms 173312 KB Output is correct
18 Correct 67 ms 173340 KB Output is correct
19 Correct 74 ms 173340 KB Output is correct
20 Correct 72 ms 173424 KB Output is correct
21 Correct 70 ms 173468 KB Output is correct
22 Correct 72 ms 173520 KB Output is correct
23 Correct 71 ms 173412 KB Output is correct
24 Correct 74 ms 173496 KB Output is correct
25 Correct 68 ms 173452 KB Output is correct
26 Correct 73 ms 173424 KB Output is correct
27 Correct 71 ms 173532 KB Output is correct
28 Correct 73 ms 173488 KB Output is correct
29 Correct 69 ms 173432 KB Output is correct
30 Correct 71 ms 173444 KB Output is correct
31 Correct 95 ms 179812 KB Output is correct
32 Correct 176 ms 179120 KB Output is correct
33 Correct 101 ms 179468 KB Output is correct
34 Correct 105 ms 179848 KB Output is correct
35 Correct 140 ms 180812 KB Output is correct
36 Correct 137 ms 180380 KB Output is correct
37 Correct 101 ms 180696 KB Output is correct
38 Correct 101 ms 180344 KB Output is correct
39 Correct 109 ms 178312 KB Output is correct
40 Correct 97 ms 180300 KB Output is correct
41 Correct 98 ms 179788 KB Output is correct
42 Correct 99 ms 178828 KB Output is correct
43 Correct 99 ms 180556 KB Output is correct
44 Correct 105 ms 180684 KB Output is correct
45 Correct 95 ms 179584 KB Output is correct
46 Correct 97 ms 180676 KB Output is correct
47 Correct 107 ms 180148 KB Output is correct
48 Correct 94 ms 178984 KB Output is correct
49 Correct 93 ms 179144 KB Output is correct
50 Runtime error 254 ms 262144 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -