Submission #1161742

#	Time	Username	Problem	Language	Result	Execution time	Memory
1161742		strelok1337	Kpart (eJOI21_kpart)	C++20	30 / 100	2100 ms	198180 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define F first
#define S second
#define IShowSpeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define all(a) a.begin(),a.end()
const int N=1e3+10;
const ll inf = 1e18 + 1337;
const int mod=1e9+7;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
int a[N],sum[N],ans[N],dp[(int)5e4+2][N];

int main()
{
	//freopen("bank.in","r",stdin);
	//freopen("bank.out","w",stdout);
	IShowSpeed
	ll tt=1;
	cin>>tt;
	while(tt--)
	{
		ll n;
		cin>>n;
		for(int i=1;i<=n;i++) {
			cin>>a[i];
			sum[i] = sum[i-1] + a[i];
			ans[i] = 1;
			for(int j=0;j<=5e4;j++) dp[j][i] = 0; 
		}
		for(int i=1;i<=n;i++) {
			dp[0][i] = i;
			for(int j=0;j<=5e4;j++) {
				dp[j][i+1] = max(dp[j][i],dp[j][i+1]);
				if(j + a[i] > (int)5e4) continue;
				dp[j+a[i]][i+1] = max(dp[j][i],dp[j+a[i]][i+1]);
			}
			for(int l=1;l<=i;l++) {
				int x = sum[i] - sum[l-1];
				if(dp[x >> 1][i+1] < l || x % 2 == 1) ans[i - l + 1] = 0;
			}
		}
		vector<ll>res;
		for(int i=1;i<=n;i++) {
			if(ans[i]) res.pb(i);
		}
		cout<<res.size()<<" ";
		for(ll x: res) cout<<x<<" ";
		cout<<"\n";
	}
}
/*
1 2 2
2 3 1

*/

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 70