제출 #770951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
770951		matei__b	은행 (IZhO14_bank)	C++14	100 / 100	112 ms	8652 KiB

bank

#include <bits/stdc++.h>
#define ll long long 
#define mod 1000000007
#define dim 100002
#define lim 1000000
#define mdim 1501
#define mult 2e9
#define maxx 200000
#define simaimult 1e17
#define piii pair<int,pair<int,int> > 
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define nr_biti __builtin_popcount
using namespace std;

ifstream fin("b.in");
ofstream fout("b.out");

int n,m;
int a[22],b[22];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> n >> m;

    for(int i=0; i<n; i++)
        cin >> a[i];
    
    for(int i=0; i<m; i++)
        cin >> b[i];

    vector<int> dp(1<<m,-1);
    vector<int> rest(1<<m,-1);

    dp[0]=rest[0]=0;

    for(int i=1; i<(1<<m); i++)
    {
        for(int j=0; j<m; j++)
        {
            if(!(i&(1<<j)))
                continue;
            if(dp[i^(1<<j)]==-1)
                continue;
            
            if(rest[i^(1<<j)]+b[j]<a[dp[i^(1<<j)]])
            {
                dp[i]=dp[i^(1<<j)];
                rest[i]=rest[i^(1<<j)]+b[j];
            }
            else if(rest[i^(1<<j)]+b[j]==a[dp[i^(1<<j)]])
            {
                dp[i]=dp[i^(1<<j)]+1;
                rest[i]=0;
            }
        }

        if(dp[i]==n)
        {
            cout << "YES";
            return 0;
        }
    }

    cout << "NO";

    return 0;
}

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