oj.uz

답안 #723490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723490 2023-04-13T23:32:59 Z PanosPask 은행 (IZhO14_bank) C++14
100 / 100
 85 ms 8508 KB 
#include <bits/stdc++.h>
#define MAXN 20
#define CHECK_BIT(var, pos) (var & (1<<pos))

using namespace std;

int n, m;

// dp[i]: The maximum prefix of people we can pay with the subset i
int dp[(1<<MAXN)];
// leftovers[i]: How much money is leftovers after paying the dp[i] people
int leftovers[(1<<MAXN)];

int reqs[MAXN + 2];
int notes[MAXN + 2];

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

    memset(dp, -1, sizeof(dp));
    memset(leftovers, -1, sizeof(leftovers));
    dp[0] = 0;
    leftovers[0] = 0;

    for (int s = 0; s < (1<<m); s++) {
        if (dp[s] == -1) 
            continue;
        if (dp[s] == n) {
            printf("YES\n");
            return 0;
        }

        int to_cover = reqs[dp[s]];
        for (int i = 0; i < m; i++) {
            if (CHECK_BIT(s, i))
                continue;
            
            // Use i as the last banknote
            int val = notes[i];
            if (val + leftovers[s] < to_cover) {
                dp[s + (1<<i)] = dp[s];
                leftovers[s + (1<<i)] = leftovers[s] + val;
            }
            else if (val + leftovers[s] == to_cover) {
                dp[s + (1<<i)] = dp[s] + 1;
                leftovers[s + (1<<i)] = 0;
            }
        }
    }

    printf("NO\n");
    return 0;
}

Compilation message

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

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8488 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 66 ms 8484 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 3 ms 8404 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 5 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 5 ms 8404 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8404 KB Output is correct
4 Correct 4 ms 8488 KB Output is correct
5 Correct 4 ms 8404 KB Output is correct
6 Correct 3 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 3 ms 8404 KB Output is correct
9 Correct 4 ms 8404 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct
11 Correct 5 ms 8404 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8404 KB Output is correct
2 Correct 4 ms 8404 KB Output is correct
3 Correct 4 ms 8488 KB Output is correct
4 Correct 4 ms 8404 KB Output is correct
5 Correct 5 ms 8404 KB Output is correct
6 Correct 4 ms 8404 KB Output is correct
7 Correct 4 ms 8404 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 66 ms 8484 KB Output is correct
10 Correct 4 ms 8404 KB Output is correct
11 Correct 4 ms 8404 KB Output is correct
12 Correct 3 ms 8404 KB Output is correct
13 Correct 4 ms 8404 KB Output is correct
14 Correct 4 ms 8404 KB Output is correct
15 Correct 5 ms 8404 KB Output is correct
16 Correct 4 ms 8404 KB Output is correct
17 Correct 4 ms 8404 KB Output is correct
18 Correct 5 ms 8404 KB Output is correct
19 Correct 4 ms 8404 KB Output is correct
20 Correct 4 ms 8404 KB Output is correct
21 Correct 4 ms 8404 KB Output is correct
22 Correct 4 ms 8404 KB Output is correct
23 Correct 4 ms 8488 KB Output is correct
24 Correct 4 ms 8404 KB Output is correct
25 Correct 3 ms 8404 KB Output is correct
26 Correct 4 ms 8404 KB Output is correct
27 Correct 3 ms 8404 KB Output is correct
28 Correct 4 ms 8404 KB Output is correct
29 Correct 4 ms 8404 KB Output is correct
30 Correct 5 ms 8404 KB Output is correct
31 Correct 59 ms 8404 KB Output is correct
32 Correct 67 ms 8404 KB Output is correct
33 Correct 10 ms 8404 KB Output is correct
34 Correct 5 ms 8404 KB Output is correct
35 Correct 5 ms 8504 KB Output is correct
36 Correct 5 ms 8404 KB Output is correct
37 Correct 4 ms 8404 KB Output is correct
38 Correct 5 ms 8508 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 4 ms 8404 KB Output is correct
41 Correct 5 ms 8496 KB Output is correct
42 Correct 43 ms 8484 KB Output is correct
43 Correct 6 ms 8500 KB Output is correct
44 Correct 5 ms 8492 KB Output is correct
45 Correct 4 ms 8404 KB Output is correct
46 Correct 21 ms 8404 KB Output is correct
47 Correct 5 ms 8500 KB Output is correct
48 Correct 5 ms 8404 KB Output is correct
49 Correct 5 ms 8500 KB Output is correct
50 Correct 80 ms 8504 KB Output is correct
51 Correct 6 ms 8404 KB Output is correct
52 Correct 9 ms 8496 KB Output is correct
53 Correct 84 ms 8488 KB Output is correct
54 Correct 79 ms 8496 KB Output is correct
55 Correct 74 ms 8404 KB Output is correct
56 Correct 85 ms 8404 KB Output is correct
57 Correct 77 ms 8404 KB Output is correct
58 Correct 75 ms 8492 KB Output is correct