oj.uz

Submission #875885

# Submission time Handle Problem Language Result Execution time Memory
875885 2023-11-20T16:42:49 Z Spicelmd Bank (IZhO14_bank) C++17
100 / 100
 78 ms 82656 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <deque>
#include <queue>
#include <vector>
#include <unordered_map>
#include <set>
#include <iomanip>
using namespace std;
using lli = long long;
using ldb = long double;
const int maxN = 20;
int g[maxN][1 << maxN];
int a[maxN];
int b[maxN];
vector<int> moncan[maxN];
int n, m;

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

void attemp(int i = 0, int mask = 0, int sum = 0)
{
    if (i == m)
    {
        for (int i = 0; i < n; ++i)
            if (a[i] == sum)
                moncan[i].push_back(mask);
        return;
    }
    attemp(i + 1, mask, sum);
    attemp(i + 1, mask | (1 << i), sum + b[i]);
}

int f(int i, int mask)
{
    if (i < 0)
        return true;
    int& gval = g[i][mask];
    if (gval != -1)
        return gval;
    gval = false;
    for (int& submask: moncan[i])
    {
        if ((mask & submask) != submask)
            continue;
        int newmask = mask & ~submask;
        gval = f(i - 1, newmask);
        if (gval)
            return true;
    }
    return false;
}

void Solve()
{
    attemp();
    for (int i = 0; i < n; ++i)
        for (int mask = 0; mask < (1 << m); ++mask)
            g[i][mask] = -1;
    if (f(n - 1, (1 << m) - 1))
        cout << "YES";
    else
        cout << "NO";
}

int main()
{
#ifdef LeMinhDuc
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    Input();
    Solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 4700 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 4700 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 12632 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 18780 KB Output is correct
4 Correct 3 ms 26968 KB Output is correct
5 Correct 3 ms 18780 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 3 ms 27176 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 4700 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 4700 KB Output is correct
9 Correct 6 ms 4700 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 12632 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 2 ms 18780 KB Output is correct
23 Correct 3 ms 26968 KB Output is correct
24 Correct 3 ms 18780 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 2 ms 14684 KB Output is correct
29 Correct 2 ms 14684 KB Output is correct
30 Correct 3 ms 27176 KB Output is correct
31 Correct 7 ms 8792 KB Output is correct
32 Correct 9 ms 12892 KB Output is correct
33 Correct 13 ms 29528 KB Output is correct
34 Correct 16 ms 41676 KB Output is correct
35 Correct 17 ms 45660 KB Output is correct
36 Correct 26 ms 82656 KB Output is correct
37 Correct 7 ms 8796 KB Output is correct
38 Correct 12 ms 16988 KB Output is correct
39 Correct 14 ms 33372 KB Output is correct
40 Correct 16 ms 41564 KB Output is correct
41 Correct 25 ms 82380 KB Output is correct
42 Correct 14 ms 21084 KB Output is correct
43 Correct 14 ms 33224 KB Output is correct
44 Correct 22 ms 62156 KB Output is correct
45 Correct 8 ms 12892 KB Output is correct
46 Correct 12 ms 25044 KB Output is correct
47 Correct 20 ms 62044 KB Output is correct
48 Correct 6 ms 4696 KB Output is correct
49 Correct 6 ms 4700 KB Output is correct
50 Correct 25 ms 82524 KB Output is correct
51 Correct 17 ms 41756 KB Output is correct
52 Correct 78 ms 41564 KB Output is correct
53 Correct 15 ms 41696 KB Output is correct
54 Correct 25 ms 82524 KB Output is correct
55 Correct 26 ms 82516 KB Output is correct
56 Correct 31 ms 82524 KB Output is correct
57 Correct 35 ms 82516 KB Output is correct
58 Correct 24 ms 78428 KB Output is correct