Submission #936531

#	Time	Username	Problem	Language	Result	Execution time	Memory
936531		tamir1	Bank (IZhO14_bank)	C++14	100 / 100	240 ms	98964 KiB

bank

#include<bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
int n,m,i,j;
set<pair<int,int>> dp[(1<<20)];
int main(){
	cin >> n >> m;
	vector<int> a(n);
	vector<int> b(m);
	dp[0].insert({0,0});
	for(i=0;i<n;i++) cin >> a[i];
	for(i=0;i<m;i++) cin >> b[i];
	for(i=1;i<(1<<m);i++){
		for(j=0;j<m;j++){
			if(i&(1<<j)){
				for(pair<int,int> l:dp[i^(1<<j)]){
					if(l.ss+b[j]>a[l.ff]) continue;
					if(l.ss+b[j]==a[l.ff]){
						if(l.ff==n-1){
							cout << "YES";
							return 0;
						}
						dp[i].insert({l.ff+1,0});
					}
					else dp[i].insert({l.ff,l.ss+b[j]});
				}
			}
		}
	}
	cout << "NO";
}

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