oj.uz

Submission #360656

# Submission time Handle Problem Language Result Execution time Memory
360656 2021-01-28T05:34:42 Z Seanliu Bank (IZhO14_bank) C++14
100 / 100
 127 ms 63084 KB 
#include <iostream>
#include <algorithm>
using namespace std;

const int maxN = 22;
int N, M, a[maxN], b[maxN], dp[maxN][1 << maxN], has[maxN], head, cnt, sum[1 << maxN], log[1 << maxN], pre[maxN];

int main(){
    for(int i = 0; i < maxN; i++) log[1 << i] = i;
    cin >> N >> M;
    for(int i = 1; i <= N; i++) cin >> a[i];
    for(int i = 0; i < M; i++) cin >> b[i];

    for(int i = 1; i <= N; i++) pre[i] = pre[i - 1] + a[i];
    for(int i = 1; i < (1 << M); i++){
        sum[i] = sum[i - (i & -i)] + b[log[i & -i]];
    }
    dp[1][0] = true;
    int ans = 0;
    for(int i = 1; i <= N; i++){
        for(int m = 1; m < (1 << M); m++){
            int cur = m;
            if(pre[i] < sum[m]) continue;
            if(pre[i - 1] > sum[m]) continue;
            while(cur){
                int id = log[cur & -cur];
                cur -= cur & -cur;
                if(dp[i][m - (1 << id)]) dp[i][m] = 1;
            }
            if(dp[i][m]){

                if(sum[m] == pre[i]) dp[i + 1][m] = 1;
                if(sum[m] == pre[N] && i == N && dp[i + 1][m]) ans = 1;
            }
        }
    }
    cout << (ans ? "YES" : "NO") <<endl;
}

Compilation message

bank.cpp:6:88: warning: built-in function 'log' declared as non-function [-Wbuiltin-declaration-mismatch]
    6 | int N, M, a[maxN], b[maxN], dp[maxN][1 << maxN], has[maxN], head, cnt, sum[1 << maxN], log[1 << maxN], pre[maxN];
      |                                                                                        ^~~

Subtask #1
19.0 / 19.0

# 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 1 ms 748 KB Output is correct
5 Correct 5 ms 4460 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 20 ms 12652 KB Output is correct
9 Correct 39 ms 8556 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# 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 1 ms 748 KB Output is correct
5 Correct 5 ms 4460 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 20 ms 12652 KB Output is correct
9 Correct 39 ms 8556 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 620 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 1 ms 748 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 620 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 620 KB Output is correct
27 Correct 1 ms 620 KB Output is correct
28 Correct 1 ms 620 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 51 ms 11628 KB Output is correct
32 Correct 58 ms 16236 KB Output is correct
33 Correct 58 ms 16620 KB Output is correct
34 Correct 58 ms 6508 KB Output is correct
35 Correct 56 ms 7276 KB Output is correct
36 Correct 68 ms 5100 KB Output is correct
37 Correct 6 ms 4972 KB Output is correct
38 Correct 7 ms 4588 KB Output is correct
39 Correct 29 ms 25068 KB Output is correct
40 Correct 36 ms 4716 KB Output is correct
41 Correct 69 ms 4972 KB Output is correct
42 Correct 71 ms 19564 KB Output is correct
43 Correct 55 ms 10860 KB Output is correct
44 Correct 61 ms 4716 KB Output is correct
45 Correct 49 ms 18028 KB Output is correct
46 Correct 62 ms 18412 KB Output is correct
47 Correct 59 ms 5120 KB Output is correct
48 Correct 12 ms 11884 KB Output is correct
49 Correct 5 ms 4588 KB Output is correct
50 Correct 127 ms 63080 KB Output is correct
51 Correct 49 ms 5356 KB Output is correct
52 Correct 65 ms 20460 KB Output is correct
53 Correct 78 ms 37024 KB Output is correct
54 Correct 118 ms 60652 KB Output is correct
55 Correct 125 ms 63084 KB Output is correct
56 Correct 127 ms 62828 KB Output is correct
57 Correct 123 ms 58988 KB Output is correct
58 Correct 120 ms 58988 KB Output is correct