oj.uz

Submission #672490

# Submission time Handle Problem Language Result Execution time Memory
672490 2022-12-16T10:32:29 Z dsyz Bank (IZhO14_bank) C++17
100 / 100
 125 ms 16768 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N,M;
	cin>>N>>M;
	ll A[N];
	ll B[M];
	for(ll i = 0;i < N;i++){
		cin>>A[i];
	}
	for(ll i = 0;i < M;i++){
		cin>>B[i];
	}
	bool ok = 0;
	pair<ll,ll> dp[1ll<<M]; //maximum prefix of A done by bitmask, remaining sum of B not used 
	memset(dp,0,sizeof(dp));
	for(ll i = 0;i < (1ll << M);i++){
		for(ll j = 0;j < M;j++){
			if(!((i >> j) & 1)){
				continue;
			}
			ll k = i ^ (1 << j); //previous state without jth banknote
			pair<ll,ll> res = dp[k];
			res.second += B[j];
			if(A[res.first] == res.second){
				res.first++;
				res.second = 0;
			}
			dp[i] = max(dp[i],res);
			if(dp[i].first >= N) ok = 1;
		}
	}
	if(ok){
		cout<<"YES"<<'\n';
	}else{
		cout<<"NO"<<'\n';
	}
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:19:24: warning: 'void* memset(void*, int, size_t)' clearing an object of type 'struct std::pair<long long int, long long int>' with no trivial copy-assignment; use assignment instead [-Wclass-memaccess]
   19 |  memset(dp,0,sizeof(dp));
      |                        ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from bank.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<long long int, long long int>' declared here
  211 |     struct pair
      |            ^~~~

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 3 ms 828 KB Output is correct
5 Correct 85 ms 16596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 102 ms 16724 KB Output is correct
9 Correct 86 ms 16704 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 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 3 ms 828 KB Output is correct
5 Correct 85 ms 16596 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 102 ms 16724 KB Output is correct
9 Correct 86 ms 16704 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 224 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 95 ms 16596 KB Output is correct
32 Correct 103 ms 16724 KB Output is correct
33 Correct 105 ms 16716 KB Output is correct
34 Correct 95 ms 16704 KB Output is correct
35 Correct 94 ms 16724 KB Output is correct
36 Correct 84 ms 16768 KB Output is correct
37 Correct 90 ms 16724 KB Output is correct
38 Correct 81 ms 16704 KB Output is correct
39 Correct 91 ms 16704 KB Output is correct
40 Correct 89 ms 16724 KB Output is correct
41 Correct 81 ms 16724 KB Output is correct
42 Correct 119 ms 16708 KB Output is correct
43 Correct 95 ms 16708 KB Output is correct
44 Correct 89 ms 16724 KB Output is correct
45 Correct 125 ms 16724 KB Output is correct
46 Correct 113 ms 16704 KB Output is correct
47 Correct 85 ms 16600 KB Output is correct
48 Correct 102 ms 16596 KB Output is correct
49 Correct 89 ms 16716 KB Output is correct
50 Correct 94 ms 16708 KB Output is correct
51 Correct 91 ms 16724 KB Output is correct
52 Correct 87 ms 16708 KB Output is correct
53 Correct 108 ms 16704 KB Output is correct
54 Correct 110 ms 16724 KB Output is correct
55 Correct 94 ms 16704 KB Output is correct
56 Correct 92 ms 16724 KB Output is correct
57 Correct 92 ms 16704 KB Output is correct
58 Correct 91 ms 16724 KB Output is correct