Submission #961589

# Submission time Handle Problem Language Result Execution time Memory
961589 2024-04-12T08:38:12 Z blacktulip Bank (IZhO14_bank) C++17
71 / 100
1000 ms 172892 KB
#include<bits/stdc++.h>
 
using namespace std;
 
#define int long long
#define pb push_back
#define fi first
#define se second
 
const int li=21;
int n,m,a[li],b[li],dp[li][(1<<20)];

inline int f(int sira,int mask){
	int cevv=0;
	if(sira>n)return 1;
	if(~dp[sira][mask])return dp[sira][mask];
	vector<int> v;
	for(int i=0;i<m;i++){
		if(mask&(1<<i))continue;
		v.pb(i);
	}
	int siz=v.size();
	for(int i=0;i<(1<<siz);i++){
		int sum=0;
		int mask2=0;
		for(int j=0;j<siz;j++){
			if(i&(1<<j)){
				sum+=b[v[j]];
				mask2|=(1<<v[j]);
			}
		}
		//~ cout<<sum<<" () "<<sira<<" () "<<i<<endl;
		if(sum==a[sira])cevv=max(cevv,f(sira+1,mask|mask2));
	}
	return dp[sira][mask]=cevv;
}

int32_t main(){
	cin>>n>>m;
	memset(dp,-1,sizeof(dp));
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=0;i<m;i++)cin>>b[i];
	int cev=f(1,0);
	if(cev)cout<<"YES\n";
	else cout<<"NO\n";
}
# Verdict Execution time Memory Grader output
1 Correct 62 ms 172776 KB Output is correct
2 Correct 28 ms 172892 KB Output is correct
3 Correct 24 ms 172636 KB Output is correct
4 Correct 26 ms 172532 KB Output is correct
5 Correct 95 ms 172764 KB Output is correct
6 Correct 23 ms 172636 KB Output is correct
7 Correct 23 ms 172588 KB Output is correct
8 Correct 92 ms 172624 KB Output is correct
9 Correct 94 ms 172772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 172632 KB Output is correct
2 Correct 22 ms 172636 KB Output is correct
3 Correct 26 ms 172636 KB Output is correct
4 Correct 22 ms 172728 KB Output is correct
5 Correct 23 ms 172636 KB Output is correct
6 Correct 22 ms 172632 KB Output is correct
7 Correct 23 ms 172636 KB Output is correct
8 Correct 23 ms 172636 KB Output is correct
9 Correct 25 ms 172680 KB Output is correct
10 Correct 22 ms 172624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 24 ms 172676 KB Output is correct
2 Correct 24 ms 172680 KB Output is correct
3 Correct 24 ms 172888 KB Output is correct
4 Correct 23 ms 172608 KB Output is correct
5 Correct 24 ms 172628 KB Output is correct
6 Correct 23 ms 172636 KB Output is correct
7 Correct 24 ms 172780 KB Output is correct
8 Correct 24 ms 172636 KB Output is correct
9 Correct 24 ms 172636 KB Output is correct
10 Correct 23 ms 172700 KB Output is correct
11 Correct 23 ms 172572 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 62 ms 172776 KB Output is correct
2 Correct 28 ms 172892 KB Output is correct
3 Correct 24 ms 172636 KB Output is correct
4 Correct 26 ms 172532 KB Output is correct
5 Correct 95 ms 172764 KB Output is correct
6 Correct 23 ms 172636 KB Output is correct
7 Correct 23 ms 172588 KB Output is correct
8 Correct 92 ms 172624 KB Output is correct
9 Correct 94 ms 172772 KB Output is correct
10 Correct 23 ms 172632 KB Output is correct
11 Correct 22 ms 172636 KB Output is correct
12 Correct 26 ms 172636 KB Output is correct
13 Correct 22 ms 172728 KB Output is correct
14 Correct 23 ms 172636 KB Output is correct
15 Correct 22 ms 172632 KB Output is correct
16 Correct 23 ms 172636 KB Output is correct
17 Correct 23 ms 172636 KB Output is correct
18 Correct 25 ms 172680 KB Output is correct
19 Correct 22 ms 172624 KB Output is correct
20 Correct 24 ms 172676 KB Output is correct
21 Correct 24 ms 172680 KB Output is correct
22 Correct 24 ms 172888 KB Output is correct
23 Correct 23 ms 172608 KB Output is correct
24 Correct 24 ms 172628 KB Output is correct
25 Correct 23 ms 172636 KB Output is correct
26 Correct 24 ms 172780 KB Output is correct
27 Correct 24 ms 172636 KB Output is correct
28 Correct 24 ms 172636 KB Output is correct
29 Correct 23 ms 172700 KB Output is correct
30 Correct 23 ms 172572 KB Output is correct
31 Correct 281 ms 172772 KB Output is correct
32 Execution timed out 1050 ms 172644 KB Time limit exceeded
33 Halted 0 ms 0 KB -