제출 #868386

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868386		LOLOLO	은행 (IZhO14_bank)	C++14	100 / 100	103 ms	10684 KiB

bank

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = (1 << 20);
int dp[N], l[N], a[N], b[N];

string solve() {
    mem(dp, -1);
    dp[0] = 0;

    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) 
        cin >> a[i];

    for (int i = 0; i < m; i++)
        cin >> b[i];

    for (int mask = 1; mask < (1 << m); mask++) {
        for (int i = 0; i < m; i++) {
            if ((mask & (1 << i)) == 0) 
                continue;

            int m1 = mask ^ (1 << i);
            if (dp[m1] == -1)
                continue;

            int r = l[m1] + b[i];
            if (r < a[dp[m1]]) {
                dp[mask] = dp[m1];
                l[mask] = r;
            } else if (r == a[dp[m1]]) {
                dp[mask] = dp[m1] + 1;
                l[mask] = 0;
            }
        }

        if (dp[mask] == n)
            return "YES";
    }

    return "NO";
}

int main() {
    int t = 1;

    while (t--) {
        cout << solve() << '\n';
    }
}

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