oj.uz

Submission #547954

# Submission time Handle Problem Language Result Execution time Memory
547954 2022-04-12T04:36:36 Z mgl_diamond Bank (IZhO14_bank) C++14
100 / 100
 475 ms 14996 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 j = 0; j < (1 << m); j++) {
        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 212 KB Output is correct
2 Correct 0 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 72 ms 14996 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 69 ms 13964 KB Output is correct
9 Correct 79 ms 14264 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 540 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 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 212 KB Output is correct
2 Correct 0 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 72 ms 14996 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 69 ms 13964 KB Output is correct
9 Correct 79 ms 14264 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 540 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 71 ms 13900 KB Output is correct
32 Correct 140 ms 14140 KB Output is correct
33 Correct 75 ms 9236 KB Output is correct
34 Correct 72 ms 8504 KB Output is correct
35 Correct 82 ms 8528 KB Output is correct
36 Correct 99 ms 8520 KB Output is correct
37 Correct 65 ms 8608 KB Output is correct
38 Correct 67 ms 8588 KB Output is correct
39 Correct 88 ms 13452 KB Output is correct
40 Correct 80 ms 10128 KB Output is correct
41 Correct 107 ms 8956 KB Output is correct
42 Correct 79 ms 14028 KB Output is correct
43 Correct 76 ms 10280 KB Output is correct
44 Correct 84 ms 8500 KB Output is correct
45 Correct 85 ms 14760 KB Output is correct
46 Correct 76 ms 11668 KB Output is correct
47 Correct 77 ms 8504 KB Output is correct
48 Correct 68 ms 14156 KB Output is correct
49 Correct 69 ms 14456 KB Output is correct
50 Correct 202 ms 13400 KB Output is correct
51 Correct 87 ms 14284 KB Output is correct
52 Correct 83 ms 13352 KB Output is correct
53 Correct 475 ms 13472 KB Output is correct
54 Correct 184 ms 13464 KB Output is correct
55 Correct 166 ms 13396 KB Output is correct
56 Correct 174 ms 13460 KB Output is correct
57 Correct 187 ms 13420 KB Output is correct
58 Correct 175 ms 13588 KB Output is correct