oj.uz

Submission #468132

# Submission time Handle Problem Language Result Execution time Memory
468132 2021-08-26T20:18:31 Z TruaShamu Bank (IZhO14_bank) C++17
100 / 100
 340 ms 9956 KB 
#define _crt_secure_no_warnings
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ll = long long;


void fastio() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
}

signed main() {
    fastio();
    int N, M;
    cin >> N >> M;
    vector<int> A(N), B(M);
    for (auto& x : A) cin >> x;
    for (auto& x : B) cin >> x;

    vector<vector<int>> sum(20001);
    for (int mask = 0; mask < (1 << M); ++mask) {
        int cur = 0;
        for (int i = 0; i < M; ++i) {
            if (mask & (1 << i)) {
                cur += B[i];
            }
        }
        sum[cur].push_back(mask);
    }
    vector<vector<int>> dp(N + 1);
    dp[0].push_back(0);
    bool f = false;
    for (int i = 0; i < N; ++i) {
        vector<bool> vis(1 << M);
        f = false;
        for (int mask : sum[A[i]]) {
            for (int pmask : dp[i]) {
                if (!(mask & pmask) and !vis[mask | pmask]) {
                    vis[mask | pmask] = true;
                    dp[i + 1].push_back(mask | pmask);
                    f = true;
                }
            }
        }
    }
    cout << (f ? "YES\n" : "NO\n");
    return 0;
}

Compilation message

bank.cpp:14: warning: "sz" redefined
   14 | #define sz(x) (int)x.size()
      | 
bank.cpp:8: note: this is the location of the previous definition
    8 | #define sz(x) (int) (x).size()
      |

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 3 ms 992 KB Output is correct
5 Correct 74 ms 7452 KB Output is correct
6 Correct 1 ms 728 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 71 ms 6304 KB Output is correct
9 Correct 71 ms 6724 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 3 ms 992 KB Output is correct
5 Correct 74 ms 7452 KB Output is correct
6 Correct 1 ms 728 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 71 ms 6304 KB Output is correct
9 Correct 71 ms 6724 KB Output is correct
10 Correct 1 ms 716 KB Output is correct
11 Correct 1 ms 716 KB Output is correct
12 Correct 1 ms 716 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 716 KB Output is correct
16 Correct 1 ms 716 KB Output is correct
17 Correct 1 ms 716 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 844 KB Output is correct
21 Correct 2 ms 844 KB Output is correct
22 Correct 2 ms 972 KB Output is correct
23 Correct 2 ms 880 KB Output is correct
24 Correct 2 ms 844 KB Output is correct
25 Correct 2 ms 844 KB Output is correct
26 Correct 2 ms 844 KB Output is correct
27 Correct 3 ms 844 KB Output is correct
28 Correct 2 ms 972 KB Output is correct
29 Correct 2 ms 844 KB Output is correct
30 Correct 2 ms 844 KB Output is correct
31 Correct 76 ms 7376 KB Output is correct
32 Correct 119 ms 6596 KB Output is correct
33 Correct 78 ms 7080 KB Output is correct
34 Correct 79 ms 7448 KB Output is correct
35 Correct 82 ms 8296 KB Output is correct
36 Correct 83 ms 7904 KB Output is correct
37 Correct 79 ms 8240 KB Output is correct
38 Correct 77 ms 7876 KB Output is correct
39 Correct 78 ms 6836 KB Output is correct
40 Correct 77 ms 7808 KB Output is correct
41 Correct 77 ms 7260 KB Output is correct
42 Correct 75 ms 6368 KB Output is correct
43 Correct 77 ms 8156 KB Output is correct
44 Correct 85 ms 8232 KB Output is correct
45 Correct 74 ms 6928 KB Output is correct
46 Correct 76 ms 8132 KB Output is correct
47 Correct 79 ms 7712 KB Output is correct
48 Correct 71 ms 6560 KB Output is correct
49 Correct 73 ms 6724 KB Output is correct
50 Correct 108 ms 9040 KB Output is correct
51 Correct 72 ms 6720 KB Output is correct
52 Correct 72 ms 5656 KB Output is correct
53 Correct 340 ms 6476 KB Output is correct
54 Correct 123 ms 8528 KB Output is correct
55 Correct 112 ms 9144 KB Output is correct
56 Correct 105 ms 9956 KB Output is correct
57 Correct 109 ms 9880 KB Output is correct
58 Correct 108 ms 9872 KB Output is correct