Submission #1333603


Source Code Expand

#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>

using namespace std;

#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;

const int N = 6000;
int a[N];
bool L[N][N], R[N][N];
int sum[N][N];

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  L[0][0] = true;
  for (int i = 0; i < n; ++i) {
    copy(L[i], L[i] + m, L[i + 1]);
    for (int j = m - 1; j >= a[i]; --j) {
      L[i + 1][j] |= L[i][j - a[i]];
    }
  }
  R[n][0] = true;
  for (int i = n - 1; i >= 0; --i) {
    copy(R[i + 1], R[i + 1] + m, R[i]);
    for (int j = m - 1; j >= a[i]; --j) {
      R[i][j] |= R[i + 1][j - a[i]];
    }
  }
  for (int i = 0; i <= n; ++i) {
    sum[i][0] = 0;
    for (int j = 1; j <= m; ++j) {
      sum[i][j] = sum[i][j - 1] + R[i][j - 1];
    }
  }
  int ret = 0;
  for (int i = 0; i < n; ++i) {
    int vl = max(0, m - a[i]), vr = m - 1;
    bool found = false;
    for (int j = 0; j <= vr; ++j) {
      if (!L[i][j]) continue;
      int kr = vr - j, kl = max(0, vl - j);
      if (sum[i + 1][kr + 1] - sum[i + 1][kl] > 0) {
        found = true;
        break;
      }
    }
    if (!found) ++ret;
  }
  printf("%d\n", ret);
  return 0;
}

Submission Info

Submission Time
Task D - No Need
User cuiaoxiang
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2064 Byte
Status AC
Exec Time 176 ms
Memory 184576 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n, &m);
                        ^
./Main.cpp:50: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 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 2 ms 6400 KB
0_001.txt AC 2 ms 6400 KB
0_002.txt AC 2 ms 6400 KB
1_003.txt AC 2 ms 6400 KB
1_004.txt AC 2 ms 6400 KB
1_005.txt AC 2 ms 6400 KB
1_006.txt AC 2 ms 6528 KB
1_007.txt AC 2 ms 6528 KB
1_008.txt AC 6 ms 19200 KB
1_009.txt AC 6 ms 19200 KB
1_010.txt AC 5 ms 19200 KB
1_011.txt AC 5 ms 19072 KB
1_012.txt AC 5 ms 19200 KB
1_013.txt AC 5 ms 19072 KB
1_014.txt AC 5 ms 19072 KB
1_015.txt AC 5 ms 19200 KB
1_016.txt AC 2 ms 6400 KB
1_017.txt AC 2 ms 6400 KB
1_018.txt AC 2 ms 6400 KB
1_019.txt AC 5 ms 19072 KB
1_020.txt AC 5 ms 19072 KB
1_021.txt AC 5 ms 19072 KB
1_022.txt AC 4 ms 14976 KB
1_023.txt AC 4 ms 12928 KB
1_024.txt AC 5 ms 19072 KB
1_025.txt AC 5 ms 19072 KB
2_026.txt AC 2 ms 6400 KB
2_027.txt AC 3 ms 6528 KB
2_028.txt AC 2 ms 6528 KB
2_029.txt AC 168 ms 184576 KB
2_030.txt AC 176 ms 184576 KB
2_031.txt AC 99 ms 184576 KB
2_032.txt AC 37 ms 182912 KB
2_033.txt AC 99 ms 184576 KB
2_034.txt AC 37 ms 182912 KB
2_035.txt AC 36 ms 182912 KB
2_036.txt AC 123 ms 184576 KB
2_037.txt AC 2 ms 6656 KB
2_038.txt AC 3 ms 6656 KB
2_039.txt AC 3 ms 6656 KB
2_040.txt AC 87 ms 184320 KB
2_041.txt AC 81 ms 183808 KB
2_042.txt AC 105 ms 184192 KB
2_043.txt AC 65 ms 116608 KB
2_044.txt AC 77 ms 157440 KB
2_045.txt AC 53 ms 150656 KB
2_046.txt AC 86 ms 183680 KB
2_047.txt AC 113 ms 184192 KB
2_048.txt AC 135 ms 184576 KB
2_049.txt AC 127 ms 184576 KB
2_050.txt AC 122 ms 184576 KB