oj.uz

Submission #886973

# Submission time Handle Problem Language Result Execution time Memory
886973 2023-12-13T10:42:34 Z Amirreza_Fakhri Bank (IZhO14_bank) C++17
100 / 100
 89 ms 8792 KB 
// In the name oF the God 
#include <bits/stdc++.h>
#define ll long long
// #define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
using namespace std;

const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 20;

int n, m, a[1000], b[1000];
pii dp[1<<maxn];

int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    for (int msk = 0; msk < (1<<m); msk++) dp[msk].F = -1;
    dp[0].F = 0;
    for (int msk = 0; msk < (1<<m); msk++) {
        if (dp[msk].F == -1) continue;
        if (dp[msk].F == n) {
            cout << "YES\n"; return 0;
        }
        for (int i = 0; i < m; i++) {
            if (msk&(1<<i)) continue;
            if (dp[msk].S+b[i] == a[dp[msk].F]) dp[msk+(1<<i)] = mp(dp[msk].F+1, 0);
            else if (dp[msk].S+b[i] < a[dp[msk].F]) dp[msk+(1<<i)] = mp(dp[msk].F, dp[msk].S+b[i]);
        }
    }
    cout << "NO\n";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 4 ms 8536 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 75 ms 8784 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 4 ms 8536 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 75 ms 8784 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 68 ms 8540 KB Output is correct
32 Correct 82 ms 8648 KB Output is correct
33 Correct 9 ms 8540 KB Output is correct
34 Correct 3 ms 8792 KB Output is correct
35 Correct 3 ms 8652 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 4 ms 8540 KB Output is correct
39 Correct 2 ms 8536 KB Output is correct
40 Correct 3 ms 8540 KB Output is correct
41 Correct 4 ms 8440 KB Output is correct
42 Correct 48 ms 8540 KB Output is correct
43 Correct 4 ms 8536 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 2 ms 8660 KB Output is correct
46 Correct 22 ms 8540 KB Output is correct
47 Correct 3 ms 8540 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 4 ms 8488 KB Output is correct
50 Correct 77 ms 8652 KB Output is correct
51 Correct 4 ms 8536 KB Output is correct
52 Correct 6 ms 8668 KB Output is correct
53 Correct 89 ms 8652 KB Output is correct
54 Correct 80 ms 8536 KB Output is correct
55 Correct 78 ms 8536 KB Output is correct
56 Correct 77 ms 8536 KB Output is correct
57 Correct 75 ms 8540 KB Output is correct
58 Correct 75 ms 8536 KB Output is correct