Submission #1320241
Source Code Expand
#include <bits/stdc++.h> using namespace std; int dp[5010][2]; int n, k; int a[5001]; bool isnec(int x) { for (int i = 0; i <= k; i++) dp[i][0] = dp[i][1] = 0; int z = 0; dp[0][0] = 1; for (int i = 0; i < n; i++) { if (i == x) continue; for (int j = 0; j <= k; j++) { dp[j][1-z] = dp[j][z] || (j >= a[i] && dp[j-a[i]][z]); } z = 1-z; } for (int j = max(k - a[x], 0); j < k; j++) { if (dp[j][z]) return true; } return false; } int main() { cin >> n >> k; for (int i = 0; i < n; i++) cin >> a[i]; int cnt = 0; for (int i = 0; i < n; i++) if (!isnec(i)) cnt++; cout << cnt << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - No Need |
User | ordyh |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 753 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 0 / 300 | ||||||||
Status |
|
|
|
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 | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 68 ms | 256 KB |
1_009.txt | AC | 68 ms | 256 KB |
1_010.txt | AC | 67 ms | 256 KB |
1_011.txt | AC | 2 ms | 256 KB |
1_012.txt | AC | 67 ms | 256 KB |
1_013.txt | AC | 2 ms | 256 KB |
1_014.txt | AC | 2 ms | 256 KB |
1_015.txt | AC | 51 ms | 256 KB |
1_016.txt | AC | 1 ms | 256 KB |
1_017.txt | AC | 1 ms | 256 KB |
1_018.txt | AC | 1 ms | 256 KB |
1_019.txt | AC | 48 ms | 256 KB |
1_020.txt | AC | 3 ms | 256 KB |
1_021.txt | AC | 26 ms | 256 KB |
1_022.txt | AC | 6 ms | 256 KB |
1_023.txt | AC | 2 ms | 256 KB |
1_024.txt | AC | 38 ms | 256 KB |
1_025.txt | AC | 49 ms | 256 KB |
2_026.txt | AC | 1 ms | 256 KB |
2_027.txt | AC | 2 ms | 256 KB |
2_028.txt | AC | 2 ms | 256 KB |
2_029.txt | TLE | 2103 ms | 256 KB |
2_030.txt | TLE | 2103 ms | 256 KB |
2_031.txt | TLE | 2103 ms | 256 KB |
2_032.txt | AC | 77 ms | 256 KB |
2_033.txt | TLE | 2103 ms | 256 KB |
2_034.txt | AC | 76 ms | 256 KB |
2_035.txt | AC | 70 ms | 256 KB |
2_036.txt | TLE | 2103 ms | 256 KB |
2_037.txt | AC | 2 ms | 256 KB |
2_038.txt | AC | 2 ms | 256 KB |
2_039.txt | AC | 2 ms | 256 KB |
2_040.txt | TLE | 2103 ms | 256 KB |
2_041.txt | TLE | 2103 ms | 256 KB |
2_042.txt | TLE | 2103 ms | 256 KB |
2_043.txt | TLE | 2103 ms | 256 KB |
2_044.txt | TLE | 2103 ms | 256 KB |
2_045.txt | TLE | 2103 ms | 256 KB |
2_046.txt | TLE | 2103 ms | 256 KB |
2_047.txt | TLE | 2103 ms | 256 KB |
2_048.txt | TLE | 2103 ms | 256 KB |
2_049.txt | TLE | 2103 ms | 256 KB |
2_050.txt | TLE | 2103 ms | 256 KB |