oj.uz

Submission #788883

# Submission time Handle Problem Language Result Execution time Memory
788883 2023-07-20T17:03:14 Z vjudge1 Bootfall (IZhO17_bootfall) C++17
65 / 100
 878 ms 4264 KB 
/*
    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], tmp[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++) {
			tmp[j] = dp[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] = tmp[j];
	}

	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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 304 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 304 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 2 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 468 KB Output is correct
26 Correct 7 ms 432 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 436 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 4 ms 440 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 304 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 2 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 468 KB Output is correct
26 Correct 7 ms 432 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 436 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 4 ms 440 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 808 KB Output is correct
38 Correct 33 ms 792 KB Output is correct
39 Correct 38 ms 952 KB Output is correct
40 Correct 73 ms 956 KB Output is correct
41 Correct 48 ms 1156 KB Output is correct
42 Correct 62 ms 916 KB Output is correct
43 Correct 112 ms 1408 KB Output is correct
44 Correct 112 ms 1356 KB Output is correct
45 Correct 116 ms 1356 KB Output is correct
46 Correct 46 ms 676 KB Output is correct
47 Correct 68 ms 952 KB Output is correct
48 Correct 102 ms 1320 KB Output is correct
49 Correct 76 ms 1152 KB Output is correct
50 Correct 68 ms 944 KB Output is correct
51 Correct 1 ms 312 KB Output is correct
52 Correct 143 ms 1608 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 304 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 2 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 468 KB Output is correct
26 Correct 7 ms 432 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 436 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 4 ms 440 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 808 KB Output is correct
38 Correct 33 ms 792 KB Output is correct
39 Correct 38 ms 952 KB Output is correct
40 Correct 73 ms 956 KB Output is correct
41 Correct 48 ms 1156 KB Output is correct
42 Correct 62 ms 916 KB Output is correct
43 Correct 112 ms 1408 KB Output is correct
44 Correct 112 ms 1356 KB Output is correct
45 Correct 116 ms 1356 KB Output is correct
46 Correct 46 ms 676 KB Output is correct
47 Correct 68 ms 952 KB Output is correct
48 Correct 102 ms 1320 KB Output is correct
49 Correct 76 ms 1152 KB Output is correct
50 Correct 68 ms 944 KB Output is correct
51 Correct 1 ms 312 KB Output is correct
52 Correct 143 ms 1608 KB Output is correct
53 Correct 130 ms 1220 KB Output is correct
54 Correct 166 ms 1468 KB Output is correct
55 Correct 305 ms 2372 KB Output is correct
56 Correct 143 ms 1420 KB Output is correct
57 Correct 330 ms 2432 KB Output is correct
58 Correct 197 ms 1560 KB Output is correct
59 Correct 222 ms 1748 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 255 ms 1952 KB Output is correct
62 Correct 254 ms 2076 KB Output is correct
63 Correct 276 ms 2276 KB Output is correct
64 Correct 261 ms 2256 KB Output is correct
65 Correct 40 ms 852 KB Output is correct
66 Correct 59 ms 1060 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 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 1 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 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 1 ms 304 KB Output is correct
16 Correct 0 ms 224 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 304 KB Output is correct
22 Correct 2 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 468 KB Output is correct
26 Correct 7 ms 432 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 4 ms 436 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 1 ms 312 KB Output is correct
31 Correct 6 ms 432 KB Output is correct
32 Correct 4 ms 440 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 3 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct
37 Correct 32 ms 808 KB Output is correct
38 Correct 33 ms 792 KB Output is correct
39 Correct 38 ms 952 KB Output is correct
40 Correct 73 ms 956 KB Output is correct
41 Correct 48 ms 1156 KB Output is correct
42 Correct 62 ms 916 KB Output is correct
43 Correct 112 ms 1408 KB Output is correct
44 Correct 112 ms 1356 KB Output is correct
45 Correct 116 ms 1356 KB Output is correct
46 Correct 46 ms 676 KB Output is correct
47 Correct 68 ms 952 KB Output is correct
48 Correct 102 ms 1320 KB Output is correct
49 Correct 76 ms 1152 KB Output is correct
50 Correct 68 ms 944 KB Output is correct
51 Correct 1 ms 312 KB Output is correct
52 Correct 143 ms 1608 KB Output is correct
53 Correct 130 ms 1220 KB Output is correct
54 Correct 166 ms 1468 KB Output is correct
55 Correct 305 ms 2372 KB Output is correct
56 Correct 143 ms 1420 KB Output is correct
57 Correct 330 ms 2432 KB Output is correct
58 Correct 197 ms 1560 KB Output is correct
59 Correct 222 ms 1748 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 255 ms 1952 KB Output is correct
62 Correct 254 ms 2076 KB Output is correct
63 Correct 276 ms 2276 KB Output is correct
64 Correct 261 ms 2256 KB Output is correct
65 Correct 40 ms 852 KB Output is correct
66 Correct 59 ms 1060 KB Output is correct
67 Correct 254 ms 1900 KB Output is correct
68 Correct 339 ms 1692 KB Output is correct
69 Incorrect 878 ms 4264 KB Output isn't correct
70 Halted 0 ms 0 KB -