제출 #859522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
859522		overwatch9	Bank (IZhO14_bank)	C++17	44 / 100	1075 ms	596 KiB

bank

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector <int> sums(n);
    for (int i = 0; i < n; i++)
        cin >> sums[i];
    vector <int> notes(m);
    for (int i = 0; i < m; i++)
        cin >> notes[i];
    if (n == 1) {
        for (int i = 0; i < (1 << m); i++) {
            int s = 0;
            for (int j = 0; j < m; j++) {
                if (i & (1 << j))
                    s += notes[j];
            }
            if (s == sums[0]) {
                cout << "YES\n";
                return 0;
            }
        }
        cout << "NO\n";
        return 0;
    } else {
        sort(notes.begin(), notes.end());
        do {
            int p = 0, tot = 0;
            for (int i = 0; i < m && p < n; i++) {
                tot += notes[i];
                if (tot == sums[p]) {
                    p++;
                    tot = 0;
                } else if (tot > sums[p])
                    break;
            }
            if (p >= n) {
                cout << "YES\n";
                return 0;
            }
        } while (next_permutation(notes.begin(), notes.end()));
        cout << "NO\n";
        return 0;
    }
}

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