제출 #752950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
752950		Magikarp4000	은행 (IZhO14_bank)	C++17	100 / 100	120 ms	8532 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 20;
int n,m;
int a[MAXN], b[MAXN], dp[1<<MAXN], dp1[1<<MAXN];

signed main() {
    cin >> n >> m;
    FOR(i,0,n) cin >> a[i];
    FOR(i,0,m) cin >> b[i];
    FOR(s,0,1<<m) dp[s] = dp1[s] = -INF;
    dp[0] = -1;
    dp1[0] = 0;
    FOR(s,0,1<<m) {
        FOR(j,0,m) {
            if (s&(1<<j)) {
                if (dp[s^(1<<j)] == n-1 || dp[s^(1<<j)] == -INF) continue;
                int x = dp[s^(1<<j)];
                int rem = dp1[s^(1<<j)]+b[j];
                if (rem > a[dp[s^(1<<j)]+1]) continue;
                if (dp1[s^(1<<j)]+b[j] == a[dp[s^(1<<j)]+1]) {
                    x++; rem = 0;
                }
                if (x > dp[s]) {
                    dp[s] = x;
                    dp1[s] = rem;
                }
                else if (x == dp[s]) dp1[s] = rem;
            }
        }
    }
    FOR(s,0,1<<m) {
        if (dp[s] == n-1 && dp1[s] == 0) {
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

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