oj.uz

Submission #497501

# Submission time Handle Problem Language Result Execution time Memory
497501 2021-12-23T07:45:57 Z vicyan1611 Bank (IZhO14_bank) C++14
100 / 100
 497 ms 96704 KB 
#include <bits/stdc++.h>

using namespace std;
const int Nmax = 22;
const int Mmax = 1005;
const int Bitmax = (1 << 20);

int n, m, a[Nmax], b[Nmax], f[Nmax][Bitmax];
vector <int> tk[Mmax];

int BIT(int n, int i)
{
    return ((n >> i) & 1);
}

int trau(int i, int msk)
{
    if (i > n) return 1;
    int &res = f[i][msk];
    if (res != -1) return res;
    res = 0;
    for (auto val: tk[a[i]])
    {
        if (!(msk & val))
        {
            res = res | trau(i + 1, msk | val);
        }
    }
    return res;
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= m; ++i)
    {
        cin >> b[i];
    }
    for (int msk = 1; msk < (1 << m); ++msk)
    {
        int sum = 0;
        for (int i = 0; i < m; ++i)
        {
            if (BIT(msk, i))
            {
                sum += b[i+1];
            }
        }
        if (sum < Mmax) tk[sum].push_back(msk);
    }
    for (int i = 1; i <= n; ++i) if (tk[a[i]].size() == 0)
    {
        cout << "NO";
        return 0;
    }   
    memset(f, -1, sizeof(f));
    if (trau(1, 0)) cout << "YES"; else cout << "NO";
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 90552 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 35 ms 90492 KB Output is correct
4 Correct 37 ms 90688 KB Output is correct
5 Correct 66 ms 6832 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 39 ms 90564 KB Output is correct
8 Correct 119 ms 96020 KB Output is correct
9 Correct 62 ms 6220 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 90572 KB Output is correct
2 Correct 39 ms 90588 KB Output is correct
3 Correct 36 ms 90528 KB Output is correct
4 Correct 39 ms 90552 KB Output is correct
5 Correct 37 ms 90604 KB Output is correct
6 Correct 37 ms 90564 KB Output is correct
7 Correct 38 ms 90576 KB Output is correct
8 Correct 40 ms 90564 KB Output is correct
9 Correct 49 ms 90560 KB Output is correct
10 Correct 42 ms 90500 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 90564 KB Output is correct
2 Correct 37 ms 90568 KB Output is correct
3 Correct 38 ms 90496 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 2 ms 452 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 43 ms 90572 KB Output is correct
8 Correct 41 ms 90572 KB Output is correct
9 Correct 38 ms 90564 KB Output is correct
10 Correct 38 ms 90556 KB Output is correct
11 Correct 1 ms 332 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 90552 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 35 ms 90492 KB Output is correct
4 Correct 37 ms 90688 KB Output is correct
5 Correct 66 ms 6832 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 39 ms 90564 KB Output is correct
8 Correct 119 ms 96020 KB Output is correct
9 Correct 62 ms 6220 KB Output is correct
10 Correct 36 ms 90572 KB Output is correct
11 Correct 39 ms 90588 KB Output is correct
12 Correct 36 ms 90528 KB Output is correct
13 Correct 39 ms 90552 KB Output is correct
14 Correct 37 ms 90604 KB Output is correct
15 Correct 37 ms 90564 KB Output is correct
16 Correct 38 ms 90576 KB Output is correct
17 Correct 40 ms 90564 KB Output is correct
18 Correct 49 ms 90560 KB Output is correct
19 Correct 42 ms 90500 KB Output is correct
20 Correct 38 ms 90564 KB Output is correct
21 Correct 37 ms 90568 KB Output is correct
22 Correct 38 ms 90496 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 2 ms 452 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 43 ms 90572 KB Output is correct
27 Correct 41 ms 90572 KB Output is correct
28 Correct 38 ms 90564 KB Output is correct
29 Correct 38 ms 90556 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 113 ms 96040 KB Output is correct
32 Correct 145 ms 96280 KB Output is correct
33 Correct 93 ms 91344 KB Output is correct
34 Correct 93 ms 90572 KB Output is correct
35 Correct 102 ms 90576 KB Output is correct
36 Correct 113 ms 90564 KB Output is correct
37 Correct 57 ms 440 KB Output is correct
38 Correct 59 ms 440 KB Output is correct
39 Correct 113 ms 95500 KB Output is correct
40 Correct 65 ms 1996 KB Output is correct
41 Correct 58 ms 848 KB Output is correct
42 Correct 99 ms 96140 KB Output is correct
43 Correct 95 ms 92336 KB Output is correct
44 Correct 61 ms 204 KB Output is correct
45 Correct 103 ms 96704 KB Output is correct
46 Correct 98 ms 93676 KB Output is correct
47 Correct 91 ms 90560 KB Output is correct
48 Correct 99 ms 96308 KB Output is correct
49 Correct 68 ms 6364 KB Output is correct
50 Correct 256 ms 95580 KB Output is correct
51 Correct 108 ms 96400 KB Output is correct
52 Correct 109 ms 95392 KB Output is correct
53 Correct 497 ms 95400 KB Output is correct
54 Correct 308 ms 95564 KB Output is correct
55 Correct 247 ms 95728 KB Output is correct
56 Correct 293 ms 95496 KB Output is correct
57 Correct 255 ms 95596 KB Output is correct
58 Correct 264 ms 95552 KB Output is correct