oj.uz

Submission #483763

# Submission time Handle Problem Language Result Execution time Memory
483763 2021-11-01T04:08:17 Z Olympia Bank (IZhO14_bank) C++17
100 / 100
 522 ms 15036 KB 
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <queue>
#include <map>
#define ll signed long long
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    vector<int> dp[1001];
    for (int i = 0; i < (1 << m); i++) {
        ll sum = 0;
        for (int j = 0; j < m; j++) {
            if (i & (1 << j)) {
                sum += b[j];
            }
        }
        if (sum <= 1000) {
            dp[sum].push_back(i);
        }
    }
    int prev[(1 << m)];
    int cur[(1 << m)];
    //for (int i = 0; i < n; i++) {
    for (int j = 0; j < (1 << m); j++) {
        //ans[i][j] = 0;
        prev[j] = cur[j] = false;
    }
    //}
    for (int i: dp[a[0]]) {
        prev[i]++;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            if (!prev[j]) {
                continue;
            }
            for (int val: dp[a[i]]) {
                if ((val & j) == 0) {
                    cur[val + j] += prev[j];
                }
            }
        }
        for (int j = 0; j < (1 << m); j++) {
            prev[j] = cur[j];
            cur[j] = false;
        }
    }
    bool bo = false;
    for (int i = 0; i < (1 << m); i++) {
        bo = bo || prev[i];
    }
    if (bo) {
        cout << "YES";
    } else {
        cout << "NO";
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 78 ms 15036 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 69 ms 13900 KB Output is correct
9 Correct 68 ms 14248 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 78 ms 15036 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 69 ms 13900 KB Output is correct
9 Correct 68 ms 14248 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 87 ms 14004 KB Output is correct
32 Correct 133 ms 14212 KB Output is correct
33 Correct 79 ms 9272 KB Output is correct
34 Correct 78 ms 8492 KB Output is correct
35 Correct 80 ms 8504 KB Output is correct
36 Correct 95 ms 8508 KB Output is correct
37 Correct 71 ms 8628 KB Output is correct
38 Correct 75 ms 8620 KB Output is correct
39 Correct 94 ms 13372 KB Output is correct
40 Correct 86 ms 10160 KB Output is correct
41 Correct 94 ms 9132 KB Output is correct
42 Correct 90 ms 14020 KB Output is correct
43 Correct 98 ms 10336 KB Output is correct
44 Correct 91 ms 8488 KB Output is correct
45 Correct 82 ms 14660 KB Output is correct
46 Correct 73 ms 11600 KB Output is correct
47 Correct 88 ms 8508 KB Output is correct
48 Correct 70 ms 14132 KB Output is correct
49 Correct 93 ms 14448 KB Output is correct
50 Correct 196 ms 13496 KB Output is correct
51 Correct 88 ms 14372 KB Output is correct
52 Correct 80 ms 13368 KB Output is correct
53 Correct 522 ms 13364 KB Output is correct
54 Correct 189 ms 13488 KB Output is correct
55 Correct 175 ms 13488 KB Output is correct
56 Correct 175 ms 13508 KB Output is correct
57 Correct 175 ms 13428 KB Output is correct
58 Correct 171 ms 13380 KB Output is correct