Submission #1294683

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int N, K;
vector<int> arr;

vector<vector<int> > ccp;
int dpp(int n, int k) {
    if(n == -1) return k == 0;
    int &ret = ccp[n][k];
    if(ret != -1) return ret;

    return ret = (arr[n] <= k && dpp(n - 1, k - arr[n])) | dpp(n - 1, k);
}
vector<vector<int> > ccs;
int dps(int n, int k) {
    if(n == N) return k == 0;
    int &ret = ccs[n][k];
    if(ret != -1) return ret;

    return ret = (arr[n] <= k && dps(n + 1, k - arr[n])) | dps(n + 1, k);
}
struct BIT {
    bool tree[20002];
    void init() {
        memset(tree, false, sizeof(tree));
    }
    void upd(int idx, bool val, int l, int r, int n) {
        if(idx < l || r < idx) return;
        if(l == r) {
            tree[n] = val;
            return;
        }
        int m = (l + r)>>1;
        upd(idx, val, l, m, 2*n);
        upd(idx, val, m + 1, r, 2*n + 1);
        tree[n] = tree[2*n] | tree[2*n + 1];
    }
    bool quer(int a, int b, int l, int r, int n) {
        if(b < l || r < a) return false;
        if(a <= l && r <= b) return tree[n];
        int m = (l + r)>>1;
        int L = quer(a, b, l, m, 2*n);
        int R = quer(a, b, m + 1, r, 2*n + 1);
        return L | R;
    }
};
BIT B[5002];

int main() {
    scanf("%d %d", &N, &K);
    arr.resize(N);
    for(int i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
    }
    ccp = ccs = vector<vector<int> >(N, vector<int>(K, -1));
    for(int i = 0; i < N; i++) {
        B[i].init();
        for(int j = 0; j < K; j++) B[i].upd(j, dps(i, j), 0, K - 1, 1);
    }
    int cnt = N;
    for(int i = 0; i < N; i++) {
        int lb = max(0, K - arr[i]);
        for(int j = 0; j < K; j++) {
            if(j == 0 || (i != 0 && dpp(i - 1, j))) if(max(0, lb - j) == 0 || (i != N - 1 && B[i + 1].quer(lb - j, K - 1 - j, 0, K - 1, 1))) {
                cnt--;
                break;
            }
        }
    }
    printf("%d", cnt);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &K);
                           ^
./Main.cpp:54:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
                             ^

Judge Result