제출 #389343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
389343		gozonite	은행 (IZhO14_bank)	C++14	100 / 100	152 ms	8588 KiB

bank

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define MOD 1000000007LL

int N, M;
int a[20], b[20];
pair<int, int> dp[1<<20];

int main() {
    //freopen("feast.in", "r", stdin);
    //freopen("feast.out", "w", stdout);
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
    
    cin >> N >> M;
    for (int i = 0; i < N; i++) cin >> a[i];
    for (int i = 0; i < M; i++) cin >> b[i];
    dp[0] = {0, 0};
    for (int bm = 1; bm < (1<<M); bm++) {
        dp[bm] = {0, 0};
        for (int i = 0; i < M; i++) {
            if (bm & (1<<i)) {
                int nbm = bm^(1<<i);
                pair<int, int> pp = dp[nbm];
                if (pp.second + b[i] < a[pp.first]) pp.second += b[i];
                else if (pp.second+b[i] == a[pp.first]) pp.first++, pp.second = 0;
                dp[bm] = max(dp[bm], pp);
                if (pp.first == N) {
                    cout << "YES" << endl;
                    return 0;
                }
                
                //cout << bitset<5>(nbm) << " : " << bitset<5>(bm) << " - " << pp.first << " " << pp.second << endl;
            }
        }
    }
    cout << "NO" << endl;
}

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