oj.uz

Submission #495842

# Submission time Handle Problem Language Result Execution time Memory
495842 2021-12-20T06:08:19 Z Halogen Bank (IZhO14_bank) C++14
100 / 100
 924 ms 12496 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int N, M, A[25], B[25];

vector<int> can[25];

main() {
    scanf("%lld %lld", &N, &M);

    for (int i = 0; i < N; i++) scanf("%lld", &A[i]);
    for (int i = 0; i < M; i++) scanf("%lld", &B[i]);    

    for (int j = 0; j < (1 << M); j++) {
        int cnt = 0;
        for (int i = 0; i < M; i++)
            if (j & (1 << i)) cnt += B[i];
        
        for (int i = 0; i < N; i++)
            if (cnt == A[i]) can[i].push_back(j);
    }

    unordered_set<int> cur, nxt; cur.insert(0);

    for (int i = 0; i < N; i++) {
        for (int j : cur) {
            for (int mask : can[i])
                if (mask & j) ;
                else nxt.insert(j | mask);
        }
        cur.clear();
        swap(cur, nxt);
    }

    if (cur.size()) printf("YES");
    else printf("NO");
}

Compilation message

bank.cpp:11:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   11 | main() {
      | ^~~~
bank.cpp: In function 'int main()':
bank.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%lld %lld", &N, &M);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
bank.cpp:14:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     for (int i = 0; i < N; i++) scanf("%lld", &A[i]);
      |                                 ~~~~~^~~~~~~~~~~~~~~
bank.cpp:15:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     for (int i = 0; i < M; i++) scanf("%lld", &B[i]);
      |                                 ~~~~~^~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 58 ms 272 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 64 ms 556 KB Output is correct
9 Correct 66 ms 280 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 204 KB Output is correct
5 Correct 58 ms 272 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 248 KB Output is correct
8 Correct 64 ms 556 KB Output is correct
9 Correct 66 ms 280 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 2 ms 204 KB Output is correct
31 Correct 63 ms 292 KB Output is correct
32 Correct 104 ms 1024 KB Output is correct
33 Correct 67 ms 332 KB Output is correct
34 Correct 70 ms 272 KB Output is correct
35 Correct 79 ms 264 KB Output is correct
36 Correct 73 ms 204 KB Output is correct
37 Correct 58 ms 204 KB Output is correct
38 Correct 59 ms 268 KB Output is correct
39 Correct 163 ms 8592 KB Output is correct
40 Correct 80 ms 268 KB Output is correct
41 Correct 80 ms 268 KB Output is correct
42 Correct 65 ms 452 KB Output is correct
43 Correct 64 ms 276 KB Output is correct
44 Correct 72 ms 204 KB Output is correct
45 Correct 65 ms 452 KB Output is correct
46 Correct 65 ms 412 KB Output is correct
47 Correct 70 ms 272 KB Output is correct
48 Correct 59 ms 460 KB Output is correct
49 Correct 59 ms 264 KB Output is correct
50 Correct 583 ms 11640 KB Output is correct
51 Correct 73 ms 332 KB Output is correct
52 Correct 80 ms 432 KB Output is correct
53 Correct 924 ms 7444 KB Output is correct
54 Correct 725 ms 11196 KB Output is correct
55 Correct 500 ms 11608 KB Output is correct
56 Correct 575 ms 12296 KB Output is correct
57 Correct 635 ms 12396 KB Output is correct
58 Correct 601 ms 12496 KB Output is correct