Submission #582646

#	Time	Username	Problem	Language	Result	Execution time	Memory
582646		juggernaut	Kpart (eJOI21_kpart)	C++14	100 / 100	1136 ms	196036 KiB

Main

#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int a[1005];
bool can[1005];
int dp[1005][50005];
int pref[1005];
int main(){
	int test;
	scanf("%d",&test);
	while(test--){
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
			pref[i]=pref[i-1]+a[i];
			can[i]=true;
		}
		for(int i=1;i<=n;i++){
			for(int j=0;j<a[i];j++)dp[i][j]=dp[i-1][j];
			for(int j=a[i];j<50005;j++)dp[i][j]=max(dp[i-1][j],dp[i-1][j-a[i]]);
			dp[i][a[i]]=i;
			for(int j=1;j<=i;j++){
				int sum=pref[i]-pref[j-1];
				if(sum&1)can[i-j+1]=0;
				else if(dp[i][sum>>1]<j)can[i-j+1]=0;
			}
		}
		int cnt=0;
		for(int i=1;i<=n;i++)cnt+=can[i];
		printf("%d ",cnt);
		for(int i=1;i<=n;i++)if(can[i])printf("%d ",i);
		printf("\n");
	}
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d",&test);
      |  ~~~~~^~~~~~~~~~~~
Main.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%d",&n);
      |   ~~~~~^~~~~~~~~
Main.cpp:31:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |    scanf("%d",&a[i]);
      |    ~~~~~^~~~~~~~~~~~

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