# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089245 | vjudge1 | Kpart (eJOI21_kpart) | C++17 | 2009 ms | 856 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>
//qwerty47924692
using namespace std;
using ll = int;
const ll N=1e5+29;
ll n,t,a[N],mp[N],dp[N];
bool can(ll l,ll r){
multiset<ll>s;
ll sum=0,cur=0;
for(ll i=0;i<N;i++)dp[i]=0;
for(ll i=l;i<=r;i++){
sum+=a[i];
dp[a[i]]=1;
}
if(sum&1)return 0;
for(ll j=l;j<=r;j++){
for(ll i=a[j];i<=sum/2;i++){
dp[i]|=dp[i-a[j]];
}
}
return dp[sum/2];
}
void solve(){
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
}
vector<ll>v;
for(ll k=2;k<=n;k++){
ll ch=1;
for(ll i=1;i+k-1<=n;i++){
ll mid=((i+k-1)+i)>>1;
ch&=can(i,i+k-1);
}if(ch)v.push_back(k);
}
cout<<v.size();
for(ll i:v){
cout<<' '<<i;
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t;
cin>>t;
while(t--){
solve();
cout<<'\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... |