oj.uz

Submission #738476

# Submission time Handle Problem Language Result Execution time Memory
738476 2023-05-08T20:10:04 Z MODDI Bank (IZhO14_bank) C++14
100 / 100
 418 ms 28356 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int n, m;
vi banknotes, salary;
bool check_bit(int n, int bit){
	int ok = n & (1 << bit);
	if(ok)	return true;
	return false;
}
int set_bit(int n, int b){
	return (n | (1 << b));
}
bool can[21][1001], dp[2][1001][(1<<14)];
int main(){
	cin>>n>>m;
	banknotes.resize(m);
	salary.resize(n);
	for(int i = 0; i < n; i++)	cin>>salary[i];
	for(int i = 0; i < m; i++)	cin>>banknotes[i];
	vector<int> ways[1101];
	for(int j = 0; j < (1 << m); j++){
		int sum = 0;
		for(int bit = 0; bit < m; bit++){
			if(check_bit(j, bit))	sum += banknotes[bit];
		}
		if(sum <= 1000)
			ways[sum].pb(j);
	}
	bool dp[21][(1<<m)];
	memset(dp, false, sizeof dp);
	dp[0][0] = true;
	for(int i = 0; i < n; i++){
		for(int mask = 0; mask < (1 << m); mask++){
			if(!dp[i][mask])	continue;
			for(auto sum_mask : ways[salary[i]]){
				if(mask & sum_mask)	continue;
				dp[i+1][mask | sum_mask] = true;
			}
		}
	}
	for(int j = 0; j < (1 << m); j++){
		if(dp[n][j]){
			cout<<"YES"<<endl;
			return 0;
		}
	}
	cout<<"NO"<<endl;
	return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 82 ms 28356 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 79 ms 27336 KB Output is correct
9 Correct 78 ms 27684 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 82 ms 28356 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 79 ms 27336 KB Output is correct
9 Correct 78 ms 27684 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 2 ms 708 KB Output is correct
31 Correct 79 ms 27360 KB Output is correct
32 Correct 138 ms 27580 KB Output is correct
33 Correct 85 ms 22604 KB Output is correct
34 Correct 79 ms 21836 KB Output is correct
35 Correct 79 ms 21832 KB Output is correct
36 Correct 83 ms 21832 KB Output is correct
37 Correct 77 ms 21964 KB Output is correct
38 Correct 74 ms 21908 KB Output is correct
39 Correct 93 ms 26772 KB Output is correct
40 Correct 81 ms 23552 KB Output is correct
41 Correct 82 ms 22328 KB Output is correct
42 Correct 82 ms 27388 KB Output is correct
43 Correct 78 ms 23628 KB Output is correct
44 Correct 81 ms 21816 KB Output is correct
45 Correct 83 ms 28108 KB Output is correct
46 Correct 81 ms 24940 KB Output is correct
47 Correct 80 ms 21828 KB Output is correct
48 Correct 78 ms 27416 KB Output is correct
49 Correct 80 ms 27780 KB Output is correct
50 Correct 164 ms 26844 KB Output is correct
51 Correct 82 ms 27636 KB Output is correct
52 Correct 84 ms 26740 KB Output is correct
53 Correct 418 ms 26716 KB Output is correct
54 Correct 179 ms 26772 KB Output is correct
55 Correct 157 ms 26744 KB Output is correct
56 Correct 157 ms 26800 KB Output is correct
57 Correct 164 ms 26764 KB Output is correct
58 Correct 165 ms 26860 KB Output is correct