oj.uz

Submission #840925

# Submission time Handle Problem Language Result Execution time Memory
840925 2023-08-31T23:08:28 Z pera Kpart (eJOI21_kpart) C++17
100 / 100
 835 ms 536 KB 
#include<bits/stdc++.h>
using namespace std;

//#define int long long

const int N = 2e5 + 1;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int t = 1;cin >> t;
	while(t --){
		int n;cin >> n;
		vector<int> a(n + 1) , p(n + 1) , ls(n + 1) , ans;
		for(int i = 1;i <= n;i ++){
			cin >> a[i];
			p[i] = p[i - 1] + a[i];
			ls[i] = 1;
		}
		int X = p[n] / 2;
		vector<int> dp(X + 1);
		for(int i = 1;i <= n;i ++){
			for(int j = X;j > a[i];j --){
				dp[j] = max(dp[j] , dp[j - a[i]]);
			}
			if(a[i] <= X) dp[a[i]] = i;
			for(int k = 1;k <= i;k ++){
				ls[i - k + 1] &= ((p[i] - p[k - 1]) % 2 == 0 && dp[(p[i] - p[k - 1]) / 2] >= k);
			}
		}
		cout << accumulate(ls.begin() , ls.end() , 0) << endl;
		for(int i = 1;i <= n;i ++){
			if(ls[i] == 1) cout << i << " ";
		}
		cout << endl;
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 11 ms 352 KB Output is correct

Subtask #3
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 340 KB Output is correct
2 Correct 127 ms 404 KB Output is correct
3 Correct 147 ms 412 KB Output is correct
4 Correct 266 ms 440 KB Output is correct
5 Correct 601 ms 492 KB Output is correct
6 Correct 835 ms 512 KB Output is correct
7 Correct 788 ms 536 KB Output is correct