Submission #1369846

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <string>
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define INF (1100000099)
#define INFLL (1100000000000000099ll)
#define MAXN (5005)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;

bool d[MAXN][MAXN];
bool od[MAXN];
int A[MAXN];
int N, K, Ans;

int main() {
	scanf("%d%d", &N, &K);
	for(int i = 1; i <= N; i++) scanf("%d", &A[i]);
	d[0][0] = true;
	for(int i = 1; i <= N; i++) for(int j = 0; j <= K; j++) {
		bool &ret = d[i][j];
		if(j < A[i]) { ret = d[i-1][j]; continue; }
		ret = d[i-1][j] | d[i-1][j - A[i]];
	}
	od[0] = true;
	for(int i = N; i; i--) {
		if(K <= A[i]) { Ans++; continue; }
		int cnt = 0;
		for(int j = K-A[i]; j <= K-1; j++) cnt += od[j];
		for(int j = 0; j <= K-1; j++) {
			if(cnt && d[i-1][j]) { Ans++; break; }
			if(0 <= K-1-j) cnt -= od[K-1-j];
			if(0 <= K-A[i]-j-1) cnt += od[K-A[i]-j-1];
		}
		for(int j = K-A[i]; ~j; j--) if(od[j]) od[j+A[i]] = true;
	}
	printf("%d\n", N-Ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &K);
                       ^
./Main.cpp:44:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= N; i++) scanf("%d", &A[i]);
                                                ^

Judge Result