Submission #1734973


Source Code Expand

#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;

const int maxn = 5100;
const int maxk = 5100;

int n,k;
int a[maxn];
bitset<maxk>f[maxn],g[maxn];

int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	
	for(int i=1;i<=n;i++) if(a[i]>=k) { n=i-1; break; }
	
	f[0][0]=1;
	for(int i=1;i<=n;i++) f[i]=f[i-1]|(f[i-1]<<a[i]);
	g[n+1][0]=1;
	for(int i=n;i>=1;i--) g[i]=g[i+1]|(g[i+1]<<a[i]);
	
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		int d=k-a[i],u=k-1;
		int x=0,y=u;
		bool flag=false;
		for(x;x<=u;x++) if(f[i-1][x])
		{
			while(x+y>u) y--;
			for(;x+y>=d;y--) if(g[i+1][y]) { flag=true; break; }
			if(flag) break;
		}
		if(!flag) ans++;
	}
	printf("%d\n",ans);
	
	return 0;
}

Submission Info

Submission Time
Task D - No Need
User lichangdongtw
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1057 Byte
Status AC
Exec Time 52 ms
Memory 6528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
                     ^
./Main.cpp:31:41: 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

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 2304 KB
0_001.txt AC 2 ms 2304 KB
0_002.txt AC 2 ms 2304 KB
1_003.txt AC 1 ms 2304 KB
1_004.txt AC 2 ms 2304 KB
1_005.txt AC 2 ms 2304 KB
1_006.txt AC 2 ms 2304 KB
1_007.txt AC 2 ms 2304 KB
1_008.txt AC 2 ms 2560 KB
1_009.txt AC 2 ms 2560 KB
1_010.txt AC 2 ms 2304 KB
1_011.txt AC 2 ms 2304 KB
1_012.txt AC 2 ms 2304 KB
1_013.txt AC 2 ms 2304 KB
1_014.txt AC 2 ms 2304 KB
1_015.txt AC 2 ms 2560 KB
1_016.txt AC 2 ms 2304 KB
1_017.txt AC 2 ms 2304 KB
1_018.txt AC 1 ms 2304 KB
1_019.txt AC 2 ms 2304 KB
1_020.txt AC 2 ms 2560 KB
1_021.txt AC 2 ms 2560 KB
1_022.txt AC 2 ms 2432 KB
1_023.txt AC 2 ms 2304 KB
1_024.txt AC 2 ms 2432 KB
1_025.txt AC 2 ms 2432 KB
2_026.txt AC 1 ms 2304 KB
2_027.txt AC 1 ms 2304 KB
2_028.txt AC 1 ms 2304 KB
2_029.txt AC 39 ms 6528 KB
2_030.txt AC 52 ms 6528 KB
2_031.txt AC 2 ms 2304 KB
2_032.txt AC 2 ms 2304 KB
2_033.txt AC 2 ms 2304 KB
2_034.txt AC 2 ms 2304 KB
2_035.txt AC 2 ms 2304 KB
2_036.txt AC 7 ms 6528 KB
2_037.txt AC 2 ms 2304 KB
2_038.txt AC 2 ms 2304 KB
2_039.txt AC 2 ms 2304 KB
2_040.txt AC 2 ms 2304 KB
2_041.txt AC 6 ms 6528 KB
2_042.txt AC 7 ms 6528 KB
2_043.txt AC 4 ms 5632 KB
2_044.txt AC 5 ms 6144 KB
2_045.txt AC 5 ms 6016 KB
2_046.txt AC 16 ms 5888 KB
2_047.txt AC 21 ms 5888 KB
2_048.txt AC 24 ms 5888 KB
2_049.txt AC 20 ms 5632 KB
2_050.txt AC 17 ms 5376 KB