Submission #1176477
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> plli;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>=0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
const int mod = 1e9 + 7;
const ll INF = 1<<30;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
int n,k;
cin >> n >> k;
vi a(n);
rep(i,n) scanf("%d",&a[i]);
vvi ldp(n,vi(k,0));
vvi rdp(n,vi(k,0));
rep(i,n){
ldp[i][0]=1;rdp[i][0]=1;
if (a[i]<k) ldp[i][a[i]]=1;
if (a[n-1-i]<k) rdp[i][a[n-1-i]]=1;
}
rep2(i,1,n)rep(j,k){
if (j-a[i]>=0) ldp[i][j]=ldp[i-1][j-a[i]]||ldp[i-1][j];
else ldp[i][j]=ldp[i-1][j];
if (j-a[n-1-i]>=0) rdp[i][j]=rdp[i-1][j-a[n-1-i]]||rdp[i-1][j];
else rdp[i][j]=rdp[i-1][j];
}
rep(i,n)rep2(j,1,k){
rdp[i][j]+=rdp[i][j-1];
}
int cnt=0;
int lnum=0;
rep(i,n){
if (k-a[i]<=0){
cnt+=1;
continue;
}
rep(j,k){
if (i==0) lnum=0;
else if (i==n-1){
if (ldp[i-1][j] && a[i]+j>=k){
cnt+=1;
break;
}
continue;
}
else{
if (ldp[i-1][j]) lnum=j;
else continue;
}
if (k-a[i]-lnum<=0){
cnt+=1;
break;
}
if (rdp[n-2-i][k-1-lnum]-rdp[n-2-i][k-a[i]-lnum-1]){
cnt+=1;
break;
}
}
}
cout << n-cnt << endl;
return 0;
}
Submission Info
Submission Time
2017-03-22 19:36:56+0900
Task
C - Go Home
User
roto_37
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
2091 Byte
Status
RE
Exec Time
97 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i,n) scanf("%d",&a[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 200
Status
Set Name
Test Cases
Sample
0_000.txt, 0_001.txt, 0_002.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
Case Name
Status
Exec Time
Memory
0_000.txt
RE
97 ms
256 KB
0_001.txt
RE
96 ms
256 KB
0_002.txt
RE
96 ms
256 KB
1_003.txt
RE
96 ms
256 KB
1_004.txt
RE
97 ms
256 KB
1_005.txt
RE
96 ms
256 KB
1_006.txt
RE
95 ms
256 KB
1_007.txt
RE
95 ms
256 KB
1_008.txt
RE
96 ms
256 KB
1_009.txt
RE
96 ms
256 KB
1_010.txt
RE
96 ms
256 KB
1_011.txt
RE
97 ms
256 KB
1_012.txt
RE
95 ms
256 KB
1_013.txt
RE
96 ms
256 KB
1_014.txt
RE
95 ms
256 KB
1_015.txt
RE
96 ms
256 KB
1_016.txt
RE
96 ms
256 KB
1_017.txt
RE
96 ms
256 KB