# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763368 | 2023-06-22T08:37:37 Z | Blagoj | Bank (IZhO14_bank) | C++17 | 1000 ms | 5264 KB |
#include <bits/stdc++.h> using namespace std; #define endl '\n' #define ll long long #define all(x) x.begin(), x.end() int n, m; vector<int> s, v; int dp[21][1 << 21]; int solve(int p, int mask) { if (p == n) return dp[p][mask] = 1; if (mask == (1 << v.size()) - 1) return dp[p][mask] = -1; if (dp[p][mask] != 0) return dp[p][mask]; vector<int> c; for (int i = 0; i < m; i++) if (!(mask & (1 << i)) && (v[i] <= s[p])) c.push_back(i); dp[p][mask] = -1; for (int i = 0; i < (1 << c.size()); i++) { int sum = 0; int newMask = mask; for (int j = 0; j < c.size(); j++) { if (i & (1 << j)) { sum += v[c[j]]; newMask |= (1 << c[j]); } } if (sum == s[p]) { dp[p][mask] = max(dp[p][mask], solve(p + 1, newMask)); if (dp[p][mask] == 1) return 1; } } return dp[p][mask]; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; s.resize(n); v.resize(m); for (int i = 0; i < n; i++) cin >> s[i]; for (int i = 0; i < m; i++) cin >> v[i]; sort(all(s)); sort(all(v)); solve(0, 0); cout << (dp[0][0] == 1 ? "YES" : "NO"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 65 ms | 304 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 340 KB | Output is correct |
6 | Correct | 0 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 340 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 0 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 0 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 340 KB | Output is correct |
8 | Correct | 0 ms | 340 KB | Output is correct |
9 | Correct | 1 ms | 340 KB | Output is correct |
10 | Correct | 1 ms | 340 KB | Output is correct |
11 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 65 ms | 304 KB | Output is correct |
10 | Correct | 0 ms | 340 KB | Output is correct |
11 | Correct | 0 ms | 340 KB | Output is correct |
12 | Correct | 0 ms | 212 KB | Output is correct |
13 | Correct | 0 ms | 212 KB | Output is correct |
14 | Correct | 0 ms | 340 KB | Output is correct |
15 | Correct | 0 ms | 340 KB | Output is correct |
16 | Correct | 1 ms | 340 KB | Output is correct |
17 | Correct | 0 ms | 340 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 340 KB | Output is correct |
20 | Correct | 1 ms | 340 KB | Output is correct |
21 | Correct | 1 ms | 340 KB | Output is correct |
22 | Correct | 0 ms | 340 KB | Output is correct |
23 | Correct | 1 ms | 212 KB | Output is correct |
24 | Correct | 0 ms | 212 KB | Output is correct |
25 | Correct | 0 ms | 212 KB | Output is correct |
26 | Correct | 0 ms | 340 KB | Output is correct |
27 | Correct | 0 ms | 340 KB | Output is correct |
28 | Correct | 1 ms | 340 KB | Output is correct |
29 | Correct | 1 ms | 340 KB | Output is correct |
30 | Correct | 1 ms | 212 KB | Output is correct |
31 | Correct | 14 ms | 212 KB | Output is correct |
32 | Correct | 2 ms | 340 KB | Output is correct |
33 | Correct | 48 ms | 428 KB | Output is correct |
34 | Correct | 1 ms | 340 KB | Output is correct |
35 | Correct | 3 ms | 340 KB | Output is correct |
36 | Correct | 0 ms | 468 KB | Output is correct |
37 | Correct | 0 ms | 212 KB | Output is correct |
38 | Correct | 1 ms | 212 KB | Output is correct |
39 | Correct | 0 ms | 340 KB | Output is correct |
40 | Correct | 0 ms | 212 KB | Output is correct |
41 | Correct | 0 ms | 212 KB | Output is correct |
42 | Correct | 972 ms | 1592 KB | Output is correct |
43 | Correct | 87 ms | 604 KB | Output is correct |
44 | Correct | 0 ms | 340 KB | Output is correct |
45 | Correct | 0 ms | 340 KB | Output is correct |
46 | Correct | 19 ms | 724 KB | Output is correct |
47 | Correct | 0 ms | 340 KB | Output is correct |
48 | Correct | 1 ms | 212 KB | Output is correct |
49 | Correct | 1 ms | 212 KB | Output is correct |
50 | Correct | 0 ms | 468 KB | Output is correct |
51 | Correct | 9 ms | 468 KB | Output is correct |
52 | Correct | 118 ms | 2036 KB | Output is correct |
53 | Correct | 0 ms | 340 KB | Output is correct |
54 | Correct | 0 ms | 468 KB | Output is correct |
55 | Correct | 0 ms | 468 KB | Output is correct |
56 | Correct | 0 ms | 468 KB | Output is correct |
57 | Execution timed out | 1092 ms | 5264 KB | Time limit exceeded |
58 | Halted | 0 ms | 0 KB | - |