# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839607 | Dzadzo | Kpart (eJOI21_kpart) | C++14 | 2069 ms | 5020 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>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define S second
#define F first
#define pii pair<int,int>
#define vi vector <int>
#define vvi vector <vi>
#define vvvi vector <vvi>
#define INF LLONG_MAX
#define MOD 1000000009
#define MAXN 100000
using namespace std;
using namespace __gnu_pbds;
int32_t main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int t;
scanf("%d",&t);
while (t--){
int n;
scanf("%d",&n);
int a[n+1];
int p[n+1];
p[0]=0;
for (int i=1;i<=n;i++){scanf("%d",&a[i]);p[i]=p[i-1]+a[i];}
bitset<100001>b[n];
for (int i=1;i<n;i++)b[i][0]=1;
for (int i=1;i<n;i++){
b[i] |= (b[i]<<a[i]);
}
vi ans;
for (int k=2;k<=n;k++){
bool check=true;
for (int i=k;i<=n;i++){
b[i-k+1] |= (b[i-k+1]<<a[i]);
if ((p[i]-p[i-k])%2!=0){check=false;}else
if (!b[i-k+1][(p[i]-p[i-k])/2])check=false;
}
if (check)ans.pb(k);
}
printf("%lu",ans.size());
for (int x:ans)printf(" %d",x);
printf("\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... |