oj.uz

Submission #852644

# Submission time Handle Problem Language Result Execution time Memory
852644 2023-09-22T09:51:48 Z batsukh2006 Bank (IZhO14_bank) C++11
100 / 100
 358 ms 21592 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
 
using namespace std;
 
#define MOD 1000000007
#define int long long
#define endl '\n'

void solve(){
	int n,m; cin>>n>>m;
	int a[n+1],b[m+1];
	int sum=0;
	for(int i=1; i<=n; i++) cin>>a[i];
	for(int i=1; i<=m; i++) cin>>b[i];
	vector<vector<bool> > dp(n+1,vector<bool>(1<<m));
	vector<int> v[200001];
	for(int i=0; i<(1<<m); i++){
		int sum=0;
		for(int j=0; j<m; j++){
			if(i&(1<<j)) sum+=b[j+1];
		}
		v[sum].push_back(i);
	}
	dp[0][0]=1;
	for(int i=1; i<=n; i++){
		for(int j=0; j<(1<<m); j++){
			if(dp[i-1][j]){
				for(int l=0; l<v[a[i]].size(); l++){
					if((j&v[a[i]][l])==0) dp[i][j|v[a[i]][l]]=1;
				}
			}
		}
	}
	for(int i=0; i<(1<<m); i++){
		if(dp[n][i]){
			cout<<"YES";
			return;
		}
	}
	cout<<"NO";
}
signed main(){
	// freopen("file.in", "r", stdin);
	// freopen("file.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	int t=1;
//	cin>>t;
	while(t--){
		solve();
		cout<<endl;
	}
	return 0;
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:45:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int l=0; l<v[a[i]].size(); l++){
      |                  ~^~~~~~~~~~~~~~~
bank.cpp:29:6: warning: unused variable 'sum' [-Wunused-variable]
   29 |  int sum=0;
      |      ^~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 5 ms 5464 KB Output is correct
5 Correct 78 ms 17376 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 3 ms 5152 KB Output is correct
8 Correct 74 ms 16076 KB Output is correct
9 Correct 76 ms 16592 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4952 KB Output is correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 3 ms 4956 KB Output is correct
4 Correct 5 ms 5464 KB Output is correct
5 Correct 78 ms 17376 KB Output is correct
6 Correct 3 ms 4952 KB Output is correct
7 Correct 3 ms 5152 KB Output is correct
8 Correct 74 ms 16076 KB Output is correct
9 Correct 76 ms 16592 KB Output is correct
10 Correct 3 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 3 ms 4952 KB Output is correct
14 Correct 3 ms 4952 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4952 KB Output is correct
17 Correct 3 ms 4952 KB Output is correct
18 Correct 3 ms 4952 KB Output is correct
19 Correct 3 ms 4952 KB Output is correct
20 Correct 4 ms 5208 KB Output is correct
21 Correct 4 ms 5208 KB Output is correct
22 Correct 4 ms 5208 KB Output is correct
23 Correct 4 ms 5212 KB Output is correct
24 Correct 4 ms 5208 KB Output is correct
25 Correct 5 ms 5208 KB Output is correct
26 Correct 5 ms 5208 KB Output is correct
27 Correct 4 ms 5208 KB Output is correct
28 Correct 4 ms 5208 KB Output is correct
29 Correct 4 ms 5208 KB Output is correct
30 Correct 4 ms 5208 KB Output is correct
31 Correct 81 ms 17356 KB Output is correct
32 Correct 139 ms 17248 KB Output is correct
33 Correct 81 ms 17868 KB Output is correct
34 Correct 88 ms 19320 KB Output is correct
35 Correct 85 ms 20940 KB Output is correct
36 Correct 93 ms 21592 KB Output is correct
37 Correct 77 ms 19660 KB Output is correct
38 Correct 79 ms 19408 KB Output is correct
39 Correct 88 ms 16032 KB Output is correct
40 Correct 83 ms 19404 KB Output is correct
41 Correct 90 ms 20428 KB Output is correct
42 Correct 82 ms 16296 KB Output is correct
43 Correct 85 ms 19464 KB Output is correct
44 Correct 89 ms 21352 KB Output is correct
45 Correct 78 ms 17212 KB Output is correct
46 Correct 79 ms 19404 KB Output is correct
47 Correct 88 ms 20428 KB Output is correct
48 Correct 75 ms 16624 KB Output is correct
49 Correct 78 ms 16848 KB Output is correct
50 Correct 151 ms 17640 KB Output is correct
51 Correct 81 ms 17572 KB Output is correct
52 Correct 87 ms 15940 KB Output is correct
53 Correct 358 ms 16280 KB Output is correct
54 Correct 163 ms 17568 KB Output is correct
55 Correct 152 ms 17620 KB Output is correct
56 Correct 152 ms 18436 KB Output is correct
57 Correct 157 ms 18432 KB Output is correct
58 Correct 164 ms 18432 KB Output is correct