# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
582440 |
2022-06-23T18:43:08 Z |
TimDee |
Kpart (eJOI21_kpart) |
C++14 |
|
328 ms |
6320 KB |
#include <bits/stdc++.h>
using namespace std;
#define paiu return
#define moment 0;
#define int long long
#define ll long long
#define forn(i,x) for (int i=0; i<x; i++)
#define vi(a,n) vector<int> a(n,0)
//cringe define
#define vii(a,n) vi(a,n); forn(i,n) cin>>a[i];
vector<int> ___makeprefsum(vector<int>&a) {
int n=a.size();
vi(pr,n+1);
forn(i,n) pr[i+1]=pr[i]+a[i];
return pr;
}
#define prefsum(pr,a) vector<int> pr=___makeprefsum(a);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb(x) push_back(x)
#define pf pop_front();
#define last(c) c[c.size()-1]
#define f first
#define s second
#define pi pair<int, int>
#define mp(x,y) make_pair(x, y)
const ll mod = 1000000007;
const double ppi = acos(0) * 2;
//const int maxn = 3e5+1;
const int inf = INT_MAX;
const ll linf = LLONG_MAX;
const ll mmod = 998244353;
void solve() {
int n; cin>>n;
vii(a,n);
int s=0; forn(i,n) s+=a[i];
const int size=1e5+3;
vector<bitset<size>> dp(n+1);
//forn(i,n+1) dp[i].assign(s+3,0);
dp[0][0]=1;
for (int i=1; i<=n; ++i) {
for (int j=1; j<=s; ++j) {
dp[i][j]=dp[i-1][j];
if (j-a[i-1]>=0 && dp[i-1][j-a[i-1]]) dp[i][j]=dp[i-1][j-a[i-1]];
}
}
vector<int> pr(n+1,0);
forn(i,n) pr[i+1]=pr[i]+a[i];
vector<int> ans;
for (int k=1; k<=n; ++k) {
int foo=1;
for (int l=0; l+k<=n; ++l) {
if ((pr[l+k]-pr[l])%2) {
foo=0;
break;
}
if (!dp[n][s-(pr[l+k]-pr[l])/2]) {
foo=0;
break;
}
}
if (foo) ans.pb(k);
}
cout<<ans.size()<<' '; forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
}
int32_t main() {
//ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//init_primes();
int t=1;
cin>>t;
while(t--) solve();
paiu moment
}
Compilation message
Main.cpp: In function 'void solve()':
Main.cpp:10:34: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
10 | #define forn(i,x) for (int i=0; i<x; i++)
......
93 | cout<<ans.size()<<' '; forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ~~~~~~~~~~~~
Main.cpp:93:28: note: in expansion of macro 'forn'
93 | cout<<ans.size()<<' '; forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
956 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
1844 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
328 ms |
6320 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |