oj.uz

Submission #445898

# Submission time Handle Problem Language Result Execution time Memory
445898 2021-07-20T05:49:37 Z aryan12 Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 4684 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2010;
int arr[N];
int n, a, b;

int Check(int val) {
	//cout << "val = " << val << "\n";
	int dp[n + 2][b + 1];
	for(int i = 0; i <= n + 1; i++) {
		for(int j = 0; j <= b; j++) {
			dp[i][j] = 0;
		}
	}
	dp[1][0] = 1;
	for(int i = 1; i <= n; i++) {
		for(int j = 0; j < b; j++) {
			if(dp[i][j] == 0) {
				continue;
			}
			/*if(val == 9) {
				cout << "i = " << i << ", j = " << j << ", dp[i][j] has been deemed true\n";
			}*/
			for(int k = i; k <= n; k++) {
				int tot = arr[k] - arr[i - 1];
				if((val ^ tot) == (val - tot)) {
					dp[k + 1][j + 1] = 1;
					/*if(val == 9) {
						cout << "dp[i][j] goes to dp[" << k + 1 << "][" << j + 1 << "]\n";
					}*/
				}
			}
		}
	}
	/*if(val == 9) {
		for(int i = 1; i <= n + 1; i++) {
			for(int j = 0; j <= b; j++) {
				cout << dp[i][j] << " ";
			}
			cout << "\n";
		}
	}*/
	for(int i = a; i <= b; i++) {
		if(dp[n + 1][i] == 1) {
			return 1;
		}
	}
	return 0;
}

void Solve() {
	cin >> n >> a >> b;
	arr[0] = 0;
	for(int i = 1; i <= n; i++) {
		cin >> arr[i];
		arr[i] += arr[i - 1];
	}
	int ans = (1LL << 40) - 1;
	for(int i = 39; i >= 0; i--) {
		//cout << "i = " << i << "\n";
		//cout << "ans = " << ans << "\n";
		//cout << " ";
		ans ^= (1LL << i);
		if(Check(ans) == 0) {
			ans ^= (1LL << i);
		}
		//cout << "Finally, answer = " << ans << "\n";
	}
	//cout << " ";
	cout << ans << "\n";
}

int32_t main() {
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 2 ms 320 KB Output is correct
22 Correct 2 ms 204 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 2 ms 204 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 7 ms 332 KB Output is correct
28 Correct 11 ms 332 KB Output is correct
29 Correct 10 ms 400 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 9 ms 324 KB Output is correct
32 Correct 10 ms 336 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 2 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 2 ms 204 KB Output is correct
48 Correct 2 ms 204 KB Output is correct
49 Correct 4 ms 332 KB Output is correct
50 Correct 7 ms 332 KB Output is correct
51 Correct 11 ms 332 KB Output is correct
52 Correct 10 ms 400 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 9 ms 360 KB Output is correct
55 Correct 10 ms 332 KB Output is correct
56 Correct 2 ms 204 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 3 ms 332 KB Output is correct
59 Correct 4 ms 332 KB Output is correct
60 Correct 4 ms 332 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 4 ms 332 KB Output is correct
63 Correct 6 ms 316 KB Output is correct
64 Correct 9 ms 384 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 2 ms 332 KB Output is correct
68 Correct 3 ms 332 KB Output is correct
69 Correct 4 ms 332 KB Output is correct
70 Correct 6 ms 332 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 5 ms 332 KB Output is correct
73 Correct 5 ms 332 KB Output is correct
74 Correct 5 ms 332 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 2 ms 204 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 2 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 2 ms 232 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 2 ms 204 KB Output is correct
36 Correct 3 ms 332 KB Output is correct
37 Correct 7 ms 332 KB Output is correct
38 Correct 11 ms 332 KB Output is correct
39 Correct 10 ms 392 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 9 ms 352 KB Output is correct
42 Correct 10 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 2 ms 328 KB Output is correct
45 Correct 3 ms 332 KB Output is correct
46 Correct 4 ms 332 KB Output is correct
47 Correct 4 ms 332 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 5 ms 332 KB Output is correct
50 Correct 5 ms 404 KB Output is correct
51 Correct 3 ms 332 KB Output is correct
52 Correct 308 ms 752 KB Output is correct
53 Execution timed out 1085 ms 4684 KB Time limit exceeded
54 Halted 0 ms 0 KB -