oj.uz

Submission #676900

# Submission time Handle Problem Language Result Execution time Memory
676900 2023-01-01T14:04:35 Z omikron123 Bank (IZhO14_bank) C++14
100 / 100
 789 ms 4420 KB 
// https://oj.uz/problem/view/IZhO14_bank

#include <cstdio>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstring>
using namespace std;
typedef long long ll;

// 按顺序给a[1]...a[n]发钱
// dp[bm]: bm是哪些note用了，是否状态是合法的

int n, m;
int a[25], B[25];
int dp[1<<20];
ll psum[25];

int main() {
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        psum[i+1] = psum[i] + a[i];
    }
    for (int i = 0; i < m; i++)
        scanf("%d", &B[i]);

    dp[0] = 1;
    for (int bm = 1; bm < (1<<m); bm++) {
        for (int i = 0; i < m; i++) {
            int b = 1 << i;
            if ((bm & b) && dp[bm ^ b]) {
                ll sum = 0;
                for (int j = 0; j < m; j++)
                    if ((bm ^ b) & (1 << j)) sum += B[j];
                auto it = upper_bound(psum, psum+n+1, sum);
                if (sum + B[i] <= *it) {
                    dp[bm] = 1;
                    if (sum + B[i] == psum[n]) {
                        printf("YES");
                        return 0;
                    }
                    continue;
                }
            }
        }
    }
    printf("NO");
    return 0;
}

Compilation message

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 64 ms 292 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 683 ms 4416 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 284 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 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 3 ms 344 KB Output is correct
3 Correct 2 ms 292 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 1 ms 288 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 7 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
5 Correct 64 ms 292 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 292 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 683 ms 4416 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 292 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 284 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 292 KB Output is correct
23 Correct 1 ms 288 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 212 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 1 ms 288 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 7 ms 340 KB Output is correct
31 Correct 595 ms 4420 KB Output is correct
32 Correct 667 ms 4420 KB Output is correct
33 Correct 110 ms 4240 KB Output is correct
34 Correct 63 ms 1340 KB Output is correct
35 Correct 66 ms 1456 KB Output is correct
36 Correct 60 ms 508 KB Output is correct
37 Correct 66 ms 608 KB Output is correct
38 Correct 60 ms 284 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 60 ms 316 KB Output is correct
41 Correct 60 ms 440 KB Output is correct
42 Correct 403 ms 4340 KB Output is correct
43 Correct 75 ms 2536 KB Output is correct
44 Correct 60 ms 304 KB Output is correct
45 Correct 2 ms 296 KB Output is correct
46 Correct 203 ms 4304 KB Output is correct
47 Correct 63 ms 588 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 60 ms 360 KB Output is correct
50 Correct 789 ms 4336 KB Output is correct
51 Correct 73 ms 548 KB Output is correct
52 Correct 86 ms 4368 KB Output is correct
53 Correct 759 ms 4252 KB Output is correct
54 Correct 754 ms 4376 KB Output is correct
55 Correct 760 ms 4284 KB Output is correct
56 Correct 765 ms 4256 KB Output is correct
57 Correct 754 ms 4348 KB Output is correct
58 Correct 747 ms 4408 KB Output is correct