Submission #1115626

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115626		tudor_costin	Bank (IZhO14_bank)	C++11	100 / 100	83 ms	11156 KiB

bank

#include <bits/stdc++.h>

using namespace std;
#define int long long
const int Nmax=1005;
vector<int> v[20*Nmax];
int dp[(1<<21)];
int a[25],b[25];
signed main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }
    for(int j=0;j<m;j++) cin>>b[j];
    dp[0]=-1;
    for(int mask=0;mask<(1<<m);mask++)
    {
        int sum=0;
        dp[mask]=-1;
        for(int i=0;i<m;i++)
        {
            if((mask&(1<<i))!=0)
            {
                dp[mask]=max(dp[mask],dp[mask-(1<<i)]);
                sum+=b[i];
            }
        }
        if(sum==a[dp[mask]+1]) dp[mask]++;
    }
    if(dp[(1<<m)-1]==n) cout<<"YES"<<'\n';
    else cout<<"NO"<<'\n';
    return 0;
}

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