제출 #594152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
594152		leroycut	은행 (IZhO14_bank)	C++17	0 / 100	43 ms	8544 KiB

bank

#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;
 
const int N = 100003, mod = 1e9 + 7, inf = 1e9 + 7;

int n, m;


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    // freopen("movie.in", "r", stdin);
    // freopen("movie.out", "w", stdout);

    
    cin >> n >> m;
    vector<int> vn(n), vm(m), last((1 << m)), dp((1 << m));

    for(int i = 0; i < n; ++i){
        cin >> vn[i];
    }
    for(int j = 0; j < m; ++j){
        cin >> vm[j];
    }

    dp[0] = 0;
    last[0] = 0;

    for(int s = 1; s < (1 << m); ++s){
        for(int i = 0; i < m; ++i){
            if((s & (1 << i))){
                int prev = s - (1 << i);
                if(dp[prev] == n){
                    dp[s] = n;
                    break;
                }
                if(last[prev] + vm[i] < vn[dp[prev]]){
                    dp[s] = dp[prev];
                    last[s] = last[prev] + vm[i];
                    break;
                }
                if(last[prev] + vm[i] == vn[dp[prev]]){
                    dp[s] = dp[prev] + 1;
                    last[s] = 0;
                    break;
                }
            }
        }
        // cout << dp[s] << " " << last[s] << "\n";
    }

    if(dp[(1 << m) - 1] == n){
        cout << "YES";
    }
    else{
        cout << "NO";
    }
    // cout << dp[(1 << m) - 1];
}

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