제출 #911352

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
911352		ilef	Bank (IZhO14_bank)	C++14	100 / 100	108 ms	8644 KiB

bank

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    int b[m];
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    vector<int>covered(1<<m,-1);
    vector<int>left(1<<m,-1);
    left[0]=0;
    covered[0]=0;
    for(int mask=1;mask<(1<<m);mask++){
        for(int j=0;j<m;j++){
            if((1<<j)&mask && covered[mask^(1<<j)]!=-1){
                int msk=mask^(1<<j);
                int cur=a[covered[msk]];
                int amt=left[msk]+b[j];
                if(amt<cur){
                    covered[mask]=covered[msk];
                    left[mask]=amt;
                }
                else if(amt==cur){
                     covered[mask]=covered[msk]+1;
                    left[mask]=0;
                }
            }
        }
         if(covered[mask]==n){
        cout<<"YES"<<endl;
        return 0;
    }
    }
        cout<<"NO"<<endl;
}

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