Submission #864409

#	Time	Username	Problem	Language	Result	Execution time	Memory
864409		PM1	Bank (IZhO14_bank)	C++17	71 / 100	134 ms	4484 KiB

bank

#include <bits/stdc++.h>
using namespace std;
const int mxn=20;
int n,m,a[mxn],b[mxn],dp[(1<<20)],ps[20];
int main(){
	cin>>n>>m;
	if(n>m){
		cout<<"NO";
		return 0;
	}
	for(int i=1;i<=n;i++){
		cin>>a[i];
		ps[i]=ps[i-1]+a[i];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	for(int mask=1;mask<(1<<m);mask++){
		int sum=0;
		for(int i=0;i<m;i++){
			if(mask&(1<<i)){
				sum+=b[i+1];
			}
		}
		for(int i=0;i<m;i++){
			if(mask&(1<<i)){
				dp[mask]=max(dp[mask],dp[mask-(1<<i)]+(sum==ps[dp[mask-(1<<i)]+1]));
			}
		}
	}
	if(dp[(1<<m)-1]==n){
		cout<<"YES"<<endl;
	}
	else{
		cout<<"NO";
	}
}

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