# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786911 | Bula | Kpart (eJOI21_kpart) | C++17 | 2092 ms | 385592 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 ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int ll
const ll mod=1e9+7;
int dp[1001][50001];
main(){
int tt;
cin>>tt;
while(tt--){
int n;
cin>>n;
vector<int> v(n+1),pref(n+1);
int s=0;
for(int i=1;i<=n;i++){
cin>>v[i];
s+=v[i];
}
for(int i=1;i<=n;i++){
pref[i]=pref[i-1]+v[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=50000;j++){
dp[i][j]=0;
}
}
for(int i=1;i<=n;i++){
for(int j=50000;j>=1;j--){
dp[i][j]=dp[i-1][j];
if(j>v[i]) dp[i][j]=max(dp[i][j],dp[i-1][j-v[i]]);
if(j==v[i]) dp[i][j]=i;
}
}
vector<int> k;
for(int i=2;i<=n;i++){
bool ok = true;
for(int j=i;j<=n;j++){
int sum=pref[j]-pref[j-i];
if(sum%2==1 || dp[j][sum/2]<=j-i) ok = false;
}
if(ok == true) k.pb(i);
}
cout<<k.size()<<" ";
for(int i=0;i<k.size();i++){
cout<<k[i]<<" ";
}
cout<<endl;
// for(int i=1;i<=n;i++){
// for(int j=1;j<=s;j++){
// cout<<dp[i][j]<<" ";
// }
// cout<<endl;
// }
}
}
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... |