oj.uz

Submission #115725

# Submission time Handle Problem Language Result Execution time Memory
115725 2019-06-08T19:13:24 Z mrboorger Bank (IZhO14_bank) C++14
100 / 100
 468 ms 21048 KB 
#include <bits/stdc++.h>

//#pragma optimize ("-Ofast")
//#pragma comment (linker, "-STACK 99999999")

#define ld long double
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
//#define int long long

using namespace std;

const int maxn = 22;
int inf = 1e9 + 15;

int a[maxn], b[maxn];
bool dp[maxn][1 << maxn];
vector <int> vc[20005];
//mask, count of pays

int32_t main()
{
#ifdef LOCAL
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#else

#endif
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for(int i = 0; i < m; i++)
    {
        cin >> b[i];
    }
    if (n > m)
    {
        cout << "NO";
        return 0;
    }
    for(int i = 0; i < (1 << m); i++)
    {
        int val = 0;
        for(int j = 0; j < m; j++)
        {
            if ((i & (1 << j)) > 0)
            {
                val += b[j];
            }
        }
        vc[val].pb(i);
    }

    dp[0][0] = true;
    for(int i = 0; i < n; i++)
        for(int mask = 0; mask < (1 << m); mask++)
    {
        if (!dp[i][mask])
        {
            continue;
        }
        for(auto j:vc[a[i]])
        {
            if ((j & mask) == 0)
            {
                dp[i + 1][j | mask] = true;
            }
        }
    }
    bool f = false;
    for(int mask = 0; mask < (1 << m); mask++)
    {
        if (dp[n][mask])
        {
            f = true;
            break;
        }
    }
    if (f)
    {
        cout << "YES";
    }
    else
    {
        cout << "NO";
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 78 ms 7032 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 2 ms 896 KB Output is correct
8 Correct 77 ms 7416 KB Output is correct
9 Correct 77 ms 6776 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 78 ms 7032 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 2 ms 896 KB Output is correct
8 Correct 77 ms 7416 KB Output is correct
9 Correct 77 ms 6776 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 3 ms 896 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 3 ms 896 KB Output is correct
17 Correct 3 ms 896 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 4 ms 1024 KB Output is correct
22 Correct 4 ms 1152 KB Output is correct
23 Correct 4 ms 1024 KB Output is correct
24 Correct 4 ms 1024 KB Output is correct
25 Correct 4 ms 1024 KB Output is correct
26 Correct 4 ms 1024 KB Output is correct
27 Correct 4 ms 1024 KB Output is correct
28 Correct 4 ms 1024 KB Output is correct
29 Correct 5 ms 1024 KB Output is correct
30 Correct 4 ms 1024 KB Output is correct
31 Correct 83 ms 8032 KB Output is correct
32 Correct 197 ms 8884 KB Output is correct
33 Correct 89 ms 7900 KB Output is correct
34 Correct 94 ms 7160 KB Output is correct
35 Correct 97 ms 7928 KB Output is correct
36 Correct 104 ms 7544 KB Output is correct
37 Correct 85 ms 7928 KB Output is correct
38 Correct 93 ms 7568 KB Output is correct
39 Correct 96 ms 10968 KB Output is correct
40 Correct 90 ms 7672 KB Output is correct
41 Correct 102 ms 6904 KB Output is correct
42 Correct 90 ms 9336 KB Output is correct
43 Correct 88 ms 8440 KB Output is correct
44 Correct 103 ms 7800 KB Output is correct
45 Correct 81 ms 9344 KB Output is correct
46 Correct 85 ms 9720 KB Output is correct
47 Correct 100 ms 7260 KB Output is correct
48 Correct 78 ms 7544 KB Output is correct
49 Correct 79 ms 6648 KB Output is correct
50 Correct 174 ms 20792 KB Output is correct
51 Correct 87 ms 6588 KB Output is correct
52 Correct 92 ms 9440 KB Output is correct
53 Correct 468 ms 13656 KB Output is correct
54 Correct 205 ms 20416 KB Output is correct
55 Correct 230 ms 20792 KB Output is correct
56 Correct 178 ms 21048 KB Output is correct
57 Correct 178 ms 20032 KB Output is correct
58 Correct 178 ms 19996 KB Output is correct