# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
890166 | 2023-12-20T16:11:19 Z | kim | Kpart (eJOI21_kpart) | C++17 | 822 ms | 848 KB |
#include<bits/stdc++.h> using namespace std; using ll=long long; #define eb emplace_back const int MX=50000; int a[1005],qs[1005]; int dp[MX+5]; void solve(){ int n; cin>>n; bool z=0; for(int i=1;i<=n;++i){ cin>>a[i]; qs[i]=a[i]+qs[i-1]; if(a[i]>MX) z=1; } if(z){ cout<<0<<endl; return; } for(int i=0;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>=1;--j) if(dp[j]) dp[j+a[i]]=max(dp[j+a[i]],dp[j]); dp[a[i]]=i; for(int j=1,k=i;j<i;++j,--k){ if((qs[i]-qs[j-1])&1) ok[k]=0; else if(dp[qs[i]-qs[j-1]>>1]<j) 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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 600 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 604 KB | Output is correct |
2 | Correct | 71 ms | 604 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 155 ms | 644 KB | Output is correct |
2 | Correct | 268 ms | 656 KB | Output is correct |
3 | Correct | 270 ms | 604 KB | Output is correct |
4 | Correct | 424 ms | 848 KB | Output is correct |
5 | Correct | 601 ms | 672 KB | Output is correct |
6 | Correct | 822 ms | 660 KB | Output is correct |
7 | Correct | 732 ms | 648 KB | Output is correct |