oj.uz

Submission #961601

# Submission time Handle Problem Language Result Execution time Memory
961601 2024-04-12T08:45:00 Z blacktulip Bank (IZhO14_bank) C++17
19 / 100
 79 ms 86872 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){cout<<"YES\n";exit(0);}
	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));
			break;
		}
	}
	return dp[sira][mask]=cevv;
}

int 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";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 86480 KB Output is correct
2 Correct 13 ms 86872 KB Output is correct
3 Correct 12 ms 86364 KB Output is correct
4 Correct 12 ms 86488 KB Output is correct
5 Correct 79 ms 86364 KB Output is correct
6 Correct 12 ms 86620 KB Output is correct
7 Correct 14 ms 86376 KB Output is correct
8 Correct 13 ms 86444 KB Output is correct
9 Correct 75 ms 86588 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 86620 KB Output is correct
2 Correct 12 ms 86620 KB Output is correct
3 Correct 13 ms 86620 KB Output is correct
4 Correct 12 ms 86616 KB Output is correct
5 Correct 12 ms 86620 KB Output is correct
6 Incorrect 12 ms 86528 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 86620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 86480 KB Output is correct
2 Correct 13 ms 86872 KB Output is correct
3 Correct 12 ms 86364 KB Output is correct
4 Correct 12 ms 86488 KB Output is correct
5 Correct 79 ms 86364 KB Output is correct
6 Correct 12 ms 86620 KB Output is correct
7 Correct 14 ms 86376 KB Output is correct
8 Correct 13 ms 86444 KB Output is correct
9 Correct 75 ms 86588 KB Output is correct
10 Correct 12 ms 86620 KB Output is correct
11 Correct 12 ms 86620 KB Output is correct
12 Correct 13 ms 86620 KB Output is correct
13 Correct 12 ms 86616 KB Output is correct
14 Correct 12 ms 86620 KB Output is correct
15 Incorrect 12 ms 86528 KB Output isn't correct
16 Halted 0 ms 0 KB -