Submission #1168379


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
bool ans[5005];
int a[5005];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int j = 1; j <= 5000; j++) {
    bool skipped = false;
    bitset<5000> bs;
    bs[0] = 1;
    for (int i = 1; i <= n; i++) {
      if (a[i] == j && !skipped) {
        skipped = true;
        continue;
      }
      if (a[i] < k) {
        bs |= (bs << a[i]);
      }
    }
    for (int i = k - 1; i >= max(0, k - j); i--) {
      ans[j] |= bs[i];
    }
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] < k) {
      cnt += ans[a[i]];
    } else {
      cnt++;
    }
  }
  printf("%d\n", n - cnt);
  return 0;
}

Submission Info

Submission Time
Task D - No Need
User microtony
Language C++14 (GCC 5.4.1)
Score 300
Code Size 760 Byte
Status TLE
Exec Time 2107 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &n, &k);
                         ^
./Main.cpp:9:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a[i]);
                       ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 0 / 300
Status
AC × 3
AC × 26
AC × 39
TLE × 12
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 5 ms 256 KB
0_001.txt AC 9 ms 256 KB
0_002.txt AC 7 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 3 ms 256 KB
1_006.txt AC 20 ms 256 KB
1_007.txt AC 20 ms 256 KB
1_008.txt AC 466 ms 256 KB
1_009.txt AC 465 ms 256 KB
1_010.txt AC 5 ms 256 KB
1_011.txt AC 3 ms 256 KB
1_012.txt AC 5 ms 256 KB
1_013.txt AC 3 ms 256 KB
1_014.txt AC 3 ms 256 KB
1_015.txt AC 466 ms 256 KB
1_016.txt AC 12 ms 256 KB
1_017.txt AC 13 ms 256 KB
1_018.txt AC 13 ms 256 KB
1_019.txt AC 14 ms 256 KB
1_020.txt AC 402 ms 256 KB
1_021.txt AC 462 ms 256 KB
1_022.txt AC 145 ms 256 KB
1_023.txt AC 112 ms 256 KB
1_024.txt AC 253 ms 256 KB
1_025.txt AC 237 ms 256 KB
2_026.txt AC 15 ms 256 KB
2_027.txt AC 27 ms 256 KB
2_028.txt AC 27 ms 256 KB
2_029.txt TLE 2103 ms 256 KB
2_030.txt TLE 2103 ms 256 KB
2_031.txt AC 40 ms 256 KB
2_032.txt AC 26 ms 256 KB
2_033.txt AC 39 ms 256 KB
2_034.txt AC 26 ms 256 KB
2_035.txt AC 26 ms 256 KB
2_036.txt TLE 2103 ms 256 KB
2_037.txt AC 27 ms 256 KB
2_038.txt AC 28 ms 256 KB
2_039.txt AC 28 ms 256 KB
2_040.txt AC 52 ms 256 KB
2_041.txt TLE 2103 ms 256 KB
2_042.txt TLE 2107 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 AC 1985 ms 256 KB