Submission #2121088


Source Code Expand

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

vector<int> a;
vector<deque<bool>> dp(5004, deque<bool>(5004));
int n, k;

bool check(int i){
    for(int j=0;j<n;++j){
        dp[j][0] = true;
        for(int l=1;l<=k;++l){
            dp[j][l] = false;
        }
    }

    for(int j=0;j<n;++j){
        if(j != i)dp[j][a[j]] = true;
        if(j > 0){
            for(int l=1;l<=k;++l){
                dp[j][l] = (dp[j][l] || dp[j-1][l]);
                if(j != i && l >= a[j])
                    dp[j][l] = (dp[j][l] || dp[j-1][l-a[j]]);
            }
        }
    }

    for(int j=max(0,k-a[i]);j<k;++j)
        if(dp[n-1][j])return true;
    return false;
}

int main(){
    cin >> n >> k;
    for(int i=0;i<n;++i){
        int tmp;
        cin >> tmp;
        a.push_back(tmp);
    }
    sort(a.begin(), a.end());

    int unnecessary = -1, necessary = n;
    while(necessary - unnecessary > 1){
        int mid = (necessary + unnecessary) / 2;
        if(check(mid))necessary = mid;
        else unnecessary = mid;
    }

    cout << unnecessary + 1 << endl;

    return 0;
}

Submission Info

Submission Time
Task D - No Need
User nicklaw296
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1136 Byte
Status RE
Exec Time 2105 ms
Memory 29056 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 300
Status
AC × 3
AC × 22
RE × 4
AC × 36
TLE × 6
RE × 9
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 41 ms 27008 KB
0_001.txt AC 41 ms 27008 KB
0_002.txt AC 41 ms 27008 KB
1_003.txt AC 41 ms 27008 KB
1_004.txt AC 41 ms 27008 KB
1_005.txt AC 41 ms 27008 KB
1_006.txt AC 41 ms 27008 KB
1_007.txt AC 41 ms 27008 KB
1_008.txt AC 47 ms 27008 KB
1_009.txt AC 48 ms 27008 KB
1_010.txt RE 135 ms 27008 KB
1_011.txt RE 138 ms 27008 KB
1_012.txt AC 46 ms 27008 KB
1_013.txt AC 42 ms 27008 KB
1_014.txt AC 42 ms 27008 KB
1_015.txt AC 46 ms 27008 KB
1_016.txt AC 41 ms 27008 KB
1_017.txt AC 41 ms 27008 KB
1_018.txt AC 41 ms 27008 KB
1_019.txt AC 45 ms 27008 KB
1_020.txt AC 42 ms 27008 KB
1_021.txt AC 43 ms 27008 KB
1_022.txt RE 136 ms 27008 KB
1_023.txt RE 138 ms 27008 KB
1_024.txt AC 44 ms 27008 KB
1_025.txt AC 46 ms 27008 KB
2_026.txt AC 40 ms 27008 KB
2_027.txt AC 41 ms 27008 KB
2_028.txt AC 43 ms 27136 KB
2_029.txt TLE 2105 ms 27008 KB
2_030.txt TLE 2105 ms 27008 KB
2_031.txt RE 175 ms 27008 KB
2_032.txt RE 137 ms 27008 KB
2_033.txt AC 1857 ms 27008 KB
2_034.txt AC 46 ms 27008 KB
2_035.txt AC 47 ms 27008 KB
2_036.txt TLE 2097 ms 29056 KB
2_037.txt AC 43 ms 27008 KB
2_038.txt AC 42 ms 27008 KB
2_039.txt AC 43 ms 27008 KB
2_040.txt AC 1620 ms 27008 KB
2_041.txt AC 1096 ms 27008 KB
2_042.txt AC 1679 ms 27008 KB
2_043.txt RE 204 ms 27008 KB
2_044.txt RE 210 ms 27008 KB
2_045.txt RE 171 ms 27008 KB
2_046.txt AC 1150 ms 27008 KB
2_047.txt AC 1676 ms 27008 KB
2_048.txt TLE 2105 ms 27008 KB
2_049.txt TLE 2105 ms 27008 KB
2_050.txt TLE 2061 ms 27008 KB