#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define pii pair <int,ll>
#define left (h<<1),l,((l + r)>>1)
#define right ((h<<1)|1),((l + r)>>1) + 1,r
using namespace std;
int sum,a[505];
vector <int> ans;
bitset <500001> dp;
signed main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n;
cin>>n;
for (int i = 1; i <= n; i++)
cin>>a[i],sum += a[i];
++n;
for (int x = 1; x <= sum; x++){
//x-s vamatebt axla
a[n] = x;
int can = 1;
for (int j = 1; j <= n; j++){
//j amovagdot
int target = (sum + x - a[j]);
if (target&1){
can=0;
break;
}
target/=2;
dp = 0;
dp[0] = 1;
for (int i = 1; i <= n; i++){
if (i != j) dp |= (dp << a[i]);
}
if (!dp[target]) {
can = 0;
break;
}
}
if (can){
ans.pb(x);
}
}
cout<<ans.size()<<endl;
for (int x: ans)
cout<<x<<" ";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
10 |
Correct |
274 ms |
484 KB |
Output is correct |
11 |
Execution timed out |
1073 ms |
468 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
10 |
Correct |
274 ms |
484 KB |
Output is correct |
11 |
Execution timed out |
1073 ms |
468 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
10 |
Correct |
274 ms |
484 KB |
Output is correct |
11 |
Execution timed out |
1073 ms |
468 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
10 |
Correct |
274 ms |
484 KB |
Output is correct |
11 |
Execution timed out |
1073 ms |
468 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
5 ms |
496 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
20 ms |
468 KB |
Output is correct |
5 |
Correct |
367 ms |
476 KB |
Output is correct |
6 |
Correct |
23 ms |
500 KB |
Output is correct |
7 |
Correct |
15 ms |
468 KB |
Output is correct |
8 |
Correct |
443 ms |
468 KB |
Output is correct |
9 |
Correct |
34 ms |
468 KB |
Output is correct |
10 |
Correct |
274 ms |
484 KB |
Output is correct |
11 |
Execution timed out |
1073 ms |
468 KB |
Time limit exceeded |
12 |
Halted |
0 ms |
0 KB |
- |