oj.uz

Submission #37843

# Submission time Handle Problem Language Result Execution time Memory
37843 2017-12-28T09:52:52 Z Just_Solve_The_Problem Bank (IZhO14_bank) C++11
100 / 100
 194 ms 1784 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

const int N = (int)22;
const int NN = (1 << 20);

int a[N], b[N];
bool used[NN];
int n, m;
vector < int > vec[N];

void go (int pos, int mask) {
    if (used[mask]) return ;
    used[mask] = 1;
    if (pos == n) {
        puts("YES");
        exit(0);
    }
    for (int to : vec[pos]) {
        if (mask & to) continue;
        go(pos + 1, mask | to);
    }
}

main () {
    scanf ("%d %d", &n, &m);
    for (int i = 0; i < n; i++) {
        scanf ("%d", a + i);
    }
    for (int i = 0; i < m; i++) {
        scanf ("%d", b + i);
    }
    for (int mask = 0; mask < (1 << m); mask++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if (mask & (1 << j)) {
                sum += b[j];
            }
        }
        for (int j = 0; j < n; j++) {
            if (sum == a[j]) {
                vec[j].pb(mask);
            }
        }
    }
    go(0, 0);
    puts("NO");
}

Compilation message

bank.cpp:28:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
bank.cpp: In function 'int main()':
bank.cpp:29:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &n, &m);
     ~~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:31:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d", a + i);
         ~~~~~~^~~~~~~~~~~~~
bank.cpp:34:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d", b + i);
         ~~~~~~^~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 4 ms 472 KB Output is correct
5 Correct 70 ms 476 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 70 ms 660 KB Output is correct
9 Correct 71 ms 660 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 4 ms 472 KB Output is correct
5 Correct 70 ms 476 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 70 ms 660 KB Output is correct
9 Correct 71 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 2 ms 660 KB Output is correct
12 Correct 2 ms 660 KB Output is correct
13 Correct 2 ms 660 KB Output is correct
14 Correct 2 ms 660 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 660 KB Output is correct
17 Correct 2 ms 660 KB Output is correct
18 Correct 2 ms 660 KB Output is correct
19 Correct 2 ms 660 KB Output is correct
20 Correct 3 ms 660 KB Output is correct
21 Correct 3 ms 660 KB Output is correct
22 Correct 3 ms 660 KB Output is correct
23 Correct 3 ms 660 KB Output is correct
24 Correct 3 ms 660 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 3 ms 724 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 73 ms 724 KB Output is correct
32 Correct 73 ms 736 KB Output is correct
33 Correct 77 ms 736 KB Output is correct
34 Correct 80 ms 736 KB Output is correct
35 Correct 81 ms 736 KB Output is correct
36 Correct 88 ms 736 KB Output is correct
37 Correct 72 ms 736 KB Output is correct
38 Correct 74 ms 736 KB Output is correct
39 Correct 77 ms 740 KB Output is correct
40 Correct 80 ms 740 KB Output is correct
41 Correct 87 ms 748 KB Output is correct
42 Correct 194 ms 1784 KB Output is correct
43 Correct 79 ms 1784 KB Output is correct
44 Correct 84 ms 1784 KB Output is correct
45 Correct 72 ms 1784 KB Output is correct
46 Correct 76 ms 1784 KB Output is correct
47 Correct 83 ms 1784 KB Output is correct
48 Correct 69 ms 1784 KB Output is correct
49 Correct 70 ms 1784 KB Output is correct
50 Correct 86 ms 1784 KB Output is correct
51 Correct 79 ms 1784 KB Output is correct
52 Correct 79 ms 1784 KB Output is correct
53 Correct 79 ms 1784 KB Output is correct
54 Correct 87 ms 1784 KB Output is correct
55 Correct 86 ms 1784 KB Output is correct
56 Correct 87 ms 1784 KB Output is correct
57 Correct 177 ms 1784 KB Output is correct
58 Correct 86 ms 1784 KB Output is correct