oj.uz

Submission #669178

# Submission time Handle Problem Language Result Execution time Memory
669178 2022-12-06T02:06:16 Z irmuun Bank (IZhO14_bank) C++17
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main(){
    int n,m;
    cin>>n>>m;
    int a[n+5],b[m+5];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<m;i++){
        cin>>b[i];
    }
    vector<int>v[n+5];
    for(int i=0;i<(1<<m);i++){
        int cur=0;
        for(int j=0;j<m;j++){
            if((i&(1<<j))==1){
                cur+=a[j];
            }
        }
        for(int j=0;j<n;j++){
            if(a[j]==cur){
                v[j].pb(i);
            }
        }
    }
    for(int i=0;i<n;i++){
        if(v[i].size()==0){
            cout<<"NO";
            return 0;
        }
    }
    int dp[m+5][(1<<m)+5];
    for(int i=0;i<m;i++){
        fill(dp[i],dp[i]+(1<<m)+1,0);
    }
    for(auto x:v[0]){
        dp[0][x]=1;
    }
    for(int i=1;i<n;i++){
        for(int j=0;j<(1<<m);j++){
            if(dp[i-1][j]==0){
                continue;
            }
            for(auto x:v[i]){
                if((x&j)==0){
                    dp[i][x+j]=1;
                }
            }
        }
    }
    for(int i=0;i<(1<<m);i++){
        if(dp[n-1][i]==1){
            cout<<"YES";
            return 0;
        }
    }
    cout<<"NO";
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -