Submission #1176428

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const int mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int n,k;
int a[5000];
int ldp[5000][5000],rdp[5000][5000];

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> k;
    rep(i,n) cin >> a[i];
    rep(i,n){
        ldp[i][0]=1;rdp[i][0]=1;
        if (a[i]<k) ldp[i][a[i]]=1;
        if (a[n-1-i]<k) rdp[i][a[n-1-i]]=1;
    }
    rep2(i,1,n)rep(j,k){
            if (j-a[i]>=0 && ldp[i-1][j-a[i]]) ldp[i][j]=1;
            else if (ldp[i-1][j]) ldp[i][j]=1;
            else ldp[i][j]|=ldp[i-1][j];
            if (j-a[n-1-i]>=0 && rdp[i-1][j-a[n-1-i]]) rdp[i][j]=1;
            else if (rdp[i-1][j]) rdp[i][j]=1;
            else rdp[i][j]|=rdp[i-1][j];
    }
    rep(i,n)rep2(j,1,k){
        rdp[i][j]+=rdp[i][j-1];
    }
    int cnt=0;
    int lnum=0;
    rep(i,n){
        if (k-a[i]<=0){
            cnt+=1;
            continue;
        }
        rep(j,k){
            if (i==0) lnum=0;
            else if (i==n-1){
                if (ldp[i-1][j] && a[i]+j>=k){
                    cnt+=1;
                    break;
                }
                continue;
            }
            else{
                if (ldp[i-1][j]) lnum=j;
                else continue;
            }
            if (k-a[i]-lnum<=0){
                cnt+=1;
                break;
            }
            if (rdp[n-2-i][k-1-lnum]-rdp[n-2-i][k-a[i]-lnum-1]){
                cnt+=1;
                break;
            }
        }
    }
    cout << n-cnt << endl;
}

Submission Info

Judge Result