Submission #1167849

---

Source Code Expand

#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <bitset>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <iostream>
#include <algorithm>
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define PER(i,a,b) for(int i=(a);i>=(b);i--)
#define RVC(i,S) for(int i=0;i<(S).size();i++)
#define RAL(i,u) for(int i=fr[u];i!=-1;i=e[i].next)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

template<class T> inline
void read(T& num) {
    bool start=false,neg=false;
    char c;
    num=0;
    while((c=getchar())!=EOF) {
        if(c=='-') start=neg=true;
        else if(c>='0' && c<='9') {
            start=true;
            num=num*10+c-'0';
        } else if(start) break;
    }
    if(neg) num=-num;
}
/*============ Header Template ============*/

int f[5005][5005];
int g[5005];
int ai[5005];

int main() {
    int n,m;
    cin >> n >> m;
    REP(i,1,n) cin >> ai[i],ai[i]=min(ai[i],m);
    f[1][0]=1;
    REP(i,2,n)
    {
        memcpy(f[i],f[i-1],sizeof(f[i-1]));
        REP(j,ai[i-1],m) f[i][j]|=f[i-1][j-ai[i-1]];
    }
    g[0]=1;int cnt=0;
    PER(i,n,1)
    {
        if(i<n)
        {
            PER(j,m,ai[i+1]) g[j]|=g[j-ai[i+1]];
        }
        int ps=m-1, fl=0;
        REP(j,0,m-1) if(f[i][j])
        {
            while(ps && (!g[ps] || j+ps>=m)) ps--;
            if(ps>=0 && g[ps] && j+ps<m && j+ps>=m-ai[i]) fl=1;
        } cnt+=fl;
    }
    printf("%d\n",n-cnt);
}

Submission Info

Judge Result