Submission #788872

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788872	2023-07-20T16:59:53 Z	vjudge1	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1000 ms	2060 KB

bootfall

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef pair<pii, int> piii;
typedef pair<ll, pll> lpll;
typedef pair<pll, ll> plll;
typedef pair<pii, pii> piipii;
typedef pair<pll, pll> pllpll;
typedef long double ld;

#define SQ									   350
#define endl                                   '\n'
#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define PQ                                     priority_queue
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define set_dec(x)	                           cout << fixed << setprecision(x);
#define ios				                       ios_base::sync_with_stdio(false), cin.tie(0)
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define file_io(x,y)	                       freopen(x, "r", stdin); freopen(y, "w", stdout);

const int N = 2e5+25, lg=18;
int Mod = 5e8+10;
//ll Mod = 998244353;

ll max(ll a, ll b)                             {return (a>b ? a : b);}
ll min(ll a, ll b)                             {return (a<b ? a : b);}
ll abso(ll a)                                  {return (a<0?-a:a);}
inline int MOD(int a, int mod=Mod) {
	a += mod;
	while(a>=mod) a-=mod;
	return a;
}
inline ll poww(ll a, ll b) {
    ll ans = 1;
    a=MOD(a);
    while (b) {
        if (b & 1) ans = MOD(ans*a);
        b >>= 1;
        a = MOD(a*a);
    }
    return ans;
}

int n, A[505], dp[505*505], num[N], sum, z;
int main () {
	ios;

	cin>>n;
	for(int i=1; i<=n; i++) cin>>A[i], sum+=A[i];
	for(int i=1; i<n; i++) if(MOD(A[i]%2, 2)!=MOD(A[i+1]%2, 2)) z = 1;
	if(z || MOD(sum%2, 2)==1) kill(0);

	dp[0] = 1;
	for(int i=1; i<=n; i++) {
		for(int j=sum; j>=A[i]; j--) dp[j] = MOD(dp[j] + dp[j-A[i]]);
	}

	for(int i=1; i<=n; i++) {
		for(int j=A[i]; j<=sum; j++) dp[j] = MOD(dp[j] - dp[j-A[i]]);
		for(int f=MOD(A[1]%2, 2); f<=sum; f+=2) {
			if(dp[(f+sum-A[i])/2]>0) num[f]++;
		}
		for(int j=sum; j>=A[i]; j--) dp[j] = MOD(dp[j] + dp[j-A[i]]);
	}

	vector<ll> ans;
	for(int i=0; i<=sum; i++) {
		if(num[i]==n && dp[sum/2]>0) ans.pb(i);
	}

	cout<<size(ans)<<endl;
	for(auto i : ans) {cout<<i<<' ';}

	return 0;
}

Subtask #1

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct

Subtask #3

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	340 KB	Output is correct
25	Correct	8 ms	368 KB	Output is correct
26	Correct	10 ms	468 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	404 KB	Output is correct
29	Correct	7 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	392 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	6 ms	412 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct

Subtask #4

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	340 KB	Output is correct
25	Correct	8 ms	368 KB	Output is correct
26	Correct	10 ms	468 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	404 KB	Output is correct
29	Correct	7 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	392 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	6 ms	412 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	724 KB	Output is correct
38	Correct	49 ms	720 KB	Output is correct
39	Correct	43 ms	788 KB	Output is correct
40	Correct	114 ms	824 KB	Output is correct
41	Correct	56 ms	884 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	164 ms	1180 KB	Output is correct
44	Correct	171 ms	1136 KB	Output is correct
45	Correct	175 ms	1152 KB	Output is correct
46	Correct	67 ms	468 KB	Output is correct
47	Correct	104 ms	832 KB	Output is correct
48	Correct	157 ms	1176 KB	Output is correct
49	Correct	110 ms	844 KB	Output is correct
50	Correct	103 ms	832 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	221 ms	1364 KB	Output is correct

Subtask #5

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	340 KB	Output is correct
25	Correct	8 ms	368 KB	Output is correct
26	Correct	10 ms	468 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	404 KB	Output is correct
29	Correct	7 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	392 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	6 ms	412 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	724 KB	Output is correct
38	Correct	49 ms	720 KB	Output is correct
39	Correct	43 ms	788 KB	Output is correct
40	Correct	114 ms	824 KB	Output is correct
41	Correct	56 ms	884 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	164 ms	1180 KB	Output is correct
44	Correct	171 ms	1136 KB	Output is correct
45	Correct	175 ms	1152 KB	Output is correct
46	Correct	67 ms	468 KB	Output is correct
47	Correct	104 ms	832 KB	Output is correct
48	Correct	157 ms	1176 KB	Output is correct
49	Correct	110 ms	844 KB	Output is correct
50	Correct	103 ms	832 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	221 ms	1364 KB	Output is correct
53	Correct	173 ms	1008 KB	Output is correct
54	Correct	246 ms	1256 KB	Output is correct
55	Correct	461 ms	1996 KB	Output is correct
56	Correct	220 ms	1304 KB	Output is correct
57	Correct	492 ms	2060 KB	Output is correct
58	Correct	275 ms	1332 KB	Output is correct
59	Correct	336 ms	1512 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	379 ms	1620 KB	Output is correct
62	Correct	380 ms	1740 KB	Output is correct
63	Correct	413 ms	1888 KB	Output is correct
64	Correct	393 ms	1860 KB	Output is correct
65	Correct	51 ms	692 KB	Output is correct
66	Correct	76 ms	844 KB	Output is correct

Subtask #6

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	340 KB	Output is correct
25	Correct	8 ms	368 KB	Output is correct
26	Correct	10 ms	468 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	404 KB	Output is correct
29	Correct	7 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	392 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	3 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	6 ms	412 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	724 KB	Output is correct
38	Correct	49 ms	720 KB	Output is correct
39	Correct	43 ms	788 KB	Output is correct
40	Correct	114 ms	824 KB	Output is correct
41	Correct	56 ms	884 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	164 ms	1180 KB	Output is correct
44	Correct	171 ms	1136 KB	Output is correct
45	Correct	175 ms	1152 KB	Output is correct
46	Correct	67 ms	468 KB	Output is correct
47	Correct	104 ms	832 KB	Output is correct
48	Correct	157 ms	1176 KB	Output is correct
49	Correct	110 ms	844 KB	Output is correct
50	Correct	103 ms	832 KB	Output is correct
51	Correct	1 ms	212 KB	Output is correct
52	Correct	221 ms	1364 KB	Output is correct
53	Correct	173 ms	1008 KB	Output is correct
54	Correct	246 ms	1256 KB	Output is correct
55	Correct	461 ms	1996 KB	Output is correct
56	Correct	220 ms	1304 KB	Output is correct
57	Correct	492 ms	2060 KB	Output is correct
58	Correct	275 ms	1332 KB	Output is correct
59	Correct	336 ms	1512 KB	Output is correct
60	Correct	0 ms	212 KB	Output is correct
61	Correct	379 ms	1620 KB	Output is correct
62	Correct	380 ms	1740 KB	Output is correct
63	Correct	413 ms	1888 KB	Output is correct
64	Correct	393 ms	1860 KB	Output is correct
65	Correct	51 ms	692 KB	Output is correct
66	Correct	76 ms	844 KB	Output is correct
67	Correct	386 ms	1612 KB	Output is correct
68	Correct	476 ms	1272 KB	Output is correct
69	Execution timed out	1080 ms	1868 KB	Time limit exceeded
70	Halted	0 ms	0 KB	-