Submission #362760

# Submission time Handle Problem Language Result Execution time Memory
362760 2021-02-04T10:41:26 Z ritul_kr_singh Bank (IZhO14_bank) C++17
100 / 100
191 ms 4608 KB
#include <bits/stdc++.h>
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m; cin >> n >> m;
    int a[n+1], b[m];
    a[0] = 0;
    for(int i=1; i<=n; ++i){
        cin >> a[i]; a[i] += a[i-1];
    }
    for(int& i : b) cin >> i;

    int lim = (1<<m);
    int dp[lim]; // dp[i] -> max index(a) to which it's possible to distribute notes in mask
    for(int& i : dp) i = 0;

    int ok = 0;
    for(int i=0; i<lim; ++i){
        int sum = 0;
        for(int j=0; j<m; ++j){
            if(i&(1<<j)) sum += b[j];
        }
        for(int j=0; j<m; ++j){
            if(i&(1<<j)){
                if(a[dp[i-(1<<j)]+1]==sum){
                    dp[i] = max(dp[i], dp[i-(1<<j)]+1);
                }
                dp[i] = max(dp[i], dp[i-(1<<j)]);
            }
        }
        ok |= dp[i]==n;
    }
    cout << (ok ? "YES\n" : "NO\n");
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 141 ms 4588 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 144 ms 4588 KB Output is correct
9 Correct 145 ms 4492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 492 KB Output is correct
5 Correct 141 ms 4588 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 144 ms 4588 KB Output is correct
9 Correct 145 ms 4492 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 3 ms 364 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 142 ms 4460 KB Output is correct
32 Correct 151 ms 4460 KB Output is correct
33 Correct 142 ms 4460 KB Output is correct
34 Correct 146 ms 4492 KB Output is correct
35 Correct 141 ms 4460 KB Output is correct
36 Correct 149 ms 4460 KB Output is correct
37 Correct 143 ms 4460 KB Output is correct
38 Correct 143 ms 4460 KB Output is correct
39 Correct 161 ms 4460 KB Output is correct
40 Correct 148 ms 4460 KB Output is correct
41 Correct 144 ms 4588 KB Output is correct
42 Correct 144 ms 4460 KB Output is correct
43 Correct 143 ms 4592 KB Output is correct
44 Correct 141 ms 4588 KB Output is correct
45 Correct 143 ms 4460 KB Output is correct
46 Correct 141 ms 4460 KB Output is correct
47 Correct 141 ms 4460 KB Output is correct
48 Correct 145 ms 4460 KB Output is correct
49 Correct 142 ms 4588 KB Output is correct
50 Correct 159 ms 4460 KB Output is correct
51 Correct 144 ms 4492 KB Output is correct
52 Correct 145 ms 4608 KB Output is correct
53 Correct 160 ms 4460 KB Output is correct
54 Correct 169 ms 4460 KB Output is correct
55 Correct 159 ms 4588 KB Output is correct
56 Correct 165 ms 4460 KB Output is correct
57 Correct 191 ms 4460 KB Output is correct
58 Correct 161 ms 4460 KB Output is correct