# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91063 | 2018-12-26T06:18:06 Z | YottaByte | Bank (IZhO14_bank) | C++14 | 442 ms | 3088 KB |
#include <stdio.h> #include <stdlib.h> using namespace std; const int N = 22; int n, m, a[N], b[N]; int dp[1 << N]; void calc(int mask, int p = 0, int c = 0, int last = 0, int sum = 0) { if(c == n) { puts("YES"); exit(0); } for(int i = last; i < m; i++) { if(!( mask & ( 1 << i ))) { if(!( p & ( 1 << i ))) { int tomask = ( mask | ( 1 << i )); if(sum + b[i] < a[c]) calc( tomask, p, c, i, sum + b[i]); else if(sum + b[i] == a[c]) { dp[tomask] = c + 1; sum += b[i]; calc( 0, tomask | p, c + 1, 0, 0); } else calc( tomask, p, c, i, sum + b[i]); } } } } main() { scanf("%d %d", &n, &m); for(int i = 0; i < n; i++) scanf("%d", &a[i]); for(int i = 0; i < m; i++) scanf("%d", &b[i]); calc(0); puts("NO"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 1 ms | 380 KB | Output is correct |
4 | Correct | 2 ms | 440 KB | Output is correct |
5 | Correct | 10 ms | 488 KB | Output is correct |
6 | Correct | 2 ms | 488 KB | Output is correct |
7 | Correct | 2 ms | 536 KB | Output is correct |
8 | Correct | 2 ms | 536 KB | Output is correct |
9 | Correct | 10 ms | 536 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 536 KB | Output is correct |
2 | Correct | 2 ms | 536 KB | Output is correct |
3 | Correct | 2 ms | 536 KB | Output is correct |
4 | Correct | 2 ms | 536 KB | Output is correct |
5 | Correct | 2 ms | 536 KB | Output is correct |
6 | Correct | 2 ms | 536 KB | Output is correct |
7 | Correct | 2 ms | 536 KB | Output is correct |
8 | Correct | 2 ms | 536 KB | Output is correct |
9 | Correct | 2 ms | 536 KB | Output is correct |
10 | Correct | 2 ms | 560 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 560 KB | Output is correct |
2 | Correct | 2 ms | 560 KB | Output is correct |
3 | Correct | 2 ms | 620 KB | Output is correct |
4 | Correct | 2 ms | 620 KB | Output is correct |
5 | Correct | 2 ms | 620 KB | Output is correct |
6 | Correct | 2 ms | 620 KB | Output is correct |
7 | Correct | 2 ms | 620 KB | Output is correct |
8 | Correct | 2 ms | 636 KB | Output is correct |
9 | Correct | 2 ms | 636 KB | Output is correct |
10 | Correct | 2 ms | 636 KB | Output is correct |
11 | Correct | 2 ms | 636 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 1 ms | 380 KB | Output is correct |
4 | Correct | 2 ms | 440 KB | Output is correct |
5 | Correct | 10 ms | 488 KB | Output is correct |
6 | Correct | 2 ms | 488 KB | Output is correct |
7 | Correct | 2 ms | 536 KB | Output is correct |
8 | Correct | 2 ms | 536 KB | Output is correct |
9 | Correct | 10 ms | 536 KB | Output is correct |
10 | Correct | 2 ms | 536 KB | Output is correct |
11 | Correct | 2 ms | 536 KB | Output is correct |
12 | Correct | 2 ms | 536 KB | Output is correct |
13 | Correct | 2 ms | 536 KB | Output is correct |
14 | Correct | 2 ms | 536 KB | Output is correct |
15 | Correct | 2 ms | 536 KB | Output is correct |
16 | Correct | 2 ms | 536 KB | Output is correct |
17 | Correct | 2 ms | 536 KB | Output is correct |
18 | Correct | 2 ms | 536 KB | Output is correct |
19 | Correct | 2 ms | 560 KB | Output is correct |
20 | Correct | 2 ms | 560 KB | Output is correct |
21 | Correct | 2 ms | 560 KB | Output is correct |
22 | Correct | 2 ms | 620 KB | Output is correct |
23 | Correct | 2 ms | 620 KB | Output is correct |
24 | Correct | 2 ms | 620 KB | Output is correct |
25 | Correct | 2 ms | 620 KB | Output is correct |
26 | Correct | 2 ms | 620 KB | Output is correct |
27 | Correct | 2 ms | 636 KB | Output is correct |
28 | Correct | 2 ms | 636 KB | Output is correct |
29 | Correct | 2 ms | 636 KB | Output is correct |
30 | Correct | 2 ms | 636 KB | Output is correct |
31 | Correct | 2 ms | 636 KB | Output is correct |
32 | Correct | 2 ms | 636 KB | Output is correct |
33 | Correct | 6 ms | 652 KB | Output is correct |
34 | Correct | 12 ms | 652 KB | Output is correct |
35 | Correct | 7 ms | 652 KB | Output is correct |
36 | Correct | 17 ms | 652 KB | Output is correct |
37 | Correct | 14 ms | 652 KB | Output is correct |
38 | Correct | 10 ms | 652 KB | Output is correct |
39 | Correct | 1 ms | 652 KB | Output is correct |
40 | Correct | 11 ms | 652 KB | Output is correct |
41 | Correct | 12 ms | 652 KB | Output is correct |
42 | Correct | 442 ms | 3088 KB | Output is correct |
43 | Correct | 21 ms | 3088 KB | Output is correct |
44 | Correct | 10 ms | 3088 KB | Output is correct |
45 | Correct | 2 ms | 3088 KB | Output is correct |
46 | Correct | 6 ms | 3088 KB | Output is correct |
47 | Correct | 12 ms | 3088 KB | Output is correct |
48 | Correct | 2 ms | 3088 KB | Output is correct |
49 | Correct | 10 ms | 3088 KB | Output is correct |
50 | Correct | 1 ms | 3088 KB | Output is correct |
51 | Correct | 143 ms | 3088 KB | Output is correct |
52 | Correct | 12 ms | 3088 KB | Output is correct |
53 | Correct | 1 ms | 3088 KB | Output is correct |
54 | Correct | 7 ms | 3088 KB | Output is correct |
55 | Correct | 2 ms | 3088 KB | Output is correct |
56 | Correct | 1 ms | 3088 KB | Output is correct |
57 | Correct | 28 ms | 3088 KB | Output is correct |
58 | Correct | 1 ms | 3088 KB | Output is correct |