# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
537450 | jamezzz | Kpart (eJOI21_kpart) | C++17 | 2095 ms | 133416 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
int t,n,a[1005],p[1005],memo[1005][100005],old[1005][100005],die[1005];
inline int dp(int i,int v){
if(a[i]==v)return i;
if(v<0||i==0)return 0;
if(old[i][v]==t+1)return memo[i][v];
old[i][v]=t+1;
return memo[i][v]=max(dp(i-1,v),dp(i-1,v-a[i]));
}
int main(){
sf("%d",&t);
while(t--){
sf("%d",&n);
for(int i=1;i<=n;++i)sf("%d",&a[i]),p[i]=a[i]+p[i-1];
memset(die,0,sizeof die);
for(int k=1;k<=n;++k){
for(int i=1;i+k-1<=n;++i){
int j=i+k-1;
if(die[k])break;
if(((p[j]-p[i-1])&1)==1)die[k]=1;
if(dp(j,(p[j]-p[i-1])/2)<i)die[k]=1;
}
}
int cnt=0;
for(int i=1;i<=n;++i)if(!die[i])++cnt;
pf("%d ",cnt);
for(int i=1;i<=n;++i)if(!die[i])pf("%d ",i);
pf("\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |