oj.uz

답안 #890135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890135 2023-12-20T15:26:45 Z kim Kpart (eJOI21_kpart) C++17
0 / 100
 295 ms 860 KB 
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define eb emplace_back

const int MX=100000;

int a[1005],qs[1005];
int dp[MX+5]={1};

void solve(){
	int n; cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i];
		qs[i]=a[i]+qs[i-1];
	}
	for(int i=1;i<=MX;++i) dp[i]=0;
	vector<bool> ok(n+5,1);
	for(int i=1;i<=n;++i){
		for(int j=MX-a[i];j>=0;--j) if(dp[j]) dp[j+a[i]]=1;
		for(int j=1,k=i;j<i;++j,--k){
			if((qs[i]-qs[j-1])&1) ok[k]=0;
			if(!ok[k]) continue;
			if(!dp[qs[i]+qs[j-1]>>1]) ok[k]=0;
		}
	}
	vector<int> ans;
	for(int i=2;i<=n;++i){
		if(ok[i]) ans.eb(i);
	}
	cout<<ans.size()<<" ";
	for(auto &e:ans) cout<<e<<" ";
	cout<<endl;

}

int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	
	int Q(1);
	cin>>Q;
	while(Q--){
		solve();
	}

	return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:24:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |    if(!dp[qs[i]+qs[j-1]>>1]) ok[k]=0;
      |           ~~~~~^~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 99 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 295 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -