oj.uz

Submission #562714

# Submission time Handle Problem Language Result Execution time Memory
562714 2022-05-15T04:30:58 Z Bobonbush Bank (IZhO14_bank) C++17
100 / 100
 255 ms 82608 KB 
#include <bits/stdc++.h>
#define foreach for
#define in :
using namespace std;
typedef long long ll;

/*
Konichiwa
Konichiwa
Ara ~~ ara

Bob no taisuki - Shinobu Kocho
    * * * * *
  *          *
 *         *
*         *        I love SHINOBU <3 <3 <3
 *         *
  *          *
    * * * * *
*/

/*
_________________________


    Author : Bob15324

_________________________
*/

template<class X , class Y>
    bool Minimize(X & x , Y y)
    {
        if(x == -1 || x >y)
        {
            x = y;
            return true;
        }
        return false;
    }

template<class X , class Y>
    bool Maximize(X & x , Y y)
    {
        if( x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

/* End of templates. Let's see what do we have here */
const int N = 20;
int a[N];
int b[N];
int n , m;
int cnt[1001] , dict[1001];
vector<int>List[21];
int dp[N][1 << N];

int DP(int i , int mask )
{

    if(i == n)
    {
        throw 1;
    }
    if(mask == (1 << m)-1)
    {
        return 0;
    }
    if(dp[i][mask] != -1)
    {
        return dp[i][mask];
    }
    dp[i][mask] = 0;
    foreach(int x in List[dict[a[i]]] )
    {
        if(mask & (x))
        {
            continue;
        }
        Maximize(dp[i][mask] ,  DP(i+1 , mask |x));
    }

    return dp[i][mask];
}


int main()
{
    ios_base :: sync_with_stdio(0);cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n ; i++)
    {
        cin >> a[i-1];
        cnt[a[i-1]]++;
    }
    for(int i = 1; i <= m ; i++)
    {
        cin >> b[i-1];
    }
    int dem = 0;
    for(int mask = 1 ; mask <= (1 << m)-1 ; mask++ )
    {
        int sum = 0;
        for(int i = 0 ; i < m ; i++)
        {
            if(mask & (1 << i))
            {
                sum += b[i];
            }
        }
        if(sum <= 1000 && cnt[sum])
        {
            if(dict[sum] == 0)
            {
                dict[sum] = ++dem;
            }
            List[dict[sum]].push_back(mask);
        }
    }

    memset(dp , -1 , sizeof(dp));
    try
    {
        DP(0 , 0);
    }catch(int)
    {
        cout << "YES" <<'\n';
        return 0;
    }
    cout << "NO" <<'\n';




    return 0;
}

//Ehem. My code is amazing. Pay me 2$.Thank you.

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82380 KB Output is correct
2 Correct 31 ms 82260 KB Output is correct
3 Correct 33 ms 82460 KB Output is correct
4 Correct 33 ms 82392 KB Output is correct
5 Correct 83 ms 82380 KB Output is correct
6 Correct 30 ms 82276 KB Output is correct
7 Correct 33 ms 82536 KB Output is correct
8 Correct 84 ms 82488 KB Output is correct
9 Correct 93 ms 82284 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 82388 KB Output is correct
2 Correct 33 ms 82416 KB Output is correct
3 Correct 31 ms 82392 KB Output is correct
4 Correct 31 ms 82380 KB Output is correct
5 Correct 31 ms 82384 KB Output is correct
6 Correct 39 ms 82360 KB Output is correct
7 Correct 36 ms 82380 KB Output is correct
8 Correct 33 ms 82392 KB Output is correct
9 Correct 32 ms 82348 KB Output is correct
10 Correct 32 ms 82372 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 82436 KB Output is correct
2 Correct 33 ms 82456 KB Output is correct
3 Correct 33 ms 82392 KB Output is correct
4 Correct 32 ms 82300 KB Output is correct
5 Correct 35 ms 82284 KB Output is correct
6 Correct 33 ms 82348 KB Output is correct
7 Correct 34 ms 82420 KB Output is correct
8 Correct 33 ms 82400 KB Output is correct
9 Correct 33 ms 82352 KB Output is correct
10 Correct 33 ms 82432 KB Output is correct
11 Correct 30 ms 82364 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82380 KB Output is correct
2 Correct 31 ms 82260 KB Output is correct
3 Correct 33 ms 82460 KB Output is correct
4 Correct 33 ms 82392 KB Output is correct
5 Correct 83 ms 82380 KB Output is correct
6 Correct 30 ms 82276 KB Output is correct
7 Correct 33 ms 82536 KB Output is correct
8 Correct 84 ms 82488 KB Output is correct
9 Correct 93 ms 82284 KB Output is correct
10 Correct 33 ms 82388 KB Output is correct
11 Correct 33 ms 82416 KB Output is correct
12 Correct 31 ms 82392 KB Output is correct
13 Correct 31 ms 82380 KB Output is correct
14 Correct 31 ms 82384 KB Output is correct
15 Correct 39 ms 82360 KB Output is correct
16 Correct 36 ms 82380 KB Output is correct
17 Correct 33 ms 82392 KB Output is correct
18 Correct 32 ms 82348 KB Output is correct
19 Correct 32 ms 82372 KB Output is correct
20 Correct 34 ms 82436 KB Output is correct
21 Correct 33 ms 82456 KB Output is correct
22 Correct 33 ms 82392 KB Output is correct
23 Correct 32 ms 82300 KB Output is correct
24 Correct 35 ms 82284 KB Output is correct
25 Correct 33 ms 82348 KB Output is correct
26 Correct 34 ms 82420 KB Output is correct
27 Correct 33 ms 82400 KB Output is correct
28 Correct 33 ms 82352 KB Output is correct
29 Correct 33 ms 82432 KB Output is correct
30 Correct 30 ms 82364 KB Output is correct
31 Correct 89 ms 82424 KB Output is correct
32 Correct 89 ms 82608 KB Output is correct
33 Correct 85 ms 82368 KB Output is correct
34 Correct 86 ms 82364 KB Output is correct
35 Correct 88 ms 82364 KB Output is correct
36 Correct 96 ms 82508 KB Output is correct
37 Correct 87 ms 82384 KB Output is correct
38 Correct 87 ms 82364 KB Output is correct
39 Correct 85 ms 82380 KB Output is correct
40 Correct 84 ms 82380 KB Output is correct
41 Correct 85 ms 82364 KB Output is correct
42 Correct 95 ms 82392 KB Output is correct
43 Correct 83 ms 82376 KB Output is correct
44 Correct 84 ms 82372 KB Output is correct
45 Correct 87 ms 82368 KB Output is correct
46 Correct 101 ms 82392 KB Output is correct
47 Correct 95 ms 82496 KB Output is correct
48 Correct 90 ms 82388 KB Output is correct
49 Correct 86 ms 82468 KB Output is correct
50 Correct 86 ms 82380 KB Output is correct
51 Correct 91 ms 82524 KB Output is correct
52 Correct 100 ms 82368 KB Output is correct
53 Correct 99 ms 82496 KB Output is correct
54 Correct 88 ms 82368 KB Output is correct
55 Correct 86 ms 82452 KB Output is correct
56 Correct 88 ms 82380 KB Output is correct
57 Correct 255 ms 82380 KB Output is correct
58 Correct 92 ms 82372 KB Output is correct