oj.uz

Submission #656388

# Submission time Handle Problem Language Result Execution time Memory
656388 2022-11-07T08:46:15 Z iskhakkutbilim Bank (IZhO14_bank) C++14
100 / 100
 455 ms 54820 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int M = 1e9 + 7;
const int N = 21;
int dp[N][1<<N], a[N], b[N];
int n, m;
vector<int> g[N];

main(){
   ios::sync_with_stdio(0);
   cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i = 0;i < n; i++){
		cin >> a[i];
	}
	for(int i = 0;i < m; i++){
		cin >> b[i];
	}
	for(int mask = 0; mask < (1<<m); mask++){
		int sum = 0;
		for(int i = 0;i < m; i++){
			if(mask & (1<<i)){
				sum+= b[i];
			}
		}
		for(int i = 0;i < n; i++){
			if(a[i] == sum){
				g[i].push_back(mask);
			}
		}
	}
	for(int i = 0;i < n; i++){
		if(g[i].empty()){
			cout << "NO";
			return 0;
		}
	}
	for(auto x : g[0]){
		dp[0][x] = 1;
	}
	for(int i = 1;i < n; i++){
		for(int mask = 0; mask < (1<<m); mask++){
			if(dp[i-1][mask] == 0){
				continue;
			}
			for(auto x : g[i]){
				if((mask & x) == 0){
					dp[i][mask|x] = 1;
				}
			}
		}
	}
	for(int mask = 1; mask < (1<<m); mask++){
		if(dp[n-1][mask] == 1){
			cout << "YES";
			return 0;
		}
	}
	cout << "NO";
	return 0;
}

Compilation message

bank.cpp:14:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   14 | main(){
      | ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 62 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 63 ms 4336 KB Output is correct
9 Correct 65 ms 308 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.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 2 ms 340 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 212 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 62 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 63 ms 4336 KB Output is correct
9 Correct 65 ms 308 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 65 ms 2364 KB Output is correct
32 Correct 130 ms 7940 KB Output is correct
33 Correct 78 ms 1840 KB Output is correct
34 Correct 81 ms 564 KB Output is correct
35 Correct 85 ms 444 KB Output is correct
36 Correct 96 ms 588 KB Output is correct
37 Correct 64 ms 212 KB Output is correct
38 Correct 65 ms 304 KB Output is correct
39 Correct 95 ms 16704 KB Output is correct
40 Correct 69 ms 212 KB Output is correct
41 Correct 76 ms 308 KB Output is correct
42 Correct 79 ms 10296 KB Output is correct
43 Correct 76 ms 1088 KB Output is correct
44 Correct 73 ms 300 KB Output is correct
45 Correct 68 ms 8644 KB Output is correct
46 Correct 73 ms 3904 KB Output is correct
47 Correct 87 ms 572 KB Output is correct
48 Correct 63 ms 3796 KB Output is correct
49 Correct 60 ms 212 KB Output is correct
50 Correct 178 ms 54820 KB Output is correct
51 Correct 79 ms 712 KB Output is correct
52 Correct 86 ms 6984 KB Output is correct
53 Correct 455 ms 28516 KB Output is correct
54 Correct 205 ms 52492 KB Output is correct
55 Correct 184 ms 54720 KB Output is correct
56 Correct 183 ms 54580 KB Output is correct
57 Correct 184 ms 50628 KB Output is correct
58 Correct 186 ms 50716 KB Output is correct