# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
592950 |
2022-07-09T21:51:32 Z |
TimDee |
Kpart (eJOI21_kpart) |
C++14 |
|
1638 ms |
220832 KB |
#include <bits/stdc++.h>
using namespace std;
#define paiu return
#define moment 0;
#define int long long
#define double long double
#define ll long long
#define forr(i,x) for (int i=0; i<x; i++)
#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); forr(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 = 2e5;
const int inf = INT_MAX;
const ll linf = LLONG_MAX;
const ll mmod = 998244353;
int dp[1000][50001];
void solve() {
int n; cin>>n; vii(a,n);
vector<int> pr = ___makeprefsum(a);
forn(i,n) forn(j,pr[n]+1) dp[i][j]=-1;
forn(i,n) dp[i][a[i]]=i;
for (int i=1; i<n; ++i) {
for (int j=1; j<=pr[n]; ++j) {
dp[i][j]=max(dp[i][j],dp[i-1][j]);
if (j-a[i]>=0) dp[i][j]=max(dp[i][j],dp[i-1][j-a[i]]);
}
}
vector<int> ans;
for (int k=2; k<=n; ++k) {
int foo=1;
for (int i=0; i+k<=n; ++i) {
int s = pr[i+k]-pr[i];
if (s%2) {foo=0; break;}
if (dp[i+k-1][s/2]<i) {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:12: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]
12 | #define forn(i,x) for (int i=0; i<x; i++)
......
74 | forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ~~~~~~~~~~~~
Main.cpp:74:5: note: in expansion of macro 'forn'
74 | forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ^~~~
Main.cpp:12:19: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
12 | #define forn(i,x) for (int i=0; i<x; i++)
| ^~~
Main.cpp:74:5: note: in expansion of macro 'forn'
74 | forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ^~~~
Main.cpp:74:43: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
74 | forn(i,ans.size()) cout<<ans[i]<<' '; cout<<'\n';
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
4564 KB |
Output is correct |
2 |
Correct |
74 ms |
13188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
295 ms |
53224 KB |
Output is correct |
2 |
Correct |
805 ms |
120876 KB |
Output is correct |
3 |
Correct |
976 ms |
154224 KB |
Output is correct |
4 |
Incorrect |
1638 ms |
220832 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |