oj.uz

Submission #739934

# Submission time Handle Problem Language Result Execution time Memory
739934 2023-05-11T16:58:02 Z aykhn Bank (IZhO14_bank) C++14
100 / 100
 208 ms 43548 KB 
#include <bits/stdc++.h>


/*
    author: aykhn
*/
using namespace std;

typedef long long ll;

#define OPT ios_base::sync_with_stdio(0); \
            cin.tie(0); \
            cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pss pair<long,long>
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl;

int n, m;
vector<int> a, b;
vector<vector<short>> dp(20, vector<short> ((1 << 20), -1));

int f(int i, int mask, int s)
{
    if (i == n) return true;
    if (s > a[i]) return false;
    if (s == a[i]) return f(i + 1, mask, 0);
    if (!bpc(mask)) return false;

    if (dp[i][mask] != -1) return dp[i][mask];

    bool res = 0;

    for (int j = 0; j < m; j++)
    {
        if (mask & (1 << j)) res |= f(i, mask ^ (1 << j), s + b[j]);
    }

    return dp[i][mask] = res;
}

int main()
{
    OPT;
    cin >> n >> m;

    a.assign(n, 0);
    b.assign(m, 0);

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

    cout << (f(0, (1 << m) - 1, 0) ? "YES" : "NO") << endl;;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 43476 KB Output is correct
2 Correct 16 ms 43372 KB Output is correct
3 Correct 16 ms 43400 KB Output is correct
4 Correct 18 ms 43476 KB Output is correct
5 Correct 18 ms 43448 KB Output is correct
6 Correct 17 ms 43440 KB Output is correct
7 Correct 18 ms 43348 KB Output is correct
8 Correct 80 ms 43372 KB Output is correct
9 Correct 132 ms 43348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 43420 KB Output is correct
2 Correct 19 ms 43476 KB Output is correct
3 Correct 18 ms 43448 KB Output is correct
4 Correct 17 ms 43372 KB Output is correct
5 Correct 19 ms 43348 KB Output is correct
6 Correct 18 ms 43348 KB Output is correct
7 Correct 20 ms 43420 KB Output is correct
8 Correct 19 ms 43476 KB Output is correct
9 Correct 19 ms 43404 KB Output is correct
10 Correct 24 ms 43452 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 43428 KB Output is correct
2 Correct 21 ms 43348 KB Output is correct
3 Correct 20 ms 43396 KB Output is correct
4 Correct 21 ms 43348 KB Output is correct
5 Correct 20 ms 43464 KB Output is correct
6 Correct 20 ms 43412 KB Output is correct
7 Correct 20 ms 43460 KB Output is correct
8 Correct 23 ms 43444 KB Output is correct
9 Correct 21 ms 43348 KB Output is correct
10 Correct 20 ms 43388 KB Output is correct
11 Correct 21 ms 43340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 43476 KB Output is correct
2 Correct 16 ms 43372 KB Output is correct
3 Correct 16 ms 43400 KB Output is correct
4 Correct 18 ms 43476 KB Output is correct
5 Correct 18 ms 43448 KB Output is correct
6 Correct 17 ms 43440 KB Output is correct
7 Correct 18 ms 43348 KB Output is correct
8 Correct 80 ms 43372 KB Output is correct
9 Correct 132 ms 43348 KB Output is correct
10 Correct 18 ms 43420 KB Output is correct
11 Correct 19 ms 43476 KB Output is correct
12 Correct 18 ms 43448 KB Output is correct
13 Correct 17 ms 43372 KB Output is correct
14 Correct 19 ms 43348 KB Output is correct
15 Correct 18 ms 43348 KB Output is correct
16 Correct 20 ms 43420 KB Output is correct
17 Correct 19 ms 43476 KB Output is correct
18 Correct 19 ms 43404 KB Output is correct
19 Correct 24 ms 43452 KB Output is correct
20 Correct 21 ms 43428 KB Output is correct
21 Correct 21 ms 43348 KB Output is correct
22 Correct 20 ms 43396 KB Output is correct
23 Correct 21 ms 43348 KB Output is correct
24 Correct 20 ms 43464 KB Output is correct
25 Correct 20 ms 43412 KB Output is correct
26 Correct 20 ms 43460 KB Output is correct
27 Correct 23 ms 43444 KB Output is correct
28 Correct 21 ms 43348 KB Output is correct
29 Correct 20 ms 43388 KB Output is correct
30 Correct 21 ms 43340 KB Output is correct
31 Correct 120 ms 43420 KB Output is correct
32 Correct 135 ms 43472 KB Output is correct
33 Correct 30 ms 43476 KB Output is correct
34 Correct 19 ms 43476 KB Output is correct
35 Correct 24 ms 43348 KB Output is correct
36 Correct 19 ms 43348 KB Output is correct
37 Correct 20 ms 43468 KB Output is correct
38 Correct 20 ms 43456 KB Output is correct
39 Correct 41 ms 43348 KB Output is correct
40 Correct 25 ms 43368 KB Output is correct
41 Correct 19 ms 43348 KB Output is correct
42 Correct 91 ms 43388 KB Output is correct
43 Correct 22 ms 43348 KB Output is correct
44 Correct 20 ms 43348 KB Output is correct
45 Correct 77 ms 43436 KB Output is correct
46 Correct 47 ms 43548 KB Output is correct
47 Correct 20 ms 43408 KB Output is correct
48 Correct 40 ms 43388 KB Output is correct
49 Correct 19 ms 43464 KB Output is correct
50 Correct 188 ms 43376 KB Output is correct
51 Correct 22 ms 43456 KB Output is correct
52 Correct 26 ms 43364 KB Output is correct
53 Correct 157 ms 43412 KB Output is correct
54 Correct 202 ms 43368 KB Output is correct
55 Correct 181 ms 43476 KB Output is correct
56 Correct 179 ms 43336 KB Output is correct
57 Correct 182 ms 43348 KB Output is correct
58 Correct 208 ms 43348 KB Output is correct