oj.uz

Submission #76329

# Submission time Handle Problem Language Result Execution time Memory
76329 2018-09-12T15:31:27 Z win11905 Bank (IZhO14_bank) C++11
100 / 100
 231 ms 14700 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 20;

int n, m;
int A[N], B[N];
vector<int> g[N];
bool chk[N][1<<N];

void dfs(int u, int st) {
    if(u == n) { puts("YES"); exit(0); }
    if(chk[u][st]) return;
    chk[u][st] = true;
    for(int v : g[u]) if(!(st & v)) dfs(u+1, st | v);
}

int 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 i = 0; i < (1<<m); ++i) {
        int sum = 0;
        for(int j = 0; j < m; ++j) if(i >> j & 1) sum += B[j];
        for(int j = 0; j < n; ++j) if(sum == A[j]) g[j].emplace_back(i);
    } 
    dfs(0, 0);
    puts("NO");
}

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]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
bank.cpp:20:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n; ++i) scanf("%d", A+i);
                                ~~~~~^~~~~~~~~~~
bank.cpp:21:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < m; ++i) 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 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 4 ms 440 KB Output is correct
5 Correct 70 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 70 ms 552 KB Output is correct
9 Correct 71 ms 552 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 720 KB Output is correct
2 Correct 3 ms 720 KB Output is correct
3 Correct 3 ms 720 KB Output is correct
4 Correct 3 ms 720 KB Output is correct
5 Correct 3 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 3 ms 720 KB Output is correct
8 Correct 3 ms 720 KB Output is correct
9 Correct 3 ms 720 KB Output is correct
10 Correct 3 ms 720 KB Output is correct
11 Correct 3 ms 720 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 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 4 ms 440 KB Output is correct
5 Correct 70 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 70 ms 552 KB Output is correct
9 Correct 71 ms 552 KB Output is correct
10 Correct 2 ms 552 KB Output is correct
11 Correct 2 ms 552 KB Output is correct
12 Correct 2 ms 564 KB Output is correct
13 Correct 2 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 720 KB Output is correct
16 Correct 2 ms 720 KB Output is correct
17 Correct 2 ms 720 KB Output is correct
18 Correct 2 ms 720 KB Output is correct
19 Correct 2 ms 720 KB Output is correct
20 Correct 3 ms 720 KB Output is correct
21 Correct 3 ms 720 KB Output is correct
22 Correct 3 ms 720 KB Output is correct
23 Correct 3 ms 720 KB Output is correct
24 Correct 3 ms 720 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 3 ms 720 KB Output is correct
27 Correct 3 ms 720 KB Output is correct
28 Correct 3 ms 720 KB Output is correct
29 Correct 3 ms 720 KB Output is correct
30 Correct 3 ms 720 KB Output is correct
31 Correct 72 ms 720 KB Output is correct
32 Correct 73 ms 796 KB Output is correct
33 Correct 78 ms 796 KB Output is correct
34 Correct 80 ms 796 KB Output is correct
35 Correct 81 ms 796 KB Output is correct
36 Correct 87 ms 796 KB Output is correct
37 Correct 72 ms 796 KB Output is correct
38 Correct 74 ms 796 KB Output is correct
39 Correct 78 ms 796 KB Output is correct
40 Correct 81 ms 796 KB Output is correct
41 Correct 89 ms 796 KB Output is correct
42 Correct 81 ms 3964 KB Output is correct
43 Correct 79 ms 3964 KB Output is correct
44 Correct 84 ms 3964 KB Output is correct
45 Correct 74 ms 3964 KB Output is correct
46 Correct 76 ms 3964 KB Output is correct
47 Correct 84 ms 3964 KB Output is correct
48 Correct 69 ms 3964 KB Output is correct
49 Correct 70 ms 3964 KB Output is correct
50 Correct 87 ms 3964 KB Output is correct
51 Correct 79 ms 3964 KB Output is correct
52 Correct 79 ms 3964 KB Output is correct
53 Correct 80 ms 3964 KB Output is correct
54 Correct 87 ms 3964 KB Output is correct
55 Correct 86 ms 3964 KB Output is correct
56 Correct 87 ms 3964 KB Output is correct
57 Correct 231 ms 14700 KB Output is correct
58 Correct 88 ms 14700 KB Output is correct