Submission #1167856

---

Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = l; i < r; i++)
#define repb(i, r, l) for (int i = r; i > l; i--)
#define sz(a) (int)a.size()
#define fi first
#define se second

using namespace std;

const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 31;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-6;
const double pi = atan2(0, -1);

int main()
{
    //freopen("a.in", "r", stdin);
    //freopen("arrayop.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    //int TL = 0.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n, k;
    cin >> n >> k;
    int a[n * 2];
    rep(i, 0, n)
    {
        cin >> a[i];
        a[n + i] = a[i];
    }
    int dp[n * 2][k + 1];
    rep(i, 0, n * 2)
        rep(j, 0, k + 1)
            dp[i][j] = -inf;
    rep(i, 0, n * 2)
        dp[i][0] = i;
    rep(i, 0, n * 2)
    {
        if (a[i] <= k)
            dp[i][a[i]] = max(dp[i][a[i]], i);
        if (i == 0)
            continue;
        rep(j, 0, k + 1)
        {
            dp[i][j] = max(dp[i][j], dp[i - 1][j]);
            if (a[i] <= j)
                dp[i][j] = max(dp[i][j], dp[i - 1][j - a[i]]);
        }
    }
    int cnt = 0;
    rep(i, 0, n)
    {
        bool ok = true;
        if (a[i] >= k)
            ok = false;
        rep(j, 0, k)
            if (dp[n + i - 1][j] > i && j + a[i] >= k)
            {
                ok = false;
                break;
            }
        if (ok)
            cnt++;
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result