제출 #1106396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1106396		Muhammet	Kpart (eJOI21_kpart)	C++17	0 / 100	95 ms	592 KiB

Main

#include "bits/stdc++.h"

using namespace std;

#define ll long long
#define ff first
#define ss second

const int N = 3e5+5;

int T, n;

int main(){
	cin >> T;
	while(T--){
		cin >> n;
		vector <int> a(n+1);
		int s = 0;
		for(int i = 1; i <= n; i++){
			cin >> a[i];
			s += a[i];
		}
		vector <bool> vis(n+1,0);
		vector <int> dp(s+1,0);
		for(int i = 1; i <= n; i++){
			dp[a[i]] = i;
			for(int j = a[i]; j <= s; j++){
				dp[j] = max(dp[j],dp[j-a[i]]);
			}
			int s = 0;
			for(int j = i; j >= 1; j--){
				s += a[j];
				if(dp[s/2] < j or s % 2 == 1) vis[i-j+1] = 1;
			}
		}
		vector <int> v;
		int cnt = 0;
		for(int i = 1; i <= n; i++){
			if(vis[i] == 0){
				cnt++;
				v.push_back(i);
			}
		}
		cout << cnt << ' ';
		for(auto i : v){
			cout << i << " ";
		}
		cout << '\n';
	}
}

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