oj.uz

Submission #697020

# Submission time Handle Problem Language Result Execution time Memory
697020 2023-02-07T23:06:38 Z allllekssssa Bootfall (IZhO17_bootfall) C++14
65 / 100
 1000 ms 18260 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
const int maxN = 500 + 2;
const int bsSize = maxN * maxN + 10;
const int limit = 16900;
int n;
int a[maxN];
int cnt[maxN];
bitset<bsSize> dp[2][maxN], pre;
bitset<limit> dp1[2][maxN], pre1;
 
int main() {
 
    cin >> n;
  
	int sum = 0;
    int gc = 0;
	for (int i = 1; i<=n; i++) {
	    cin >> a[i];
		gc = __gcd(a[i], gc);
	}
 
	for (int i = 1; i<=n; i++) {
		a[i]/=gc;
		if ((a[i] & 1) == 0) {
			printf("0\n");
			return 0;
		}
		if (cnt[a[i]] == 0) cnt[a[i]] = i;
		sum+=a[i];
	}
     
	for (int i = 1; i <= n + 1; i++) {
		dp[0][i].set(0);
		dp1[0][i].set(0);
	}
 
	for (int i = 1; i<=n; i++) {
		bool updated = false;
		for (int j = 1; j <= n + 1; j++) {
			if (j<= n && cnt[a[j]] != j) continue;
			if (sum < limit) {
			if (i == j) {
				dp1[i&1][j] = dp1[(i&1) ^ 1][j];
			} else {
					if (updated) {
						dp1[i&1][j] = pre1;
					} else {
					dp1[i&1][j] = dp1[(i&1) ^ 1][j] | (dp1[(i&1) ^ 1][j] << a[i]);
					if (i < j && !updated) {
			   			pre1 = dp1[i&1][j];
			   			updated = true;
			   	    }
			   	}
			 }
 
			} else {
			
			if (i == j) {
				dp[i&1][j] = dp[(i&1) ^ 1][j];
			} else {
					if (updated) {
						dp[i&1][j] = pre;
					} else {
					dp[i&1][j] = dp[(i&1) ^ 1][j] | (dp[(i&1) ^ 1][j] << a[i]);
					if (i < j && !updated) {
			   			pre = dp[i&1][j];
			   			updated = true;
			   	    }
			   	}
			 }
		  }
		}
	}
    
    if (sum & 1) {
    	printf("0\n");
    	return 0;    	
    }
 
	if ((sum >= limit && dp[n&1][n + 1][sum/2] == 0) || (sum < limit && dp1[n&1][n + 1][sum/2] == 0)) {
		printf("0\n");
		return 0;
	}
 
    vector<int> ans;
 
	for (int i = 1; i <= sum; i+=2) {
		bool ok = true;
         
        for (int j = 1; j<= n; j++) {
        	if (cnt[a[j]] != j) continue;
        	int totSum = sum  - a[j] + i;
        	if (totSum % 2 == 1) ok = false;
        	if ((sum>= limit && dp[n&1][j][totSum/2] == 0) || (sum < limit && dp1[n&1][j][totSum/2] == 0)) ok = false;
        }
 
		if (ok) ans.push_back(i);
	}
 
	cout << ans.size() << endl;
 
	for (int i:ans) {
		printf("%d ", i * gc);
	}
 
	cout << endl;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 4 ms 1108 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 89 ms 4676 KB Output is correct
38 Correct 83 ms 4840 KB Output is correct
39 Correct 1 ms 1876 KB Output is correct
40 Correct 325 ms 10248 KB Output is correct
41 Correct 1 ms 2004 KB Output is correct
42 Correct 226 ms 8748 KB Output is correct
43 Correct 62 ms 3844 KB Output is correct
44 Correct 70 ms 3864 KB Output is correct
45 Correct 62 ms 3900 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 216 ms 8640 KB Output is correct
48 Correct 22 ms 2508 KB Output is correct
49 Correct 16 ms 2244 KB Output is correct
50 Correct 233 ms 9504 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 38 ms 3184 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 4 ms 1108 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 89 ms 4676 KB Output is correct
38 Correct 83 ms 4840 KB Output is correct
39 Correct 1 ms 1876 KB Output is correct
40 Correct 325 ms 10248 KB Output is correct
41 Correct 1 ms 2004 KB Output is correct
42 Correct 226 ms 8748 KB Output is correct
43 Correct 62 ms 3844 KB Output is correct
44 Correct 70 ms 3864 KB Output is correct
45 Correct 62 ms 3900 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 216 ms 8640 KB Output is correct
48 Correct 22 ms 2508 KB Output is correct
49 Correct 16 ms 2244 KB Output is correct
50 Correct 233 ms 9504 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 38 ms 3184 KB Output is correct
53 Correct 274 ms 9452 KB Output is correct
54 Correct 350 ms 10076 KB Output is correct
55 Correct 68 ms 3932 KB Output is correct
56 Correct 402 ms 10532 KB Output is correct
57 Correct 73 ms 4192 KB Output is correct
58 Correct 568 ms 13416 KB Output is correct
59 Correct 307 ms 8820 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 284 ms 8964 KB Output is correct
62 Correct 175 ms 5944 KB Output is correct
63 Correct 126 ms 4504 KB Output is correct
64 Correct 90 ms 4400 KB Output is correct
65 Correct 3 ms 2260 KB Output is correct
66 Correct 12 ms 2420 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 1 ms 724 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 4 ms 1108 KB Output is correct
33 Correct 1 ms 980 KB Output is correct
34 Correct 1 ms 980 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 3 ms 1108 KB Output is correct
37 Correct 89 ms 4676 KB Output is correct
38 Correct 83 ms 4840 KB Output is correct
39 Correct 1 ms 1876 KB Output is correct
40 Correct 325 ms 10248 KB Output is correct
41 Correct 1 ms 2004 KB Output is correct
42 Correct 226 ms 8748 KB Output is correct
43 Correct 62 ms 3844 KB Output is correct
44 Correct 70 ms 3864 KB Output is correct
45 Correct 62 ms 3900 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 216 ms 8640 KB Output is correct
48 Correct 22 ms 2508 KB Output is correct
49 Correct 16 ms 2244 KB Output is correct
50 Correct 233 ms 9504 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 38 ms 3184 KB Output is correct
53 Correct 274 ms 9452 KB Output is correct
54 Correct 350 ms 10076 KB Output is correct
55 Correct 68 ms 3932 KB Output is correct
56 Correct 402 ms 10532 KB Output is correct
57 Correct 73 ms 4192 KB Output is correct
58 Correct 568 ms 13416 KB Output is correct
59 Correct 307 ms 8820 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 284 ms 8964 KB Output is correct
62 Correct 175 ms 5944 KB Output is correct
63 Correct 126 ms 4504 KB Output is correct
64 Correct 90 ms 4400 KB Output is correct
65 Correct 3 ms 2260 KB Output is correct
66 Correct 12 ms 2420 KB Output is correct
67 Correct 641 ms 15752 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 193 ms 6212 KB Output is correct
70 Execution timed out 1088 ms 18260 KB Time limit exceeded
71 Halted 0 ms 0 KB -