oj.uz

Submission #930411

# Submission time Handle Problem Language Result Execution time Memory
930411 2024-02-19T14:55:58 Z uped Bank (IZhO14_bank) C++14
100 / 100
 95 ms 8652 KB 
#include <bits/stdc++.h>

#define DEBUG(x) cout << #x << ": " << x << '\n';

using namespace std;
using ll = long long;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> b(m);
    for (int i = 0; i < m; ++i) {
        cin >> b[i];
    }
    // dp of subset X -> num of people in prefix, leftover sum.
    // left-over must equal be for num of people and set
    // so we must maximize prefix
    vector<pair<int, int>> dp(1 << m, {-1, -1});
    dp[0] = {0, 0};
    bool ok = false;
    for (int i = 1; i < (1 << m); ++i) {
        for (int j = 0; j < m; ++j) {
            if (!(i & (1 << j))) continue; // j not in i
            auto& [cnt, leftover] = dp[i ^ (1 << j)];
            if (cnt == -1) continue; // impossible state
            int target = a[cnt]; // current salary we try to fill
            // only one can be always satisfied!
            if (leftover + b[j] < target) {
                dp[i] = {cnt, leftover + b[j]};
            } else if (leftover + b[j] == target) {
                dp[i] = {cnt + 1, 0};
            }
        }
        if (dp[i].first == n) {
            ok = true;
            break;
        }   
    }
    cout << (ok ? "YES" : "NO");
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:28:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   28 |             auto& [cnt, leftover] = dp[i ^ (1 << j)];
      |                   ^

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 71 ms 8632 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 71 ms 8540 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 71 ms 8632 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 71 ms 8540 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 440 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 84 ms 8632 KB Output is correct
32 Correct 86 ms 8536 KB Output is correct
33 Correct 71 ms 8636 KB Output is correct
34 Correct 72 ms 8540 KB Output is correct
35 Correct 70 ms 8540 KB Output is correct
36 Correct 72 ms 8536 KB Output is correct
37 Correct 71 ms 8536 KB Output is correct
38 Correct 71 ms 8540 KB Output is correct
39 Correct 3 ms 8540 KB Output is correct
40 Correct 73 ms 8540 KB Output is correct
41 Correct 73 ms 8536 KB Output is correct
42 Correct 95 ms 8536 KB Output is correct
43 Correct 72 ms 8540 KB Output is correct
44 Correct 74 ms 8652 KB Output is correct
45 Correct 3 ms 8540 KB Output is correct
46 Correct 82 ms 8632 KB Output is correct
47 Correct 74 ms 8636 KB Output is correct
48 Correct 3 ms 8536 KB Output is correct
49 Correct 70 ms 8632 KB Output is correct
50 Correct 78 ms 8540 KB Output is correct
51 Correct 73 ms 8540 KB Output is correct
52 Correct 73 ms 8540 KB Output is correct
53 Correct 84 ms 8636 KB Output is correct
54 Correct 81 ms 8540 KB Output is correct
55 Correct 75 ms 8636 KB Output is correct
56 Correct 80 ms 8540 KB Output is correct
57 Correct 79 ms 8540 KB Output is correct
58 Correct 80 ms 8540 KB Output is correct