Submission #1257907

#TimeUsernameProblemLanguageResultExecution timeMemory
1257907kawhiet은행 (IZhO14_bank)C++20
100 / 100
132 ms8520 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
    }
    vector<pair<int, int>> dp(1 << m);
    for (int s = 0; s < (1 << m); s++) {
        for (int i = 0; i < m; i++) {
            if (s & (1 << i)) continue;
            auto [id, x] = dp[s];
            int j = s | (1 << i);
            if (id == n) {
                cout << "YES" << '\n';
                return 0;
            }
            pair<int, int> cur;
            if (x + b[i] == a[id]) {
                cur = {id + 1, 0};
                if (id + 1 == n) {
                    cout << "YES" << '\n';
                    return 0;
                }
            }
            else if (x + b[i] < a[id]) {
                cur = {id, b[i] + x};
            }
            dp[j] = max(dp[j], cur);
        }
    }
    cout << "NO" << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...