제출 #1205522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205522		tamzid	은행 (IZhO14_bank)	C++20	19 / 100	57 ms	328 KiB

bank

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << '\n';
#define dbg_var(x,y) cout<<y<<"# Debugging: "<<x<<'\n';
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int maxn = 1020;

void solve()
{
    int n,m;
    cin>>n>>m;
    vii 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=1;i<=1<<m;++i)
    {
        int s = 0;
        for(int j=0;j<m;++j)
        {
            if(i & (1 << j))
                s+=b[j];
        }
        if(s == a[0])
        {
            cout<<"YES\n";
            return;
        }
    }
    cout<<"NO\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29