oj.uz

Submission #679268

# Submission time Handle Problem Language Result Execution time Memory
679268 2023-01-08T00:54:57 Z Hacv16 Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 4816 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAX = 21;
const int MAXM = 30005;
const int INF = 0x3f3f3f3f;

int n, m, a[MAX], b[MAX], sums[1 << MAX];
bool dp[MAX][1 << MAX], dp2[MAXM];

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];

    if(n == 1){
        dp2[0] = true;

        for(int i = 0; i < m; i++)
            for(int j = MAXM - 1; j >= 0; j--)
                if(j >= b[i]) dp2[j] |= dp2[j - b[i]];

        cout << (dp2[a[1]] ? "YES" : "NO") << '\n';

        exit(0);
    }

    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];

        sums[mask] = cur;
    }

    dp[0][0] = true;

    for(int i = 1; i <= n; i++){
        for(int mask = 0; mask < (1 << m); mask++){
            for(int sub = mask; sub > 0; sub = (sub - 1) & mask)
                dp[i][mask] |= (dp[i - 1][mask ^ sub] && sums[sub] == a[i]);
        }
    }

    bool pos = false;

    for(int mask = 0; mask < (1 << m); mask++)
        pos |= dp[n][mask];

    cout << (pos ? "YES" : "NO") << '\n';

    exit(0);
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 352 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 528 KB Output is correct
2 Correct 15 ms 444 KB Output is correct
3 Correct 51 ms 544 KB Output is correct
4 Correct 70 ms 696 KB Output is correct
5 Correct 52 ms 572 KB Output is correct
6 Correct 32 ms 428 KB Output is correct
7 Correct 27 ms 448 KB Output is correct
8 Correct 16 ms 464 KB Output is correct
9 Correct 40 ms 472 KB Output is correct
10 Correct 39 ms 500 KB Output is correct
11 Correct 68 ms 688 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 34 ms 528 KB Output is correct
21 Correct 15 ms 444 KB Output is correct
22 Correct 51 ms 544 KB Output is correct
23 Correct 70 ms 696 KB Output is correct
24 Correct 52 ms 572 KB Output is correct
25 Correct 32 ms 428 KB Output is correct
26 Correct 27 ms 448 KB Output is correct
27 Correct 16 ms 464 KB Output is correct
28 Correct 40 ms 472 KB Output is correct
29 Correct 39 ms 500 KB Output is correct
30 Correct 68 ms 688 KB Output is correct
31 Execution timed out 1092 ms 4816 KB Time limit exceeded
32 Halted 0 ms 0 KB -