# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
536575 |
2022-03-13T14:33:22 Z |
errorgorn |
Kpart (eJOI21_kpart) |
C++17 |
|
70 ms |
556 KB |
// Super Idol的笑容
// 都没你的甜
// 八月正午的阳光
// 都没你耀眼
// 热爱105°C的你
// 滴滴清纯的蒸馏水
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n;
int arr[1005];
int pre[1005];
int memo[100005];
bool can[1005];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
int TC;
cin>>TC;
while (TC--){
cin>>n;
rep(x,1,n+1) cin>>arr[x];
rep(x,1,n+1) can[x]=true;
rep(x,1,n+1) pre[x]=pre[x-1]+arr[x];
rep(x,0,pre[n]+1) memo[x]=-1;
rep(x,1,n+1){
memo[0]=x;
rep(y,pre[x]+1,arr[x]) memo[y]=max(memo[y],memo[y-arr[x]]);
//rep(y,0,pre[x]+1) cout<<memo[y]<<" "; cout<<endl;
rep(y,0,x){
int diff=pre[x]-pre[y];
if (diff%2==1 || memo[diff/2]<y) can[x-y]=false;
}
}
vector<int> ans;
rep(x,1,n+1) if (can[x]) ans.pub(x);
if (sz(ans)==0) cout<<0<<endl;
else{
cout<<sz(ans)<<" ";
rep(x,0,sz(ans)) cout<<ans[x]<<" \n"[x==sz(ans)-1];
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
412 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
70 ms |
556 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |