제출 #1128265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128265		rasbery303	은행 (IZhO14_bank)	C++20	19 / 100	162 ms	420 KiB

bank

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 1001;
int n, m, a[N], b[N];

bool bit(int mask, int pos){
    return (mask>>(pos-1))&1;
}

int main(){
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    for (int i= 1; i <= m; ++i)
        cin >> b[i];

    sort(a+1, a+n+1);
    sort(b+1, b+m+1);

    bool ans = true;
    vector<int> del;
    for (int i = 1; i <= n && ans; ++i){
        for (int mask = 0; mask < (1<<(m+1)); ++mask){
            del.clear();
            int sum = 0;
            for (int k = 1; k <= m; ++k){
                if (bit(mask, k)){
                    sum += b[k];
                    del.push_back(k);
                }
            }
            if (sum==a[i]){
                for (int&x: del)
                    b[x] = 0;
                del.clear();
                break;
            }
        }
        // cout << "i = " << i << "\t";
        // for (int j = 1; j <= m; ++j)
        //     cout << b[j] << " \n"[j==m];
        if (!del.empty())
            ans = false;
    }

    cout << (ans? "YES" : "NO");
    return 0;
}

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