답안 #788869

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788869	2023-07-20T16:59:03 Z	vjudge1	Bootfall (IZhO17_bootfall)	C++17	28 / 100	179 ms	1232 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 = 1e8+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

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

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	6 ms	352 KB	Output is correct
25	Correct	8 ms	468 KB	Output is correct
26	Correct	10 ms	404 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	340 KB	Output is correct
29	Correct	7 ms	412 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	468 KB	Output is correct
32	Correct	6 ms	356 KB	Output is correct
33	Correct	4 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	7 ms	340 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	720 KB	Output is correct
38	Correct	54 ms	720 KB	Output is correct
39	Correct	43 ms	724 KB	Output is correct
40	Correct	123 ms	824 KB	Output is correct
41	Correct	77 ms	880 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	169 ms	1232 KB	Output is correct
44	Correct	171 ms	1140 KB	Output is correct
45	Correct	179 ms	1232 KB	Output is correct
46	Correct	65 ms	460 KB	Output is correct
47	Correct	103 ms	828 KB	Output is correct
48	Correct	154 ms	1176 KB	Output is correct
49	Correct	109 ms	920 KB	Output is correct
50	Incorrect	104 ms	824 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	6 ms	352 KB	Output is correct
25	Correct	8 ms	468 KB	Output is correct
26	Correct	10 ms	404 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	340 KB	Output is correct
29	Correct	7 ms	412 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	468 KB	Output is correct
32	Correct	6 ms	356 KB	Output is correct
33	Correct	4 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	7 ms	340 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	720 KB	Output is correct
38	Correct	54 ms	720 KB	Output is correct
39	Correct	43 ms	724 KB	Output is correct
40	Correct	123 ms	824 KB	Output is correct
41	Correct	77 ms	880 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	169 ms	1232 KB	Output is correct
44	Correct	171 ms	1140 KB	Output is correct
45	Correct	179 ms	1232 KB	Output is correct
46	Correct	65 ms	460 KB	Output is correct
47	Correct	103 ms	828 KB	Output is correct
48	Correct	154 ms	1176 KB	Output is correct
49	Correct	109 ms	920 KB	Output is correct
50	Incorrect	104 ms	824 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 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	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	4 ms	340 KB	Output is correct
23	Correct	2 ms	340 KB	Output is correct
24	Correct	6 ms	352 KB	Output is correct
25	Correct	8 ms	468 KB	Output is correct
26	Correct	10 ms	404 KB	Output is correct
27	Correct	6 ms	340 KB	Output is correct
28	Correct	6 ms	340 KB	Output is correct
29	Correct	7 ms	412 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	9 ms	468 KB	Output is correct
32	Correct	6 ms	356 KB	Output is correct
33	Correct	4 ms	340 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	7 ms	340 KB	Output is correct
36	Correct	6 ms	340 KB	Output is correct
37	Correct	48 ms	720 KB	Output is correct
38	Correct	54 ms	720 KB	Output is correct
39	Correct	43 ms	724 KB	Output is correct
40	Correct	123 ms	824 KB	Output is correct
41	Correct	77 ms	880 KB	Output is correct
42	Correct	95 ms	800 KB	Output is correct
43	Correct	169 ms	1232 KB	Output is correct
44	Correct	171 ms	1140 KB	Output is correct
45	Correct	179 ms	1232 KB	Output is correct
46	Correct	65 ms	460 KB	Output is correct
47	Correct	103 ms	828 KB	Output is correct
48	Correct	154 ms	1176 KB	Output is correct
49	Correct	109 ms	920 KB	Output is correct
50	Incorrect	104 ms	824 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

답안 #788869

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 16.0

Subtask #5 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
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0