제출 #873955

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
873955		cocohearts	은행 (IZhO14_bank)	C++11	0 / 100	1 ms	348 KiB

bank

#include <bits/stdc++.h>
#include <iostream>

using namespace std;

typedef long long        ll;
typedef pair<int, int>   ii;
typedef vector<ii>      vii;
typedef vector<int>      vi;

#define INF 2000000000
#define MOD 1000000007
#define loop(x,n) for(int x = 0; x < n; ++x)
#define iloop(x,a,n) for(int x=a; x<n; ++x)
#define sloop(e,s) for(auto&& e : s)
#define itloop(it,m) for(auto&& it = m.begin(); it!=m.end(); ++it)
#define F first
#define S second
#define PB push_back
#define MP make_pair

// num_paid (inc. current), left_to_pay; num=-1 if impossible
ii DP[1<<20];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M;
    cin >> N >> M;
    int salaries[N], notes[M];
    loop(i,N) {
        cin >> salaries[i];
    }
    loop(i,M) {
        cin >> notes[i];
    }
    bool solved = false;
    loop(bm,1<<M) {
        bool works = false;
        if (!bm) {
            DP[bm] = MP(0,salaries[0]);
            continue;
        }
        loop(ind,M) {
            if (bm&1<<ind) {
                int prev = bm^1<<ind;
                if (DP[prev].S==0) {
                    if (salaries[DP[prev].F+1]>=notes[ind]) {
                        DP[bm] = MP(DP[prev].F+1,salaries[DP[prev].F+1]-notes[ind]);
                    } else {continue;}
                }
                if (DP[prev].F<0 || notes[ind]>DP[prev].S) continue;
                DP[bm] = DP[prev];
                DP[bm].S -= notes[ind];
                works = true;
            }
        }
        if (DP[bm] == MP(N-1,0)) {
            solved = true;
            cout << "YES";
            break;
        }
        if (!works) {
            DP[bm] = MP(-1,-1);
        }
    }
    if (!solved) cout << "NO";
}

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