제출 #1325067

#제출 시각아이디문제언어결과실행 시간메모리
1325067yusifm은행 (IZhO14_bank)C++20
19 / 100
490 ms420 KiB
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
const int sz=1000000,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,num1,num2,sum;
    bool flag=false;
    cin>>n>>m;
    vector<ll>nums1,nums2;
    for(int i=0;i<n;i++)
    {
        cin>>num1;
        nums1.pb(num1);
    }
    for(int i=0;i<m;i++)
    {
        cin>>num2;
        nums2.pb(num2);
    }
    for(int i=0;i<pow(2,nums2.size());i++)
    {
        sum=0;
        for(int j=0;j<nums2.size();j++)
        {
            if(i&(ll)pow(2,j))
            {
                sum+=nums2[j];
            }
        }
        if(sum==nums1[0])
        {
            flag=true;
            break;
        }
    }
    if(flag)
    {
        cout<<"YES";
    }
    else
    {
        cout<<"NO";
    }
}
int main()
{
    fastIO;
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...