oj.uz

Submission #710933

# Submission time Handle Problem Language Result Execution time Memory
710933 2023-03-16T05:36:10 Z HeartBreakKid Bank (IZhO14_bank) C++17
100 / 100
 115 ms 16844 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pk pop_back
#define yes cout << "YES\n"
#define no cout << "NO\n"

using namespace std;

ll n, m, k, mod = 1e9 + 7;
map<ll, ll> mp;
string s;

pair <ll, ll> dp[1100005];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
    cin >> n >> m;
    vector <ll> a(n + 1);
    vector <ll> b(m + 1);
    for (ll i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (ll i = 1; i <= m; ++i) {
        cin >> b[i];
    }

    for (ll mask = 1; mask < (1 << m); ++mask) {
        for (ll cur = 0; cur < m; ++cur) {
            if ((mask >> cur) & 1) {
                ll pred_mask = mask ^ (1 << cur);
                ll total = dp[pred_mask].second + b[cur + 1];
                ll done = dp[pred_mask].first;

                if (done < n && a[done + 1] == total && dp[mask].first <= done) {
                    dp[mask] = {done + 1, 0};
                } else {
                    if (dp[mask].first <= done) {
                        dp[mask] = {done, total};
                    }
                }
            }
        }
    }

    if (dp[(1 << m) - 1].first == n) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 73 ms 16684 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 88 ms 16716 KB Output is correct
9 Correct 70 ms 16736 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 73 ms 16684 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 88 ms 16716 KB Output is correct
9 Correct 70 ms 16736 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 588 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 94 ms 16652 KB Output is correct
32 Correct 97 ms 16676 KB Output is correct
33 Correct 89 ms 16672 KB Output is correct
34 Correct 86 ms 16708 KB Output is correct
35 Correct 84 ms 16628 KB Output is correct
36 Correct 76 ms 16628 KB Output is correct
37 Correct 85 ms 16692 KB Output is correct
38 Correct 71 ms 16844 KB Output is correct
39 Correct 79 ms 16724 KB Output is correct
40 Correct 81 ms 16660 KB Output is correct
41 Correct 77 ms 16656 KB Output is correct
42 Correct 108 ms 16704 KB Output is correct
43 Correct 85 ms 16684 KB Output is correct
44 Correct 80 ms 16684 KB Output is correct
45 Correct 115 ms 16716 KB Output is correct
46 Correct 96 ms 16656 KB Output is correct
47 Correct 74 ms 16704 KB Output is correct
48 Correct 88 ms 16616 KB Output is correct
49 Correct 75 ms 16668 KB Output is correct
50 Correct 88 ms 16684 KB Output is correct
51 Correct 81 ms 16616 KB Output is correct
52 Correct 78 ms 16708 KB Output is correct
53 Correct 88 ms 16620 KB Output is correct
54 Correct 112 ms 16716 KB Output is correct
55 Correct 92 ms 16660 KB Output is correct
56 Correct 78 ms 16716 KB Output is correct
57 Correct 78 ms 16640 KB Output is correct
58 Correct 82 ms 16656 KB Output is correct