// I will instruct you and teach you in the way you should go;
// I will counsel you with my loving eye on you. Psalms 32:8
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
#ifdef DEBUG
#define debug(args...) printf(args)
#else
#define debug(args...)
#endif
#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 20
#define MAXNP 1100000
int n, m;
int a[MAXN], b[MAXN];
ii dp[MAXNP];
int main() {
int _t = 1;
// scanf("%d", &_t);
while (_t--) {
scanf("%d%d", &n, &m);
REP (i, 0, n) {
scanf("%d", &a[i]);
}
REP (i, 0, m) {
scanf("%d", &b[i]);
}
REP (i, 0, 1 << m) {
dp[i] = MP(0, 0);
REP (j, 0, m) {
if (!(i >> j & 1)) {
continue;
}
int k = i ^ (1 << j);
ii res = dp[k];
res.SE += b[j];
if (a[res.FI] == res.SE) {
res.FI++;
res.SE = 0;
}
mxto(dp[i], res);
}
}
if (dp[(1 << m) - 1].FI == n) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
Compilation message
bank.cpp: In function 'int main()':
bank.cpp:48:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
48 | scanf("%d%d", &n, &m);
| ~~~~~^~~~~~~~~~~~~~~~
bank.cpp:50:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
50 | scanf("%d", &a[i]);
| ~~~~~^~~~~~~~~~~~~
bank.cpp:53:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
53 | scanf("%d", &b[i]);
| ~~~~~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
300 KB |
Output is correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Correct |
3 ms |
420 KB |
Output is correct |
5 |
Correct |
73 ms |
8472 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
91 ms |
8424 KB |
Output is correct |
9 |
Correct |
74 ms |
8412 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
300 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Correct |
1 ms |
284 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
304 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
300 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
296 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
2 ms |
436 KB |
Output is correct |
8 |
Correct |
2 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
2 ms |
332 KB |
Output is correct |
11 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
300 KB |
Output is correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Correct |
3 ms |
420 KB |
Output is correct |
5 |
Correct |
73 ms |
8472 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
91 ms |
8424 KB |
Output is correct |
9 |
Correct |
74 ms |
8412 KB |
Output is correct |
10 |
Correct |
0 ms |
300 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
296 KB |
Output is correct |
13 |
Correct |
1 ms |
284 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
0 ms |
304 KB |
Output is correct |
17 |
Correct |
0 ms |
204 KB |
Output is correct |
18 |
Correct |
0 ms |
300 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
296 KB |
Output is correct |
21 |
Correct |
2 ms |
332 KB |
Output is correct |
22 |
Correct |
2 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
25 |
Correct |
2 ms |
332 KB |
Output is correct |
26 |
Correct |
2 ms |
436 KB |
Output is correct |
27 |
Correct |
2 ms |
332 KB |
Output is correct |
28 |
Correct |
1 ms |
332 KB |
Output is correct |
29 |
Correct |
2 ms |
332 KB |
Output is correct |
30 |
Correct |
2 ms |
332 KB |
Output is correct |
31 |
Correct |
86 ms |
8480 KB |
Output is correct |
32 |
Correct |
94 ms |
8388 KB |
Output is correct |
33 |
Correct |
94 ms |
8372 KB |
Output is correct |
34 |
Correct |
89 ms |
8476 KB |
Output is correct |
35 |
Correct |
86 ms |
8408 KB |
Output is correct |
36 |
Correct |
79 ms |
8492 KB |
Output is correct |
37 |
Correct |
80 ms |
8392 KB |
Output is correct |
38 |
Correct |
75 ms |
8412 KB |
Output is correct |
39 |
Correct |
79 ms |
8372 KB |
Output is correct |
40 |
Correct |
83 ms |
8472 KB |
Output is correct |
41 |
Correct |
80 ms |
8372 KB |
Output is correct |
42 |
Correct |
101 ms |
8420 KB |
Output is correct |
43 |
Correct |
87 ms |
8388 KB |
Output is correct |
44 |
Correct |
74 ms |
8460 KB |
Output is correct |
45 |
Correct |
107 ms |
8516 KB |
Output is correct |
46 |
Correct |
96 ms |
8496 KB |
Output is correct |
47 |
Correct |
87 ms |
8460 KB |
Output is correct |
48 |
Correct |
91 ms |
8448 KB |
Output is correct |
49 |
Correct |
73 ms |
8452 KB |
Output is correct |
50 |
Correct |
76 ms |
8420 KB |
Output is correct |
51 |
Correct |
84 ms |
8480 KB |
Output is correct |
52 |
Correct |
81 ms |
8388 KB |
Output is correct |
53 |
Correct |
91 ms |
8500 KB |
Output is correct |
54 |
Correct |
88 ms |
8424 KB |
Output is correct |
55 |
Correct |
75 ms |
8484 KB |
Output is correct |
56 |
Correct |
72 ms |
8456 KB |
Output is correct |
57 |
Correct |
76 ms |
8496 KB |
Output is correct |
58 |
Correct |
73 ms |
8400 KB |
Output is correct |