Submission #1443451


Source Code Expand

// ORZ YJZ
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define rep(i,a,b) for(int (i) = (a); (i) <= (b); i++)
#define repd(i,a,b) for(int (i) = (a); (i) >= (b); i--)
#define foreach(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); it++)
#define mp make_pair
#define pb push_back
using namespace std;
#define is_digit(c) ((c) >= '0' && (c) <= '9')
#define is_upper(c) ((c) >= 'A' && (c) <= 'Z')
#define is_lower(c) ((c) >= 'a' && (c) <= 'z')
#define readchar() ((char)fgetc(stdin))
#define printchar(c) fputc((c), stdout)
void readline(char *s) {int len=0;char c;for(c=readchar(); c!='\n'; s[len++]=c, c=readchar());s[len]=0;}
void readstr(char *s) {int len=0;char c;for(c=readchar(); c!=' '&&c!='\n'; s[len++]=c, c=readchar());s[len]=0;}
void printstr(const char *s) {int len=strlen(s);rep(i,0,len-1) printchar(s[i]);}
void to_lower(char *s, int L, int R) {rep(i,L,R) if (is_upper(s[i])) s[i]=s[i]-'A'+'a';}
void to_upper(char *s, int L, int R) {rep(i,L,R) if (is_lower(s[i])) s[i]=s[i]-'a'+'A';}
ll readll() {
	char c;ll ans=0, x=1;for (c=readchar(); !is_digit(c)&&c!='-'; c=readchar());
	if (c=='-') x=-1, c=readchar();for (; is_digit(c); ans=ans*10+c-'0', c=readchar());return ans*x;
}
void printll(ll x) {
	int a[25], cnt=0;if (x==0) { printchar('0'); return; }if (x<0) printchar('-'), x=-x;
	for (; x; a[cnt++]=x-x/10*10, x/=10);repd(i,cnt-1,0) printchar(a[i]+'0');
}
#define readint() ((int)readll())
#define printint(x) printll((ll)(x))
int n, K, a[5005];
bool dp[5005];
int main() {
	n=readint();K=readint();
	rep(i,1,n) a[i]=readint();
	int ans=0;
	rep(i,1,n) {
		memset(dp,0,sizeof(dp));
		dp[0]=true;
		rep(j,1,n) {
			if (j==i) continue;
			repd(k,5000,0) {
				if (dp[k]&&k+a[j]<=5000) dp[k+a[j]]=1;
			}
		}
		bool f=false;
		rep(j,1,5000) if (dp[j]&&j>=K-a[i]&&j<K) {
			f=true;break;
		}
		if (!f) ans++;
	}
	printint(ans);
	return 0;
}

Submission Info

Submission Time
Task D - No Need
User denverjin
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1948 Byte
Status WA
Exec Time 2103 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 300
Status
AC × 3
AC × 18
WA × 8
AC × 23
WA × 9
TLE × 19
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 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt WA 1 ms 256 KB
1_004.txt WA 1 ms 256 KB
1_005.txt WA 1 ms 256 KB
1_006.txt AC 2 ms 256 KB
1_007.txt AC 2 ms 256 KB
1_008.txt AC 540 ms 256 KB
1_009.txt AC 538 ms 256 KB
1_010.txt WA 522 ms 256 KB
1_011.txt WA 522 ms 256 KB
1_012.txt WA 556 ms 256 KB
1_013.txt WA 556 ms 256 KB
1_014.txt WA 890 ms 256 KB
1_015.txt AC 872 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt AC 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 652 ms 256 KB
1_020.txt AC 588 ms 256 KB
1_021.txt AC 864 ms 256 KB
1_022.txt AC 166 ms 256 KB
1_023.txt AC 67 ms 256 KB
1_024.txt AC 737 ms 256 KB
1_025.txt AC 779 ms 256 KB
2_026.txt WA 1 ms 256 KB
2_027.txt AC 2 ms 256 KB
2_028.txt AC 2 ms 256 KB
2_029.txt TLE 2103 ms 256 KB
2_030.txt TLE 2103 ms 256 KB
2_031.txt TLE 2103 ms 256 KB
2_032.txt TLE 2103 ms 256 KB
2_033.txt TLE 2103 ms 256 KB
2_034.txt TLE 2103 ms 256 KB
2_035.txt TLE 2103 ms 256 KB
2_036.txt TLE 2103 ms 256 KB
2_037.txt AC 2 ms 256 KB
2_038.txt AC 2 ms 256 KB
2_039.txt AC 2 ms 256 KB
2_040.txt TLE 2103 ms 256 KB
2_041.txt TLE 2103 ms 256 KB
2_042.txt TLE 2103 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 TLE 2103 ms 256 KB