Submission #1369823

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

const int MAX_N = 5e3 + 10;

int N, K, Nr[MAX_N];
bool L[MAX_N][MAX_N], R[MAX_N][MAX_N];
int FastR[2][MAX_N][MAX_N], All[MAX_N];
int main() {
	cin >> N >> K;
	REPO(i, N) scanf("%d", &Nr[i]);
	L[0][0] = true;
	for(int i=1; i<=N; i++) {
		for(int k=0; k<=K; k++) L[i][k] = L[i-1][k];
		for(int k=0; k+Nr[i]<=K; k++)
			if(L[i-1][k]) L[i][k+Nr[i]] = true;
	}
	R[N+1][0] = true;
	for(int i=N; i>=1; i--) {
		for(int k=0; k<=K; k++) R[i][k] = R[i+1][k];
		for(int k=0; k+Nr[i]<=K; k++)
			if(R[i+1][k]) R[i][k+Nr[i]] = true;
	}

	for(int i=1; i<=N+1; i++) {
		FastR[0][i][0] = R[i][0];
		FastR[1][i][K] = R[i][K];
		for(int k=1; k<=K; k++) FastR[0][i][k] = FastR[0][i][k-1] + R[i][k];
		for(int k=K-1; k>=0; k--) FastR[1][i][k] = FastR[1][i][k+1] + R[i][k];
		for(int k=0; k<=K; k++) All[i] += R[i][k];
	}

	int ans = 0;
	for(int i=1; i<=N; i++) {
		bool find = false;
		for(int k=0; k<K; k++) if(L[i-1][k]) {
			//K-Nr[i]-k to K-k-1
			int l = K-Nr[i]-k-1, r = K-k;
			int ll = 0, rr = FastR[1][i+1][r];
			if(l >= 0) ll = FastR[0][i+1][l];
			int cnt = All[i+1] - ll - rr;
			if(cnt >= 1) {find = true; break;}
		}
		if(!find) ans++;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Compile Error

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

Judge Result