Submission #1369871

---

Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 15;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

bool dp1[5050][5050];
bool dp2[5050][5050];
int in[5050];
int sum[5050];
int main() {
	int N, K, i, j, k;
	scanf("%d %d", &N, &K);
	for (i = 1; i <= N; i++) scanf("%d", &in[i]);

	dp1[0][0] = true;
	for (i = 1; i <= N; i++) {
		for (j = 0; j <= K; j++) {
			dp1[i][j] = dp1[i - 1][j];
			if (j >= in[i] && dp1[i - 1][j - in[i]]) dp1[i][j] = true;
		}
	}
	dp2[N + 1][0] = true;
	for (i = N; i >= 1; i--) {
		for (j = 0; j <= K; j++) {
			dp2[i][j] = dp2[i + 1][j];
			if (j >= in[i] && dp2[i + 1][j - in[i]]) dp2[i][j] = true;
		}
	}

	int ans = 0;
	for (i = 1; i <= N; i++) {
		sum[0] = 1;
		for (j = 1; j <= K; j++) sum[j] = sum[j - 1] + (int)dp2[i + 1][j];
		
		for (j = 0; j < K; j++) {
			if (!dp1[i-1][j]) continue;
			int st = max(0, K - in[i] - j), en = K - 1 - j;
			if (sum[en] != ((st == 0) ? 0 : sum[st - 1])) break;
		}
		if (j >= K) ans++;
	}
	return !printf("%d\n", ans);
}

Submission Info

Compile Error

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

Judge Result