oj.uz

Submission #632486

# Submission time Handle Problem Language Result Execution time Memory
632486 2022-08-20T07:30:58 Z pragmatist Kpart (eJOI21_kpart) C++17
10 / 100
 2000 ms 700 KB 
#include<bits/stdc++.h>
 
#define ll long long
#define pb push_back
#define sz(v) (int)v.size()
#define nl "\n"
 
using namespace std;
 
const int N = (int)1e3 + 7;
const int MOD = (int)1e9 + 7;
const int M = (int)1e5 + 7; 
 
int sum(int x, int y) {
	x += y;
	if(x >= MOD) x -= MOD;
	return x;
}
 
int sub(int x, int y) {
	x -= y;
	if(x < 0) {          
		x += MOD;
	}
	return x;
}
 
int n, a[N], dp[M]; 

void del(int x) {
	for(int w = 0; w < M - x; ++w) {
		dp[w + x] = sub(dp[w + x], dp[w]);
	}
}

void add(int x) {
	for(int w = M - x - 1; w >= 0; --w) {
		dp[w + x] = sum(dp[w + x], dp[w]);
	}
} 
bool check(int sum) {
	if(sum & 1) return 0;
	return (dp[sum / 2] > 0);
}
 
void solve() {
	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	vector<int> ans;
	for(int k = 2; k <= n; ++k) {
		memset(dp, 0, sizeof(dp));
		dp[0] = 1;
		int sum = 0;
		for(int i = 1; i <= k; ++i) {
			sum += a[i];
			add(a[i]);
		}               	 
		bool ok = check(sum);       
		for(int i = k + 1; i <= n && ok; ++i) {
			sum -= a[i - k];
			sum += a[i];
			del(a[i - k]);
			add(a[i]);
			ok &= check(sum);
		}          
		if(ok) ans.pb(k);
	}
	cout << sz(ans) << ' ';
	for(auto x : ans) cout << x << ' ';
	cout << nl;
}
 
int main() {
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cout.tie(0);
	int test;
	cin >> test;
	while(test--) {
		solve();
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 700 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2066 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -