oj.uz

Submission #171733

# Submission time Handle Problem Language Result Execution time Memory
171733 2019-12-30T08:39:02 Z davitmarg Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 28280 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;

const int N = 25;

int n, m, dp[N * 4][(1 << 20) + 5];
LL a[N], b[N], sum[(1 << 20) + 5];

void solve(int v, int l, int r)
{
    if (l == r)
    {
        for (int mask = 0; mask < (1 << m); mask++)
            if (sum[mask] == a[l])
                dp[v][mask] = 1;
        return;
    }
    int mid = (l + r) / 2;
    solve(v * 2, l, mid);
    solve(v * 2 + 1, mid + 1, r);
    for (int mask = 0; mask < (1 << m); mask++)
    {
        if (dp[v * 2][mask] == 0)
            continue;
        int s = (1 << m) - 1 - mask;
        while (s > 0)
        {
            //cout << mask << " : " << s << endl;
            if (dp[v * 2 + 1][s])
                dp[v][mask | s] = 1;
            s = (s - 1) & ((1 << m) - 1 - mask);
        }
    }
}

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 mask = 0; mask < (1 << m); mask++)
    {
        for (int i = 0; i < m; i++)
            if (((1 << i) & mask))
                sum[mask] += b[i + 1];
        //cout << mask << " = " << sum[mask] << endl;
    }

    solve(1, 1, n);

    int ans = 0;
    for (int mask = 0; mask < (1 << m); mask++)
        ans += dp[1][mask];
    if (ans)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;

    return 0;
}

/*

2 4
9 10
5 4 5 5


*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 89 ms 8608 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 91 ms 12540 KB Output is correct
9 Correct 89 ms 8568 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 632 KB Output is correct
5 Correct 89 ms 8608 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 91 ms 12540 KB Output is correct
9 Correct 89 ms 8568 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 3 ms 632 KB Output is correct
22 Correct 4 ms 632 KB Output is correct
23 Correct 4 ms 760 KB Output is correct
24 Correct 4 ms 760 KB Output is correct
25 Correct 3 ms 504 KB Output is correct
26 Correct 3 ms 632 KB Output is correct
27 Correct 3 ms 504 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 632 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 100 ms 12992 KB Output is correct
32 Correct 158 ms 23656 KB Output is correct
33 Correct 124 ms 10952 KB Output is correct
34 Correct 128 ms 9052 KB Output is correct
35 Correct 132 ms 8996 KB Output is correct
36 Correct 175 ms 9148 KB Output is correct
37 Correct 94 ms 8568 KB Output is correct
38 Correct 98 ms 8620 KB Output is correct
39 Correct 770 ms 17204 KB Output is correct
40 Correct 123 ms 8824 KB Output is correct
41 Correct 156 ms 9052 KB Output is correct
42 Correct 162 ms 28280 KB Output is correct
43 Correct 137 ms 11384 KB Output is correct
44 Correct 147 ms 8888 KB Output is correct
45 Correct 135 ms 18280 KB Output is correct
46 Correct 132 ms 17272 KB Output is correct
47 Correct 149 ms 8996 KB Output is correct
48 Correct 92 ms 11696 KB Output is correct
49 Correct 90 ms 8568 KB Output is correct
50 Execution timed out 1079 ms 22720 KB Time limit exceeded
51 Halted 0 ms 0 KB -