Submission #965501

# Submission time Handle Problem Language Result Execution time Memory
965501 2024-04-18T18:34:12 Z 0x34c Bank (IZhO14_bank) C++17
100 / 100
117 ms 16980 KB
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'
#define int ll

using namespace std;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, M;
    cin >> N >> M;

    vector<int> ppl(N + 1), mny(M);
    for(int i = 0; i < N; i++)
        cin >> ppl[i];
    ppl[N] = numeric_limits<int>::max();
    
    for(int j = 0; j < M; j++)
        cin >> mny[j];

    vector<int> pref_sol(1 << M, -1);
    vector<int> cur_sol(1 << M, 0);
    pref_sol[0] = 0;

    for(int mask = 1; mask < (1 << M); mask++) {
        for(int pick = 0; pick < M; pick++) {
            if((mask & (1 << pick)) == 0)
                continue;
            
            int prev = mask & (~(1 << pick));
            if(pref_sol[prev] == -1)
                continue;

            if(cur_sol[prev] + mny[pick] > ppl[pref_sol[prev]])
                continue;
            else if(cur_sol[prev] + mny[pick] < ppl[pref_sol[prev]]) {
                cur_sol[mask] = cur_sol[prev] + mny[pick];
                pref_sol[mask] = pref_sol[prev];
            }
            else {
                cur_sol[prev] += mny[pick];
                pref_sol[mask] = 1 + pref_sol[prev];
            }
        }
    }

    if(pref_sol[(1 << M) - 1] == N) {
        cout << "YES" << endl;
    }
    else cout << "NO" << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 72 ms 16728 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 103 ms 16876 KB Output is correct
9 Correct 87 ms 16732 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 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 456 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 856 KB Output is correct
5 Correct 72 ms 16728 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 103 ms 16876 KB Output is correct
9 Correct 87 ms 16732 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 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 456 KB Output is correct
16 Correct 1 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 1 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 100 ms 16732 KB Output is correct
32 Correct 103 ms 16868 KB Output is correct
33 Correct 77 ms 16732 KB Output is correct
34 Correct 74 ms 16872 KB Output is correct
35 Correct 78 ms 16872 KB Output is correct
36 Correct 74 ms 16728 KB Output is correct
37 Correct 74 ms 16872 KB Output is correct
38 Correct 74 ms 16864 KB Output is correct
39 Correct 73 ms 16732 KB Output is correct
40 Correct 74 ms 16732 KB Output is correct
41 Correct 72 ms 16732 KB Output is correct
42 Correct 109 ms 16732 KB Output is correct
43 Correct 74 ms 16864 KB Output is correct
44 Correct 76 ms 16732 KB Output is correct
45 Correct 117 ms 16732 KB Output is correct
46 Correct 93 ms 16980 KB Output is correct
47 Correct 73 ms 16732 KB Output is correct
48 Correct 100 ms 16732 KB Output is correct
49 Correct 74 ms 16884 KB Output is correct
50 Correct 74 ms 16728 KB Output is correct
51 Correct 74 ms 16728 KB Output is correct
52 Correct 73 ms 16732 KB Output is correct
53 Correct 87 ms 16868 KB Output is correct
54 Correct 75 ms 16732 KB Output is correct
55 Correct 76 ms 16868 KB Output is correct
56 Correct 74 ms 16884 KB Output is correct
57 Correct 73 ms 16728 KB Output is correct
58 Correct 75 ms 16732 KB Output is correct