Submission #1182014

#	Time	Username	Problem	Language	Result	Execution time	Memory
1182014		FaresSTH	Bank (IZhO14_bank)	C++20	71 / 100	1097 ms	2496 KiB

bank

#include "bits/stdc++.h"
using namespace std;
int n,m,a[25],b[25],f[1001],cur[1001];
unordered_map<int,bool>memo;
vector<pair<int, int>>s;
bool sol(int i,int used){
    if(i==n){
        for(int j=0;j<n;j++){
            if(cur[a[j]]<f[a[j]])return 0;
        }
        return 1;
    }
    if(memo.find((i<<20)|used)!=memo.end())return memo[(i<<20)|used];
    for(auto[sum,mask]:s){
        if((used&mask)==0&&cur[sum]<f[sum]){
            cur[sum]++;
            if(sol(i+1,used|mask))return memo[(i<<20)|used]=1;
            cur[sum]--;
        }
    }
    return memo[(i<<20)|used]=0;
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>a[i];
        f[a[i]]++;
    }
    for(int i=0;i<m;i++)cin>>b[i];
    for(int mask=0;mask<(1<<m);mask++){
        int sum=0;
        for (int j=0;j<m;j++){
            if(mask&(1<<j))sum+=b[j];
        }
        if(f[sum])s.emplace_back(sum, mask);
    }
    cout<<(sol(0,0)?"YES":"NO");
}

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