Submission #1082307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082307		Malix	Bank (IZhO14_bank)	C++14	100 / 100	88 ms	16844 KiB

bank

#include <bits/stdc++.h>
using namespace std;

#define REP(a,b,c) for(int a=b;a<c;a++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<ll,int> pi;
typedef vector<pi> pii;

ll M=1000000007;
ll INF=1000000000000000010;
int inf=1000000010;

int n,m;
vi a,b;

int main(){
    cin>>n>>m;
    a.resize(n);b.resize(m);
    REP(i,0,n)cin>>a[i];
    REP(i,0,m)cin>>b[i];
    int k=pow(2,m);
    pii dp(k,{-1,-1});
    dp[0]={0,0};
    REP(i,1,k){
        REP(j,0,m)if(i&(1<<j)){
            int ps=i^(1<<j);
            if(dp[ps].F==-1)continue;
            if(dp[ps].S+b[j]==a[dp[ps].F]){
                dp[i].F=dp[ps].F+1;
                dp[i].S=0;
                break;
            }
            else if(dp[i].F<=dp[ps].F){
                dp[i].F=dp[ps].F;
                dp[i].S=dp[ps].S+b[j];
            }
        }
        if(dp[i].F==n){
            cout<<"YES\n";
            return 0;
        }
    }
    cout<<"NO\n";
}

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