# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1105109 | KasymK | Kpart (eJOI21_kpart) | C++17 | 2053 ms | 544 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 ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e3+5;
const int S = 1e5+5;
int v[N];
bool dp[S], ok[N];
ll par[N];
void solve(){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
v[i] = x, ok[i] = 1, par[i] = par[i-1]+x;
}
for(int i = 1; i <= n; ++i){
for(int j = 0; j <= 1e5; ++j)
dp[j] = 0;
dp[0] = 1;
for(int j = i+1; j <= n; ++j){
int k = j-i+1;
ll sm = par[j]-par[i-1];
if(sm&1)
ok[k] = 0;
for(int to = 1e5; to >= v[j]; --to)
if(dp[to-v[j]])
dp[to] = 1;
if(!dp[sm/2])
ok[k] = 0;
}
}
vector<int> A;
for(int i = 2; i <= n; ++i)
if(ok[i])
A.pb(i);
printf("%d ", (int)A.size());
tr(it, A)
printf("%d ", *it);
puts("");
}
int main(){
int tt;
scanf("%d", &tt);
while(tt--)
solve();
return 0;
}
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... |