oj.uz

답안 #980373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980373 2024-05-12T06:49:16 Z 54skyxenon 은행 (IZhO14_bank) C++17
19 / 100
 81 ms 8540 KB 
// https://oj.uz/problem/view/IZhO14_bank 

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

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

    vector<int> A(n);
    for (int& a : A) {
        cin >> a;
    }

    vector<int> B(m);
    for (int& b : B) {
        cin >> b;
    }

    vector<int> dp_prefix(1 << m);
    vector<int> dp_remaining(1 << m);

    for (int bitmask = 1; bitmask < (1 << m); bitmask++) {
        for (int last = 0; last < m; last++) {
            if (!(bitmask & (1 << last))) {
                continue;
            }

            int previous = bitmask ^ (1 << last);
            int sum = dp_remaining[previous] + B[last];

            if (sum == A[dp_prefix[previous]]) {
                dp_prefix[bitmask] = dp_prefix[previous] + 1;
                dp_remaining[bitmask] = 0;
            }
            else {
                dp_prefix[bitmask] = dp_prefix[previous];
                dp_remaining[bitmask] = B[last] + dp_remaining[previous];
            }
        }

        if (dp_prefix[bitmask] == n) {
            cout << "YES\n";
            return 0;
        }
    }

    cout << "NO\n";
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 79 ms 8540 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 81 ms 8536 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 79 ms 8540 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 3 ms 8540 KB Output is correct
9 Correct 81 ms 8536 KB Output is correct
10 Incorrect 0 ms 348 KB Output isn't correct
11 Halted 0 ms 0 KB -