//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
int a,b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c, d,e,f;
};
int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l;
int i,s10,s12;
int el=29;
main()
{
#ifndef ONLINE_JUDGE
/// fin(task),fou(task);
#endif
NHP
/// cin>>s1;
modwwe
phongbeo(),down
}
int a[1001];
int b[1001];
int dp[100001];
bool c[1001];
void phongbeo()
{
cin>>n;
s2=0;
for(int i=1;i<=n;i++)
cin>>a[i],s2+=a[i],b[i]=b[i-1]+a[i],c[i]=0;
for(int j=0;j<=s2;j++)
dp[j]=0;
for(int i=1;i<=n;i++)
{
for(int j=s2;j>a[i];--j)
{
dp[j]=max(dp[j-a[i]],dp[j]);
}
dp[a[i]]=i;
for(int j=i-1;j>=1;--j)
{
s3=b[i]-b[j-1];
if(s3%2!=0){c[i-j+1]=1; continue;}
s3/=2;
if(dp[s3]<j) {c[i-j+1]=1; if(i-j+1==2) continue;}
}
}
dem=0;
for(int i=2;i<=n;i++)
if(!c[i])
dem++;
cout<<dem<<" ";
for(int i=2;i<=n;i++)
if(!c[i])
cout<<i<<" ";
}
Compilation message
Main.cpp:19:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
19 | const int inf=1e18;
| ^~~~
Main.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
47 | main()
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Correct |
7 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
348 KB |
Output is correct |
2 |
Correct |
54 ms |
604 KB |
Output is correct |
3 |
Correct |
67 ms |
632 KB |
Output is correct |
4 |
Correct |
113 ms |
688 KB |
Output is correct |
5 |
Correct |
261 ms |
852 KB |
Output is correct |
6 |
Correct |
358 ms |
840 KB |
Output is correct |
7 |
Correct |
346 ms |
848 KB |
Output is correct |