Submission #3572000

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
#include <bitset>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int N, K;
int nums[5009];
bitset<8192> L[5009], R[5009];
ll LT[5009], RT[5009];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>N>>K;
    rep(i,N) cin>>nums[i];
    
    L[0][0]=1;
    R[N+1][0]=1;
    rep(i,N){
        bitset<8192> T=L[i];
        T<<=nums[i];
        if(L[i].count()!=T.count()) L[i+1][8191]=1;
        LT[i+1]=LT[i]+nums[i];
    }
    rrep(i,N-1){
        bitset<8192> T=R[i+2];
        T<<=nums[i];
        R[i+1]=R[i+2]|T;
        if(R[i+2].count()!=T.count()) R[i+1][8191]=1;
        RT[i+1]=RT[i+2]+nums[i];
    }
    
    int ret=0;
    rep(i,N){
        ll LB=max(0,K-nums[i]);
        ll RB=K-1;
        deque<int> AA,BB;
        rep(x,8192) if(R[i+2][x]) AA.push_back(x);
        int hoge=1;
        rep(x,8192) if(L[i][x]){
            ll LB2=LB-x, RB2=RB-x;
            while(AA.size()&&AA.back()>=LB2) BB.push_front(AA.back()), AA.pop_back();
            while(BB.size()&&BB.back()>RB2) BB.pop_back();
            if(BB.size()){
                hoge=0;
                break;
            }
        }
        ret+=hoge;
    }
    cout1(ret);
}

Submission Info

Judge Result