oj.uz

Submission #593454

# Submission time Handle Problem Language Result Execution time Memory
593454 2022-07-11T08:10:17 Z tht2005 Bank (IZhO14_bank) C++17
100 / 100
 85 ms 5544 KB 
#include <bits/stdc++.h>

using namespace std;

#define N 20
int a[N + 1], b[N], s[1 << N];
bool f[1 << N];

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    a[0] = 0;
    for(int i = 1; i <= n; ++i) {
        scanf("%d", a + i);
        a[i] += a[i - 1];
    }
    s[0] = 0;
    for(int i = 0; i < m; ++i) {
        scanf("%d", b + i);
        s[1 << i] = b[i];
    }
    f[0] = 1;
    for(int t = 0, w; t < 1 << m; ++t) {
        w = t & (t - 1);
        if(w) {
            s[t] = s[w] + s[t ^ w];
        }
        if(!f[t]) {
            continue;
        }
        int x = upper_bound(a, a + 1 + n, s[t]) - a - 1, cur = s[t];
        for(int i = 0; i < m; ++i) {
            if((t >> i & 1) || cur + b[i] > a[x + 1]) {
                continue;
            }
            if(x + 1 == n && cur + b[i] == a[x + 1]) {
                puts("YES");
                return 0;
            }
            f[t | (1 << i)] = 1;
        }
    }
    puts("NO");
    return 0;
}

Compilation message

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

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 3 ms 4436 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 72 ms 5392 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 308 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 304 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 3 ms 4436 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 72 ms 5392 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 308 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 36 ms 3256 KB Output is correct
32 Correct 39 ms 3316 KB Output is correct
33 Correct 6 ms 3284 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4532 KB Output is correct
37 Correct 4 ms 4564 KB Output is correct
38 Correct 4 ms 4308 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 3 ms 4436 KB Output is correct
41 Correct 3 ms 4436 KB Output is correct
42 Correct 52 ms 5544 KB Output is correct
43 Correct 5 ms 5300 KB Output is correct
44 Correct 3 ms 4436 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 9 ms 3284 KB Output is correct
47 Correct 3 ms 4564 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 3 ms 4436 KB Output is correct
50 Correct 41 ms 3340 KB Output is correct
51 Correct 3 ms 3540 KB Output is correct
52 Correct 3 ms 3376 KB Output is correct
53 Correct 54 ms 3360 KB Output is correct
54 Correct 47 ms 3276 KB Output is correct
55 Correct 42 ms 3532 KB Output is correct
56 Correct 42 ms 3344 KB Output is correct
57 Correct 85 ms 5360 KB Output is correct
58 Correct 40 ms 3276 KB Output is correct