제출 #657545

#제출 시각아이디문제언어결과실행 시간메모리
657545ono_de206은행 (IZhO14_bank)C++14
46 / 100
62 ms340 KiB
#include<iostream>
#include<vector>
#include<set>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long

template<typename T>
void mxx(T &a,T b) {if(b>a) a=b;}
template<typename T> 
void mnn(T &a,T b) {if(b<a) a=b;}

const int mod=1e9+7;

void norm(int &a){
    while(a<0) a+=mod;
    while(a>=mod) a-=mod;
}

const int mxn=20100;

bool is[mxn];
int a[21];

signed main(){
    fast;
    int n,m;
    cin>>n>>m;
    vector<int> a(n),b(m);
    for(int i=0; i<n; i++) cin>>a[i];
    for(int i=0; i<m; i++) cin>>b[i];
    for(int i=0; i<(1<<m); i++){
        int sum=0;
        for(int j=0; j<m; j++){
            if(i&(1<<j)) sum+=b[j];
        }
        is[sum]=1;
    }
    bool ans=1;
    for(int i=0; i<n; i++) ans&=is[a[i]];
    cout<<(ans ? "YES\n" : "NO\n");
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...