oj.uz

Submission #171934

# Submission time Handle Problem Language Result Execution time Memory
171934 2019-12-30T16:27:45 Z davitmarg Bank (IZhO14_bank) C++17
100 / 100
 732 ms 64364 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][(1 << 20) + 5];
int a[N], b[N], sum[(1 << 20) + 5];
vector<int> masks[N * 1003];

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];
        masks[sum[mask]].PB(mask);
        //cout << mask << " = " << sum[mask] << endl;
    }

    dp[0][0] = 1;
    LL pr = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < masks[a[i]].size(); j++)
        {
            int mask = masks[a[i]][j];
            for (int x = 0; x < masks[pr].size(); x++)
            {
                int s = masks[pr][x];
                if (dp[i - 1][s] && (mask & s) == 0)
                    dp[i][mask | s] = 1;
            }
        }
        //for (int mask = 0; mask < (1 << m); mask++)
        //   cout << i << " : " << mask << " = " << dp[i][mask] << endl;
        pr += a[i];
    }
    int ans = 0;
    for (int mask = 0; mask < (1 << m); mask++)
        ans += dp[n][mask];
    if (ans)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}

/*
 
2 4
9 10
5 4 5 5
 
000 0
001 1
010 2
011 3
100 4
101 5
110 6
111 7
 
*/

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:52:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < masks[a[i]].size(); j++)
                         ~~^~~~~~~~~~~~~~~~~~~~
bank.cpp:55:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int x = 0; x < masks[pr].size(); x++)
                             ~~^~~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1016 KB Output is correct
4 Correct 5 ms 1400 KB Output is correct
5 Correct 102 ms 11640 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 101 ms 14584 KB Output is correct
9 Correct 101 ms 10940 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 5 ms 1272 KB Output is correct
4 Correct 4 ms 1144 KB Output is correct
5 Correct 4 ms 1148 KB Output is correct
6 Correct 4 ms 1144 KB Output is correct
7 Correct 4 ms 1132 KB Output is correct
8 Correct 4 ms 1144 KB Output is correct
9 Correct 4 ms 1144 KB Output is correct
10 Correct 4 ms 1272 KB Output is correct
11 Correct 4 ms 1016 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1016 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 1016 KB Output is correct
4 Correct 5 ms 1400 KB Output is correct
5 Correct 102 ms 11640 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 101 ms 14584 KB Output is correct
9 Correct 101 ms 10940 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 2 ms 1016 KB Output is correct
12 Correct 2 ms 1016 KB Output is correct
13 Correct 3 ms 1016 KB Output is correct
14 Correct 3 ms 1016 KB Output is correct
15 Correct 3 ms 1016 KB Output is correct
16 Correct 3 ms 892 KB Output is correct
17 Correct 3 ms 1016 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 3 ms 1016 KB Output is correct
20 Correct 4 ms 1272 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Correct 5 ms 1272 KB Output is correct
23 Correct 4 ms 1144 KB Output is correct
24 Correct 4 ms 1148 KB Output is correct
25 Correct 4 ms 1144 KB Output is correct
26 Correct 4 ms 1132 KB Output is correct
27 Correct 4 ms 1144 KB Output is correct
28 Correct 4 ms 1144 KB Output is correct
29 Correct 4 ms 1272 KB Output is correct
30 Correct 4 ms 1016 KB Output is correct
31 Correct 106 ms 13648 KB Output is correct
32 Correct 307 ms 18552 KB Output is correct
33 Correct 108 ms 12408 KB Output is correct
34 Correct 115 ms 11484 KB Output is correct
35 Correct 118 ms 12252 KB Output is correct
36 Correct 114 ms 11740 KB Output is correct
37 Correct 108 ms 12024 KB Output is correct
38 Correct 107 ms 11768 KB Output is correct
39 Correct 123 ms 26516 KB Output is correct
40 Correct 105 ms 11768 KB Output is correct
41 Correct 110 ms 11128 KB Output is correct
42 Correct 142 ms 20088 KB Output is correct
43 Correct 114 ms 12920 KB Output is correct
44 Correct 122 ms 12152 KB Output is correct
45 Correct 108 ms 19448 KB Output is correct
46 Correct 112 ms 15500 KB Output is correct
47 Correct 113 ms 11512 KB Output is correct
48 Correct 102 ms 13964 KB Output is correct
49 Correct 103 ms 10872 KB Output is correct
50 Correct 203 ms 64188 KB Output is correct
51 Correct 149 ms 11000 KB Output is correct
52 Correct 212 ms 16212 KB Output is correct
53 Correct 732 ms 37972 KB Output is correct
54 Correct 228 ms 61884 KB Output is correct
55 Correct 204 ms 64312 KB Output is correct
56 Correct 200 ms 64364 KB Output is correct
57 Correct 201 ms 60476 KB Output is correct
58 Correct 209 ms 60556 KB Output is correct