oj.uz

Submission #245360

# Submission time Handle Problem Language Result Execution time Memory
245360 2020-07-06T06:23:04 Z kshitij_sodani Bank (IZhO14_bank) C++17
100 / 100
 179 ms 47036 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#define endl '\n'
int n,m;
int dp[21][1<<20];
int aa[21];
int bb[21];
int su[1<<20];
vector<int> pre[1001];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>aa[i];
	}
	for(int i=0;i<m;i++){
		cin>>bb[i];
	}
	string ans="NO";
	for(int j=0;j<(1<<m);j++){
		for(int k=0;k<m;k++){
			if((1<<k)&j){
				su[j]=su[j-(1<<k)]+bb[k];
				break;
			}
		}
		if(su[j]<1001){
			pre[su[j]].pb(j);
		}
		/*for(int i=0;i<n;i++){
			if(aa[i]==su[j]){
				pre[i].pb(j);
				if(n==1){
					ans="YES";
				}
			}
		}*/
	}
/*	if(n==1){
		cout<<ans<<endl;
		return 0;
	}*/
	for(int j=0;j<(1<<m);j++){
		dp[n][j]=1;
	}
	vector<int> cur;
	cur.pb(0);
	for(int i=n-1;i>=0;i--){
		vector<int> cur2;
		for(auto j:cur){
			for(auto k:pre[aa[i]]){
				if((k&j)==0){
					if(dp[i][j+k]==0){
						dp[i][j+k]=dp[i+1][j];
						if(dp[i][j+k]){
							if(i==0){
								ans="YES";
							}
							cur2.pb(j+k);
						}
						//cur2.pb(j+k);
					}
					/*if(dp[i][j+]){
						break;
					}*/
				}
			}
			/*for(int k=j;k>0;k=(k-1)&j){
				if(su[k]==aa[i]){
					
				}
			}*/
		}
		cur=cur2;
		/*for(auto j:cur2){
			cout<<i<<","<<j<<endl;;
		}*/
	}
	cout<<ans<<endl;
	return 0;
	if(dp[0][(1<<m)-1]){
		cout<<"YES"<<endl;
	}
	else{
		cout<<"NO"<<endl;
	}






	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 27 ms 14848 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 28 ms 18176 KB Output is correct
9 Correct 25 ms 14456 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 27 ms 14848 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 28 ms 18176 KB Output is correct
9 Correct 25 ms 14456 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 640 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 6 ms 768 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 640 KB Output is correct
31 Correct 28 ms 16128 KB Output is correct
32 Correct 179 ms 22008 KB Output is correct
33 Correct 18 ms 10272 KB Output is correct
34 Correct 15 ms 8832 KB Output is correct
35 Correct 15 ms 8832 KB Output is correct
36 Correct 15 ms 8832 KB Output is correct
37 Correct 15 ms 8704 KB Output is correct
38 Correct 15 ms 8704 KB Output is correct
39 Correct 58 ms 31184 KB Output is correct
40 Correct 20 ms 10240 KB Output is correct
41 Correct 20 ms 9088 KB Output is correct
42 Correct 41 ms 23548 KB Output is correct
43 Correct 22 ms 12544 KB Output is correct
44 Correct 15 ms 8704 KB Output is correct
45 Correct 32 ms 21632 KB Output is correct
46 Correct 23 ms 14080 KB Output is correct
47 Correct 15 ms 8704 KB Output is correct
48 Correct 27 ms 17664 KB Output is correct
49 Correct 25 ms 14456 KB Output is correct
50 Correct 44 ms 37824 KB Output is correct
51 Correct 53 ms 16376 KB Output is correct
52 Correct 145 ms 29380 KB Output is correct
53 Correct 121 ms 35972 KB Output is correct
54 Correct 47 ms 40376 KB Output is correct
55 Correct 44 ms 37824 KB Output is correct
56 Correct 58 ms 46396 KB Output is correct
57 Correct 59 ms 46524 KB Output is correct
58 Correct 59 ms 47036 KB Output is correct