oj.uz

Submission #679118

# Submission time Handle Problem Language Result Execution time Memory
679118 2023-01-07T13:32:05 Z borisAngelov Bank (IZhO14_bank) C++11
100 / 100
 481 ms 36212 KB 
#include <iostream>
#include <vector>

using namespace std;

const int maxn = 25;
const int max_mask = (1 << 20) + 5;

int n, m;

int a[maxn];
int b[maxn];

vector<int> byMasks[maxn * 1000];

bool dp[maxn][max_mask];
bool is_calculated[maxn][max_mask];

bool f(int pos, int mask)
{
    if (pos == n) return true;

    if (is_calculated[pos][mask] == true) return dp[pos][mask];
    is_calculated[pos][mask] = true;

    bool result = false;

    for (auto curr_mask : byMasks[a[pos]])
    {
        if ((mask & curr_mask) != 0) continue;
        result = (result | (f(pos + 1, (mask | curr_mask))));
    }

    return dp[pos][mask] = result;
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m;

    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
    }

    for (int i = 0; i < m; ++i)
    {
        cin >> b[i];
    }

    for (int mask = 0; mask < (1 << m); ++mask)
    {
        int curr_sum = 0;

        for (int i = 0; i < m; ++i)
        {
            if ((mask & (1 << i)) != 0)
            {
                curr_sum += b[i];
            }
        }

        byMasks[curr_sum].push_back(mask);
    }

    for (int i = 0; i < n; ++i)
    {
        if (byMasks[a[i]].empty())
        {
            cout << "NO\n";
            return 0;
        }
    }

    if (f(0, 0) == true)
    {
        cout << "YES\n";
    }
    else
    {
        cout << "NO\n";
    }

    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 66 ms 7244 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 64 ms 6340 KB Output is correct
9 Correct 62 ms 6864 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 66 ms 7244 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 64 ms 6340 KB Output is correct
9 Correct 62 ms 6864 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 852 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 2 ms 1108 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 1 ms 980 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 2 ms 1108 KB Output is correct
28 Correct 2 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 71 ms 8892 KB Output is correct
32 Correct 130 ms 10560 KB Output is correct
33 Correct 67 ms 9788 KB Output is correct
34 Correct 69 ms 7692 KB Output is correct
35 Correct 73 ms 8476 KB Output is correct
36 Correct 70 ms 8072 KB Output is correct
37 Correct 71 ms 8320 KB Output is correct
38 Correct 69 ms 7908 KB Output is correct
39 Correct 82 ms 13948 KB Output is correct
40 Correct 66 ms 7756 KB Output is correct
41 Correct 68 ms 7244 KB Output is correct
42 Correct 71 ms 13036 KB Output is correct
43 Correct 67 ms 9496 KB Output is correct
44 Correct 72 ms 8140 KB Output is correct
45 Correct 66 ms 10132 KB Output is correct
46 Correct 69 ms 12092 KB Output is correct
47 Correct 68 ms 7848 KB Output is correct
48 Correct 65 ms 6492 KB Output is correct
49 Correct 64 ms 6632 KB Output is correct
50 Correct 207 ms 35860 KB Output is correct
51 Correct 64 ms 6988 KB Output is correct
52 Correct 70 ms 11836 KB Output is correct
53 Correct 481 ms 21304 KB Output is correct
54 Correct 242 ms 35100 KB Output is correct
55 Correct 202 ms 35884 KB Output is correct
56 Correct 201 ms 36212 KB Output is correct
57 Correct 259 ms 34168 KB Output is correct
58 Correct 208 ms 34144 KB Output is correct