제출 #999670

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
999670		a5a7	은행 (IZhO14_bank)	C++14	71 / 100	75 ms	8640 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> 
using indexedset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;

pair<int, int> dp[1<<20];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int a[n];
    int 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++){
        dp[i] = {-1, 0};
    }
    dp[0].first = 0;
    for (int i = 0; i < (1<<m); i++){
        for (int j = 0; j < m; j++){
            if (dp[i].first == n){
                cout << "YES" << endl;
                return 0;
            }
            if (i&(1<<j)) continue;
            if (dp[i^(1<<j)].first != -1) continue;
            if ((dp[i].second+b[j]) <= a[dp[i].first]){
                dp[i^(1<<j)].first = dp[i].first;
                dp[i^(1<<j)].second = dp[i].second+b[j];
                if (dp[i^(1<<j)].second == a[dp[i].first]){
                    dp[i^(1<<j)].first++;
                    dp[i^(1<<j)].second = 0;
                }
            }
        }
    }
    cout << "NO" << endl;
}

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