제출 #1042988

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042988		Phuoc	은행 (IZhO14_bank)	C++14	19 / 100	55 ms	600 KiB

bank

#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set> 

using namespace std;
 
#define ll long long
#define pb push_back
#define el '\n'
#define mpair make_pair
#define MASK(i) (1LL << (i))
#define BIT(mask, i) (((mask) >> (i)) & 1)
#define fi first
#define se second
 
/* Author: Pham Gia Phuoc */
 
const ll MOD = (ll)(1e9) + 7LL;
 
template <class T1, class T2>
    void add(T1 &a, T2 b){
        a += b;
        if(a >= MOD) a -= MOD;
    }
 
template <class T1, class T2>
    void sub(T1 &a, T2 b){
        a -= b;
        if(a < 0) a += MOD;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if(a > b){a = b; return true;} return false;
    }
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if(a < b){a = b; return true;} return false;
    }
 
/** END OF TEMPLATE. DRINK A CUP OF COFFEE BEFORE READING MY CODE **/
 
const int MAX = 22;
const ll INF = (ll) 1e18 + 67LL;
const int oo = (int)(1e9 + 7);
const int NUM_BIT = 62;

#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FORD(i, a, b) for(int i = a; i >= b; i--)

int n, m;
long long salaryVal[MAX], bankNote[MAX];

void init(){    
    cin >> n >> m;
    FOR(i, 1, n) cin >> salaryVal[i];
    FOR(i, 1, m) cin >> bankNote[i];
}

namespace subtask1{
    bool check(){
        return n == 1;
    }

    string solve(){
        FOR(mask, 0, MASK(m) - 1){
            long long sum = 0;
            FOR(i, 0, m - 1) if(BIT(mask, i)) sum += bankNote[i + 1];
            if(sum == salaryVal[1]) return "YES";
        }
        return "NO";
    }
}

void solve(){
    if(subtask1::check()){cout << subtask1::solve(); return;}

}           

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define test "test"
    // freopen(test".inp", "r", stdin);
    // freopen(test".out", "w", stdout);
    srand(time(0));
    int t;
    // cin >> t;
    t = 1;
    while(t--){
        init();
        solve();
    }

    return 0;
}


 
/*** ROAD TO VOI 2025 ***/

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