Submission #843758

#	Time	Username	Problem	Language	Result	Execution time	Memory
843758		Pa_sha	은행 (IZhO14_bank)	C++17	0 / 100	17 ms	4440 KiB

bank

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
constexpr int mod=1e9+7;
pair<int,bitset<2001>>dp[(1ll<<20)];
void solve()
{
    int n,m;
    cin>>n>>m;
    int a[n+2]={0},b[m+1];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int i=1;i<=m;i++)
    {
        cin>>b[i];
    }
    a[n+1]=1e8;
    dp[0].first=1;
    for(int s=1;s<(1ll<<m);s++)
    {
        for(int i=1;i<=m;i++)
        {
            if(!((s>>(i-1))&1)||dp[s].first>=n)
            {
                continue;
            }
            int h=(s^(1ll<<(i-1)));
            if(dp[h].first<dp[s].first)
            {
                continue;
            }
            if(dp[h].first>dp[s].first)
            {
                dp[s].first=dp[h].first;
                dp[s].second=(dp[s].second<<b[i]);
                if((dp[s].second>>a[dp[s].first]).any())
                {
                    dp[s].second>>=a[dp[s].first];
                    dp[s].first++;
                }
                continue;
            }
            dp[s].second|=(dp[s].second<<b[i]);
            if((dp[s].second>>a[dp[s].first]).any())
            {
                dp[s].second>>=a[dp[s].first];
                dp[s].first++;
            }
        }
    }
    cout<<(dp[(1ll<<m)-1].first>=n?"YES":"NO")<<endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
//    cin>>t;
    while(t--)
    {
        solve();
    }
}

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