답안 #788861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788861	2023-07-20T16:52:53 Z	vjudge1	Bootfall (IZhO17_bootfall)	C++17	65 / 100	1000 ms	3508 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;
ll Mod = 1e12+9;
//ll Mod = 998244353;

ll MOD(ll a, ll mod=Mod)                   {return (a>=0&&a<mod ? a : ((a%mod+mod)%mod));}
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 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;
}

ll 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)!=MOD(A[i+1], 2)) z = 1;
	if(z || MOD(sum, 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=0; f<=sum; f++) {
			if(MOD(f,2)==MOD(A[1],2) && 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	2 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	456 KB	Output is correct
25	Correct	8 ms	532 KB	Output is correct
26	Correct	9 ms	468 KB	Output is correct
27	Correct	6 ms	468 KB	Output is correct
28	Correct	6 ms	468 KB	Output is correct
29	Correct	7 ms	468 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	8 ms	524 KB	Output is correct
32	Correct	6 ms	452 KB	Output is correct
33	Correct	5 ms	596 KB	Output is correct
34	Correct	5 ms	452 KB	Output is correct
35	Correct	6 ms	484 KB	Output is correct
36	Correct	6 ms	468 KB	Output is correct

Subtask #4
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	2 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	456 KB	Output is correct
25	Correct	8 ms	532 KB	Output is correct
26	Correct	9 ms	468 KB	Output is correct
27	Correct	6 ms	468 KB	Output is correct
28	Correct	6 ms	468 KB	Output is correct
29	Correct	7 ms	468 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	8 ms	524 KB	Output is correct
32	Correct	6 ms	452 KB	Output is correct
33	Correct	5 ms	596 KB	Output is correct
34	Correct	5 ms	452 KB	Output is correct
35	Correct	6 ms	484 KB	Output is correct
36	Correct	6 ms	468 KB	Output is correct
37	Correct	49 ms	876 KB	Output is correct
38	Correct	48 ms	880 KB	Output is correct
39	Correct	43 ms	1236 KB	Output is correct
40	Correct	112 ms	1080 KB	Output is correct
41	Correct	55 ms	1364 KB	Output is correct
42	Correct	96 ms	1040 KB	Output is correct
43	Correct	167 ms	1668 KB	Output is correct
44	Correct	172 ms	1616 KB	Output is correct
45	Correct	171 ms	1584 KB	Output is correct
46	Correct	65 ms	724 KB	Output is correct
47	Correct	103 ms	1096 KB	Output is correct
48	Correct	156 ms	1616 KB	Output is correct
49	Correct	112 ms	1292 KB	Output is correct
50	Correct	103 ms	1092 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	217 ms	1924 KB	Output is correct

Subtask #5
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	2 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	456 KB	Output is correct
25	Correct	8 ms	532 KB	Output is correct
26	Correct	9 ms	468 KB	Output is correct
27	Correct	6 ms	468 KB	Output is correct
28	Correct	6 ms	468 KB	Output is correct
29	Correct	7 ms	468 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	8 ms	524 KB	Output is correct
32	Correct	6 ms	452 KB	Output is correct
33	Correct	5 ms	596 KB	Output is correct
34	Correct	5 ms	452 KB	Output is correct
35	Correct	6 ms	484 KB	Output is correct
36	Correct	6 ms	468 KB	Output is correct
37	Correct	49 ms	876 KB	Output is correct
38	Correct	48 ms	880 KB	Output is correct
39	Correct	43 ms	1236 KB	Output is correct
40	Correct	112 ms	1080 KB	Output is correct
41	Correct	55 ms	1364 KB	Output is correct
42	Correct	96 ms	1040 KB	Output is correct
43	Correct	167 ms	1668 KB	Output is correct
44	Correct	172 ms	1616 KB	Output is correct
45	Correct	171 ms	1584 KB	Output is correct
46	Correct	65 ms	724 KB	Output is correct
47	Correct	103 ms	1096 KB	Output is correct
48	Correct	156 ms	1616 KB	Output is correct
49	Correct	112 ms	1292 KB	Output is correct
50	Correct	103 ms	1092 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	217 ms	1924 KB	Output is correct
53	Correct	173 ms	1416 KB	Output is correct
54	Correct	246 ms	1660 KB	Output is correct
55	Correct	463 ms	2816 KB	Output is correct
56	Correct	216 ms	1700 KB	Output is correct
57	Correct	495 ms	2904 KB	Output is correct
58	Correct	278 ms	1784 KB	Output is correct
59	Correct	341 ms	2220 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	376 ms	2300 KB	Output is correct
62	Correct	382 ms	2580 KB	Output is correct
63	Correct	426 ms	2708 KB	Output is correct
64	Correct	392 ms	2636 KB	Output is correct
65	Correct	50 ms	1064 KB	Output is correct
66	Correct	80 ms	1276 KB	Output is correct

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 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	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	2 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	456 KB	Output is correct
25	Correct	8 ms	532 KB	Output is correct
26	Correct	9 ms	468 KB	Output is correct
27	Correct	6 ms	468 KB	Output is correct
28	Correct	6 ms	468 KB	Output is correct
29	Correct	7 ms	468 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	8 ms	524 KB	Output is correct
32	Correct	6 ms	452 KB	Output is correct
33	Correct	5 ms	596 KB	Output is correct
34	Correct	5 ms	452 KB	Output is correct
35	Correct	6 ms	484 KB	Output is correct
36	Correct	6 ms	468 KB	Output is correct
37	Correct	49 ms	876 KB	Output is correct
38	Correct	48 ms	880 KB	Output is correct
39	Correct	43 ms	1236 KB	Output is correct
40	Correct	112 ms	1080 KB	Output is correct
41	Correct	55 ms	1364 KB	Output is correct
42	Correct	96 ms	1040 KB	Output is correct
43	Correct	167 ms	1668 KB	Output is correct
44	Correct	172 ms	1616 KB	Output is correct
45	Correct	171 ms	1584 KB	Output is correct
46	Correct	65 ms	724 KB	Output is correct
47	Correct	103 ms	1096 KB	Output is correct
48	Correct	156 ms	1616 KB	Output is correct
49	Correct	112 ms	1292 KB	Output is correct
50	Correct	103 ms	1092 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	217 ms	1924 KB	Output is correct
53	Correct	173 ms	1416 KB	Output is correct
54	Correct	246 ms	1660 KB	Output is correct
55	Correct	463 ms	2816 KB	Output is correct
56	Correct	216 ms	1700 KB	Output is correct
57	Correct	495 ms	2904 KB	Output is correct
58	Correct	278 ms	1784 KB	Output is correct
59	Correct	341 ms	2220 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	376 ms	2300 KB	Output is correct
62	Correct	382 ms	2580 KB	Output is correct
63	Correct	426 ms	2708 KB	Output is correct
64	Correct	392 ms	2636 KB	Output is correct
65	Correct	50 ms	1064 KB	Output is correct
66	Correct	80 ms	1276 KB	Output is correct
67	Correct	403 ms	2212 KB	Output is correct
68	Correct	491 ms	2176 KB	Output is correct
69	Execution timed out	1056 ms	3508 KB	Time limit exceeded
70	Halted	0 ms	0 KB	-

답안 #788861

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 16.0 / 16.0

Subtask #5 21.0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
15.0 / 15.0

Subtask #4
16.0 / 16.0

Subtask #5
21.0 / 21.0

Subtask #6
0 / 35.0