Submission #1594222


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

#define REP(i, x) for (int i = 0; i < (x); i++)
#define RREP(i, x) for (int i = (x) - 1; i >= 0; i--)

using ll = long long;

int main() {
    int N, K;
    cin >> N >> K;

    const int MAXN = 5010;

    static ll a[MAXN];

    REP (i, N) {
        cin >> a[i];
    }
    sort(a, a + N);

    int M = 0;
    REP (i, N) {
        if (a[i] < K) M++;
    }
    int nes = N - M;    // 必要なもの

    static int dp[5010][10010];
    const int INF = (1 << 28);

    REP (i, 5010) REP (j, 10010) dp[i][j] = INF;
    dp[0][0] = 1;
    REP (i, M) {
        REP (j, 2 * K) {
            dp[i + 1][j] = dp[i][j];
            if (j - a[i] >= 0) {
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - a[i]]);
            }
        }
    }
    
    /*
    cerr << "first" << endl;
    REP (i, M + 1) {
        REP (j, 2 * K) {
            cerr << "(" << i << ", " << j << ") " << dp[i][j] << endl;
        }
    }
    */

    REP (i, 2 * K) {
        dp[M][i] = (i >= K and dp[M][i] < INF ? i : INF);
    }

    RREP (i, M) {
        int x = INF;
        REP (j, K) {
            if (dp[i][j] >= INF) continue;
            x = min(x, dp[i + 1][j + a[i]]);
        }
        if (x - a[i] < K) nes++;

        REP (j, 2 * K) {
            dp[i][j] = dp[i + 1][j];
            if (j + a[i] < 2 * K) {
                dp[i][j] = min(dp[i][j], dp[i + 1][j + a[i]]);
            }
        }
    }

    /*
    cerr << "second" << endl;
    REP (i, M + 1) {
        REP (j, 2 * K) {
            cerr << "(" << i << ", " << j << ") " << dp[i][j] << endl;
        }
    }
    */

    cout << N - nes << endl;

    return 0;
}

Submission Info

Submission Time
Task D - No Need
User myusa
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1760 Byte
Status AC
Exec Time 211 ms
Memory 196224 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 300 / 300
Status
AC × 3
AC × 26
AC × 51
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt
Case Name Status Exec Time Memory
0_000.txt AC 58 ms 196096 KB
0_001.txt AC 57 ms 196096 KB
0_002.txt AC 57 ms 196096 KB
1_003.txt AC 57 ms 196096 KB
1_004.txt AC 57 ms 196096 KB
1_005.txt AC 57 ms 196096 KB
1_006.txt AC 57 ms 196096 KB
1_007.txt AC 57 ms 196096 KB
1_008.txt AC 58 ms 196096 KB
1_009.txt AC 59 ms 196096 KB
1_010.txt AC 58 ms 196096 KB
1_011.txt AC 57 ms 196096 KB
1_012.txt AC 57 ms 196096 KB
1_013.txt AC 58 ms 196096 KB
1_014.txt AC 57 ms 196096 KB
1_015.txt AC 58 ms 196096 KB
1_016.txt AC 57 ms 196096 KB
1_017.txt AC 57 ms 196096 KB
1_018.txt AC 57 ms 196096 KB
1_019.txt AC 58 ms 196096 KB
1_020.txt AC 57 ms 196096 KB
1_021.txt AC 58 ms 196096 KB
1_022.txt AC 58 ms 196096 KB
1_023.txt AC 57 ms 196096 KB
1_024.txt AC 57 ms 196096 KB
1_025.txt AC 58 ms 196096 KB
2_026.txt AC 57 ms 196096 KB
2_027.txt AC 57 ms 196096 KB
2_028.txt AC 57 ms 196096 KB
2_029.txt AC 211 ms 196224 KB
2_030.txt AC 210 ms 196224 KB
2_031.txt AC 60 ms 196224 KB
2_032.txt AC 59 ms 196224 KB
2_033.txt AC 58 ms 196224 KB
2_034.txt AC 58 ms 196224 KB
2_035.txt AC 58 ms 196224 KB
2_036.txt AC 201 ms 196224 KB
2_037.txt AC 57 ms 196096 KB
2_038.txt AC 58 ms 196096 KB
2_039.txt AC 58 ms 196096 KB
2_040.txt AC 59 ms 196224 KB
2_041.txt AC 133 ms 196224 KB
2_042.txt AC 173 ms 196224 KB
2_043.txt AC 105 ms 196224 KB
2_044.txt AC 111 ms 196224 KB
2_045.txt AC 85 ms 196224 KB
2_046.txt AC 96 ms 196224 KB
2_047.txt AC 116 ms 196224 KB
2_048.txt AC 132 ms 196224 KB
2_049.txt AC 116 ms 196224 KB
2_050.txt AC 107 ms 196224 KB