Submission #640839

#	Time	Username	Problem	Language	Result	Execution time	Memory
640839		phoenix	Bank (IZhO14_bank)	C++17	71 / 100	1091 ms	5800 KiB

bank

#include<bits/stdc++.h>

using namespace std;

const int N = 20; const int M = 20;

int n, m;
int a[ N ], b[ M ];
int w[(1 << M)], dp[(1 << M)];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 0;i < n;i++) 
        cin >> a[ i ];
    for(int i = 0;i < m;i++) 
        cin >> b[ i ];
    if(n == 1) {
        bool dp[ 1001 ] = {};
        dp[ 0 ] = 1;
        for(int i = 0;i < m;i++) {
            for(int x = 1000;x >= b[ i ];x--) {
                dp[ x ] |= dp[x - b[ i ]];
            }
        }
        cout << (dp[ a[ 0 ] ] ? "YES" : "NO");
    } else {
        for(int msk = 1;msk < (1 << m);msk++) 
            for(int i = 0;i < m;i++) 
                if(msk & (1 << i)) 
                    w[ msk ] += b[ i ];
 
        for(int msk = 1;msk < (1 << m);msk++) {
            for(int m = msk;m > 0;m = msk & (m - 1)) {
                dp[ msk ] = max(dp[ msk ], dp[(msk ^ m)] + (w[ m ] == a[ dp[(msk ^ m)] ]));
            }
        }
        cout << (dp[ (1 << m) - 1 ] == n ? "YES\n" : "NO\n");
    }
}

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 0 / 29