# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891612 | imarn | Kpart (eJOI21_kpart) | C++14 | 273 ms | 348 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"
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define vi vector<int>
#define vvi vector<vi>
using namespace std;
void solve(){
int n;cin>>n;
int a[n+1];for(int i=1;i<=n;i++)cin>>a[i];
int qs[n+1]={0};for(int i=1;i<=n;i++)qs[i]=qs[i-1]+a[i];
bool vis[100001]={0};
bool ch[n+1]={0};ch[1]=1;
int nw=0,pr=0;vis[0]=1;int cnt=n-1;
for(int i=1;i<=n;i++){
pr=nw;nw=1-nw;
for(int j=100000;j>=0;j--)if(vis[j]&&j+a[i]<=100000)vis[j+a[i]]=1;
for(int j=2;j<=i;j++){
int x=qs[i]-qs[i-j];
if(x&1&&!ch[j]){ch[j]=1,cnt--;continue;}x>>=1;
if(!vis[x]&&!ch[j])ch[j]=1,cnt--;
}
}cout<<cnt<<" ";
for(int i=1;i<=n;i++)if(!ch[i])cout<<i<<" ";cout<<'\n';
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
int t;cin>>t;while(t--)solve();
}
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... |