# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
518818 |
2022-01-24T19:45:27 Z |
DragosC1 |
Bank (IZhO14_bank) |
C++17 |
|
120 ms |
8516 KB |
#include <iostream>
using namespace std;
int n, m;
int a[21];
int b[21];
int dp[(1 << 20)];
int sum[(1 << 20)];
bool ok;
void read() {
int i;
cin >> n >> m;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++)
cin >> b[i];
}
void solve() {
int i, j;
dp[0] = 0;
for (i = 0; i < (1 << m) && !ok; i++) {
for (j = 0; j < m && !ok; j++) {
if (i & (1 << j))
continue;
if (sum[i] + b[j] < a[dp[i]] && dp[i] >= dp[i | (1 << j)]) {
sum[i | (1 << j)] = sum[i] + b[j];
dp[i | (1 << j)] = dp[i];
}
else if (sum[i] + b[j] == a[dp[i]] && dp[i] + 1 > dp[i | (1 << j)]) {
dp[i | (1 << j)] = dp[i] + 1;
if (dp[i | (1 << j)] == n)
ok = 1;
sum[i | (1 << j)] = 0;
}
}
}
}
void output() {
cout << (ok == 1 ? "YES\n" : "NO\n");
}
int main() {
read();
solve();
output();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
83 ms |
8364 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
83 ms |
8380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
216 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
1 ms |
308 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
436 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
2 ms |
340 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
83 ms |
8364 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
83 ms |
8380 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
208 KB |
Output is correct |
14 |
Correct |
1 ms |
216 KB |
Output is correct |
15 |
Correct |
0 ms |
208 KB |
Output is correct |
16 |
Correct |
1 ms |
308 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
208 KB |
Output is correct |
20 |
Correct |
2 ms |
336 KB |
Output is correct |
21 |
Correct |
1 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
436 KB |
Output is correct |
23 |
Correct |
1 ms |
336 KB |
Output is correct |
24 |
Correct |
2 ms |
340 KB |
Output is correct |
25 |
Correct |
2 ms |
332 KB |
Output is correct |
26 |
Correct |
1 ms |
336 KB |
Output is correct |
27 |
Correct |
1 ms |
340 KB |
Output is correct |
28 |
Correct |
2 ms |
336 KB |
Output is correct |
29 |
Correct |
1 ms |
340 KB |
Output is correct |
30 |
Correct |
2 ms |
332 KB |
Output is correct |
31 |
Correct |
51 ms |
8452 KB |
Output is correct |
32 |
Correct |
53 ms |
8420 KB |
Output is correct |
33 |
Correct |
59 ms |
8388 KB |
Output is correct |
34 |
Correct |
58 ms |
8516 KB |
Output is correct |
35 |
Correct |
101 ms |
8396 KB |
Output is correct |
36 |
Correct |
82 ms |
8388 KB |
Output is correct |
37 |
Correct |
111 ms |
8384 KB |
Output is correct |
38 |
Correct |
73 ms |
8480 KB |
Output is correct |
39 |
Correct |
1 ms |
332 KB |
Output is correct |
40 |
Correct |
94 ms |
8468 KB |
Output is correct |
41 |
Correct |
81 ms |
8384 KB |
Output is correct |
42 |
Correct |
114 ms |
8476 KB |
Output is correct |
43 |
Correct |
120 ms |
8488 KB |
Output is correct |
44 |
Correct |
88 ms |
8488 KB |
Output is correct |
45 |
Correct |
1 ms |
460 KB |
Output is correct |
46 |
Correct |
61 ms |
8368 KB |
Output is correct |
47 |
Correct |
91 ms |
8420 KB |
Output is correct |
48 |
Correct |
1 ms |
300 KB |
Output is correct |
49 |
Correct |
77 ms |
8364 KB |
Output is correct |
50 |
Correct |
43 ms |
8364 KB |
Output is correct |
51 |
Correct |
78 ms |
8480 KB |
Output is correct |
52 |
Correct |
54 ms |
8376 KB |
Output is correct |
53 |
Correct |
53 ms |
8388 KB |
Output is correct |
54 |
Correct |
49 ms |
8464 KB |
Output is correct |
55 |
Correct |
43 ms |
8488 KB |
Output is correct |
56 |
Correct |
40 ms |
8460 KB |
Output is correct |
57 |
Correct |
88 ms |
8432 KB |
Output is correct |
58 |
Correct |
41 ms |
8460 KB |
Output is correct |