oj.uz

Submission #679267

# Submission time Handle Problem Language Result Execution time Memory
679267 2023-01-08T00:52:23 Z Hacv16 Bank (IZhO14_bank) C++17
52 / 100
 68 ms 716 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAX = 21;
const int MAXM = 2005;
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 = 1; i <= n; i++)
            for(int j = MAXM - 1; j >= 0; j--)
                if(j >= b[i - 1]) dp2[j] |= dp2[j - b[i - 1]];

        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
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 468 KB Output is correct
2 Correct 20 ms 464 KB Output is correct
3 Correct 61 ms 600 KB Output is correct
4 Correct 68 ms 716 KB Output is correct
5 Correct 57 ms 532 KB Output is correct
6 Correct 26 ms 496 KB Output is correct
7 Correct 22 ms 436 KB Output is correct
8 Correct 16 ms 468 KB Output is correct
9 Correct 49 ms 568 KB Output is correct
10 Correct 39 ms 468 KB Output is correct
11 Correct 67 ms 664 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -