# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
91055 | 2018-12-26T04:47:43 Z | YottaByte | Bank (IZhO14_bank) | C++14 | 2 ms | 608 KB |
#include <stdio.h> using namespace std; const int N = 20 + 1; #define ll long long #define ok puts("OK"); int n, m, a[N], mx; int b[N], dp[(int)1e4]; main() { scanf("%d %d", &n, &m); for(int i = 1; i <= n; i++) scanf("%d", &a[i]); for(int i = 1; i <= m; i++) scanf("%d", &b[i]), mx += b[i]; dp[0] = 1; for(int i = 1; i <= m; i++) for(int j = mx; j >= b[i]; j--) if(dp[j - b[i]]) dp[j] = 1; if(dp[a[1]]) puts("YES"); else puts("NO"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 500 KB | Output is correct |
4 | Correct | 2 ms | 500 KB | Output is correct |
5 | Correct | 2 ms | 500 KB | Output is correct |
6 | Correct | 2 ms | 508 KB | Output is correct |
7 | Correct | 2 ms | 528 KB | Output is correct |
8 | Correct | 2 ms | 528 KB | Output is correct |
9 | Correct | 2 ms | 528 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 528 KB | Output is correct |
2 | Correct | 2 ms | 528 KB | Output is correct |
3 | Correct | 2 ms | 528 KB | Output is correct |
4 | Incorrect | 2 ms | 528 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 528 KB | Output is correct |
2 | Correct | 2 ms | 528 KB | Output is correct |
3 | Correct | 2 ms | 608 KB | Output is correct |
4 | Correct | 2 ms | 608 KB | Output is correct |
5 | Incorrect | 2 ms | 608 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 500 KB | Output is correct |
3 | Correct | 2 ms | 500 KB | Output is correct |
4 | Correct | 2 ms | 500 KB | Output is correct |
5 | Correct | 2 ms | 500 KB | Output is correct |
6 | Correct | 2 ms | 508 KB | Output is correct |
7 | Correct | 2 ms | 528 KB | Output is correct |
8 | Correct | 2 ms | 528 KB | Output is correct |
9 | Correct | 2 ms | 528 KB | Output is correct |
10 | Correct | 2 ms | 528 KB | Output is correct |
11 | Correct | 2 ms | 528 KB | Output is correct |
12 | Correct | 2 ms | 528 KB | Output is correct |
13 | Incorrect | 2 ms | 528 KB | Output isn't correct |
14 | Halted | 0 ms | 0 KB | - |