oj.uz

Submission #724774

# Submission time Handle Problem Language Result Execution time Memory
724774 2023-04-16T00:08:23 Z vjudge1 Bank (IZhO14_bank) C++17
100 / 100
 192 ms 90316 KB 
#include<bits/stdc++.h>
#define INF 1e9+7
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define pdd pair<double,double>
#define pipii pair<int,pii>
#define plpll pair<ll,pll>
#define vi vector<int>
#define vvi vector<vi>
#define v3i vector<vvi>
#define v4i vector<v3i>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define ins insert
#define ln '\n'
#define all(v) v.begin(),v.end()
using namespace std;

const int up=(1<<20);
int n,m;
vvi total_sum(20001);
int a[20],b[20];
int dp[up][20];

bool solution(int mask,int u){
    if(u==-1){
        return true;
    }
    if(dp[mask][u]!=-1) return dp[mask][u];
    for(auto to:total_sum[a[u]]){
        int k=mask&to;
        if(k==to){
            if(solution(mask^to,u-1)){
                return dp[mask][u]=true;
            }
        }
    }
    return dp[mask][u]=false;
}

void solve(){
    //ifstream cin("bank.in");
    //ofstream cout("bank.out");
    memset(dp,-1,sizeof(dp));
    cin>>n>>m;
    for(int i=0;i<n;++i){
        cin>>a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    for(int mask=1;mask<(1<<m);++mask){
        int sum=0;
        for(int j=0;j<m;++j){
            if(mask&(1<<j)){
                sum+=b[j];
            }
        }
        //cout<<sum<<" "<<mask<<ln;
        total_sum[sum].eb(mask);
    }
    bool res=solution((1<<m)-1,n-1)<<ln;
    //cout<<res<<ln;
    if(res){
        cout<<"YES"<<ln;
    }
    else{
        cout<<"NO"<<ln;
    }
    //cin.close();
    //cout.close();
}

int main ()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++){
        solve();
    }
}
/*
10 10
0 1 10 100
1 1 5 3
1 7 9 8
0 1 10 9
2 1 2 3
2 9 4
0 1 10 100
1 1 10 2
0 1 10 1000
2 1 5 2
0 1 6
1



0
ll
10
1 2
2 4
4 8
4 9
2 5
1 3
3 6
6 10
3 7
*/

Compilation message

bank.cpp: In function 'bool solution(int, int)':
bank.cpp:39:35: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   39 |                 return dp[mask][u]=true;
      |                        ~~~~~~~~~~~^~~~~
bank.cpp:43:23: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   43 |     return dp[mask][u]=false;
      |            ~~~~~~~~~~~^~~~~~
bank.cpp: In function 'void solve()':
bank.cpp:67:36: warning: '<<' in boolean context, did you mean '<'? [-Wint-in-bool-context]
   67 |     bool res=solution((1<<m)-1,n-1)<<ln;
      |                                    ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82768 KB Output is correct
2 Correct 32 ms 82848 KB Output is correct
3 Correct 32 ms 82924 KB Output is correct
4 Correct 34 ms 83064 KB Output is correct
5 Correct 97 ms 89156 KB Output is correct
6 Correct 36 ms 82812 KB Output is correct
7 Correct 30 ms 82844 KB Output is correct
8 Correct 99 ms 88528 KB Output is correct
9 Correct 97 ms 88872 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 82764 KB Output is correct
2 Correct 31 ms 82796 KB Output is correct
3 Correct 37 ms 82772 KB Output is correct
4 Correct 33 ms 82824 KB Output is correct
5 Correct 31 ms 82880 KB Output is correct
6 Correct 33 ms 82752 KB Output is correct
7 Correct 33 ms 82832 KB Output is correct
8 Correct 31 ms 82780 KB Output is correct
9 Correct 33 ms 82796 KB Output is correct
10 Correct 33 ms 82804 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 83028 KB Output is correct
2 Correct 32 ms 83004 KB Output is correct
3 Correct 38 ms 83040 KB Output is correct
4 Correct 32 ms 82896 KB Output is correct
5 Correct 33 ms 82892 KB Output is correct
6 Correct 36 ms 83016 KB Output is correct
7 Correct 35 ms 82912 KB Output is correct
8 Correct 36 ms 82968 KB Output is correct
9 Correct 33 ms 83008 KB Output is correct
10 Correct 34 ms 82928 KB Output is correct
11 Correct 33 ms 82892 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82768 KB Output is correct
2 Correct 32 ms 82848 KB Output is correct
3 Correct 32 ms 82924 KB Output is correct
4 Correct 34 ms 83064 KB Output is correct
5 Correct 97 ms 89156 KB Output is correct
6 Correct 36 ms 82812 KB Output is correct
7 Correct 30 ms 82844 KB Output is correct
8 Correct 99 ms 88528 KB Output is correct
9 Correct 97 ms 88872 KB Output is correct
10 Correct 34 ms 82764 KB Output is correct
11 Correct 31 ms 82796 KB Output is correct
12 Correct 37 ms 82772 KB Output is correct
13 Correct 33 ms 82824 KB Output is correct
14 Correct 31 ms 82880 KB Output is correct
15 Correct 33 ms 82752 KB Output is correct
16 Correct 33 ms 82832 KB Output is correct
17 Correct 31 ms 82780 KB Output is correct
18 Correct 33 ms 82796 KB Output is correct
19 Correct 33 ms 82804 KB Output is correct
20 Correct 39 ms 83028 KB Output is correct
21 Correct 32 ms 83004 KB Output is correct
22 Correct 38 ms 83040 KB Output is correct
23 Correct 32 ms 82896 KB Output is correct
24 Correct 33 ms 82892 KB Output is correct
25 Correct 36 ms 83016 KB Output is correct
26 Correct 35 ms 82912 KB Output is correct
27 Correct 36 ms 82968 KB Output is correct
28 Correct 33 ms 83008 KB Output is correct
29 Correct 34 ms 82928 KB Output is correct
30 Correct 33 ms 82892 KB Output is correct
31 Correct 93 ms 89272 KB Output is correct
32 Correct 99 ms 88504 KB Output is correct
33 Correct 111 ms 89004 KB Output is correct
34 Correct 108 ms 89360 KB Output is correct
35 Correct 104 ms 90316 KB Output is correct
36 Correct 101 ms 89904 KB Output is correct
37 Correct 105 ms 90300 KB Output is correct
38 Correct 104 ms 89908 KB Output is correct
39 Correct 95 ms 87760 KB Output is correct
40 Correct 97 ms 89700 KB Output is correct
41 Correct 98 ms 89152 KB Output is correct
42 Correct 99 ms 88296 KB Output is correct
43 Correct 99 ms 90140 KB Output is correct
44 Correct 110 ms 90212 KB Output is correct
45 Correct 98 ms 89260 KB Output is correct
46 Correct 98 ms 90160 KB Output is correct
47 Correct 100 ms 89628 KB Output is correct
48 Correct 95 ms 88524 KB Output is correct
49 Correct 101 ms 88660 KB Output is correct
50 Correct 100 ms 87712 KB Output is correct
51 Correct 109 ms 88648 KB Output is correct
52 Correct 192 ms 87828 KB Output is correct
53 Correct 103 ms 87712 KB Output is correct
54 Correct 98 ms 87724 KB Output is correct
55 Correct 90 ms 87640 KB Output is correct
56 Correct 91 ms 88404 KB Output is correct
57 Correct 121 ms 88420 KB Output is correct
58 Correct 104 ms 88420 KB Output is correct