oj.uz

Submission #723484

# Submission time Handle Problem Language Result Execution time Memory
723484 2023-04-13T23:15:05 Z PanosPask Bank (IZhO14_bank) C++14
100 / 100
 573 ms 1112 KB 
#include <bits/stdc++.h>
#define MAXN 20
#define CHECK_BIT(var, pos) (var & (1 << pos))

using namespace std;

int n, m;
// dp[i]: Contains all of the possible remaining sets of banknotes after serving the first i customers 
unordered_set<int> dp[MAXN + 2];

vector<int> accept_by[MAXN + 2];
int notes[MAXN + 2];
int reqs[MAXN + 2];

int calc_sum_by_subset(int s)
{
    int ans = 0;
    for (int i = 0; i < m; i++)
        if (CHECK_BIT(s, i))
            ans += notes[i];

    return ans;
}

void remove(int i, int j)
{
    for (int x = i; x < n; x++)
        reqs[x] = reqs[x + 1];
    n--;

    for (int y = j; y < m - 1; y++)
        notes[y] = notes[y + 1];
    m--;
}

int main(void)
{
    scanf("%d %d", &n, &m);

    for (int i = 1; i <= n; i++)
        scanf("%d", &reqs[i]);
    for (int j = 0; j < m; j++)
        scanf("%d", &notes[j]);

    // Purge: If element == requirement it is optimal to remove it
    for (int i = 1; i <= n; i++)
        for (int j = 0; j < m; j++) {
            if (i > n || j >= m)
                continue;

            if (reqs[i] == notes[j])
                remove(i, j);
        }

    int start = 0; // No notes used
    dp[0].insert(start);

    // For each customer, calculate all the acceptable sets of notes that would equate to their salary
    for (int i = 1; i <= n; i++) {
        for (int s = 0; s < (1<<m); s++) {
            if (calc_sum_by_subset(s) == reqs[i])
                accept_by[i].push_back(s);
        }
    }

    // See if there are any distinct subsets
    for (int i = 1; i <= n; i++) {
        for (auto to_add : accept_by[i])
            for (auto have_used : dp[i-1]) {
                
                // Check if any note is already used
                if ((to_add ^ have_used) != to_add + have_used)
                    continue;

                // Add the current combination of notes
                dp[i].insert(to_add ^ have_used);
            }
    }

    bool ans = !dp[n].empty();
    if (ans)
        printf("YES\n");
    else 
        printf("NO\n");

    return 0;
}

Compilation message

bank.cpp: In function 'int main()':
bank.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         scanf("%d", &reqs[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~
bank.cpp:43:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         scanf("%d", &notes[j]);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 59 ms 280 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 576 KB Output is correct
9 Correct 56 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 59 ms 280 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 57 ms 576 KB Output is correct
9 Correct 56 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 7 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 4 ms 212 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 2 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 12 ms 292 KB Output is correct
31 Correct 118 ms 300 KB Output is correct
32 Correct 562 ms 1112 KB Output is correct
33 Correct 408 ms 332 KB Output is correct
34 Correct 248 ms 280 KB Output is correct
35 Correct 128 ms 292 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 111 ms 276 KB Output is correct
38 Correct 232 ms 280 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 558 ms 284 KB Output is correct
41 Correct 519 ms 280 KB Output is correct
42 Correct 306 ms 556 KB Output is correct
43 Correct 439 ms 300 KB Output is correct
44 Correct 8 ms 212 KB Output is correct
45 Correct 169 ms 416 KB Output is correct
46 Correct 357 ms 288 KB Output is correct
47 Correct 2 ms 212 KB Output is correct
48 Correct 61 ms 420 KB Output is correct
49 Correct 57 ms 280 KB Output is correct
50 Correct 0 ms 304 KB Output is correct
51 Correct 257 ms 308 KB Output is correct
52 Correct 573 ms 676 KB Output is correct
53 Correct 84 ms 832 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct