Submission #973957

# Submission time Handle Problem Language Result Execution time Memory
973957 2024-05-02T13:32:02 Z beksultan04 Bank (IZhO14_bank) C++14
100 / 100
739 ms 9044 KB
#include <bits/stdc++.h>
 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define pii pair<int,int>
#define ret return
#define fr first
#define sc second
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define nosol puts("-1");
#define pb push_back
#define endi puts("");
const int N = 2048576,INF = 1e9+7;
int a[30],b[30],dp[N];
vector <int> v[30];
main(){
	int n,m,i,j;
	cin>>n>>m;
	for (i=0;i<n;++i)
		cin>>a[i];
	for (j=0;j<m;++j)
		cin>>b[j];
	for (int mask = 0; mask < (1<<m); ++mask){
		int sum = 0;
		for (i=0;i<m;++i){
			if (mask&(1<<i))sum += b[i];
		}
		for (i=0;i<n;++i){
			if (sum == a[i]){
				v[i].pb(mask);
			}
		}
	}
	for (i=0;i<(1<<m);++i){
		dp[i] = -1;
	}
	dp[0] = 0;
	
	for (i=0;i<n;++i){
		for (int mask = (1<<m)-1; mask >= 0; --mask){
			if (dp[mask] != -1){
				for (auto x: v[i]){
					if (!(mask&x)){
						dp[mask|x] = dp[mask] + 1;
						if (dp[mask|x] == n){
							YES
							ret 0;
						}
					}
				}
			}
		}
	}
	NO
	
}








Compilation message

bank.cpp:23:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   23 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 72 ms 8616 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 68 ms 8676 KB Output is correct
9 Correct 70 ms 8788 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 444 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 72 ms 8616 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 68 ms 8676 KB Output is correct
9 Correct 70 ms 8788 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 420 KB Output is correct
20 Correct 2 ms 344 KB Output is correct
21 Correct 1 ms 448 KB Output is correct
22 Correct 2 ms 504 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 444 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 74 ms 8636 KB Output is correct
32 Correct 92 ms 9044 KB Output is correct
33 Correct 75 ms 8784 KB Output is correct
34 Correct 78 ms 8612 KB Output is correct
35 Correct 76 ms 8628 KB Output is correct
36 Correct 105 ms 8616 KB Output is correct
37 Correct 71 ms 8788 KB Output is correct
38 Correct 71 ms 8788 KB Output is correct
39 Correct 82 ms 8632 KB Output is correct
40 Correct 79 ms 8620 KB Output is correct
41 Correct 94 ms 8784 KB Output is correct
42 Correct 90 ms 8784 KB Output is correct
43 Correct 76 ms 8788 KB Output is correct
44 Correct 93 ms 8628 KB Output is correct
45 Correct 70 ms 8636 KB Output is correct
46 Correct 73 ms 8636 KB Output is correct
47 Correct 90 ms 8784 KB Output is correct
48 Correct 68 ms 8652 KB Output is correct
49 Correct 70 ms 8784 KB Output is correct
50 Correct 404 ms 8824 KB Output is correct
51 Correct 425 ms 8988 KB Output is correct
52 Correct 309 ms 8684 KB Output is correct
53 Correct 594 ms 8984 KB Output is correct
54 Correct 492 ms 8820 KB Output is correct
55 Correct 405 ms 8788 KB Output is correct
56 Correct 633 ms 8828 KB Output is correct
57 Correct 739 ms 8896 KB Output is correct
58 Correct 634 ms 8832 KB Output is correct