oj.uz

Submission #766801

# Submission time Handle Problem Language Result Execution time Memory
766801 2023-06-26T07:37:31 Z vito Bali Sculptures (APIO15_sculpture) C++
9 / 100
 1000 ms 16048 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MAX1=105;
const int MAX2=2005;
const int INF=1e9+5;
int dp1[MAX1];
int dp2[MAX2][MAX2];
vector<int> a(MAX2);
int n, A, B, nas;
ll t=(1LL<<50)-1;
int ok;
void rek1(int i, int sof) {
	if(sof==B+1) {
		return;
	}
	if(i==n) {
		ok=1;
		return;
	} 
	ll sum=0;
	for(int j=i; j<n; j++) {
		sum+=a[j];
		if((sum|t)==t) {
			dp1[j]=min(dp1[j], 1+(i?dp1[i-1]:0));
			rek1(j+1, sof+1);
		}
	}
}
void rek2(int i, int sof) {
	dp2[i][sof]=1;
	if(sof==B+1) {
		return;
	}
	if(i==n && sof>=A) {
		ok=1;
		return;
	}
	ll sum=0;
	for(int j=i; j<n; j++) {
		sum+=a[j];
		if((sum|t)==t) {
			if(dp2[j+1][sof+1]) {
				continue;
			}
			rek2(j+1, sof+1);
		}
	}
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> A >> B;
	for(int i=0; i<n; i++) {
		cin >> a[i];
	}
	if(A==1) {
		for(int i=49; ~i; i--) {
			t^=(1LL<<i);
			for(int j=0; j<MAX1; j++) {
				dp1[j]=INF;
			}
			ok=0;
			rek1(0, 0);
			if(ok==0) {
				t^=(1LL<<i);
			}
		}
		cout << t << '\n';
		return 0;
	}
	for(int i=49; ~i; i--) {
		t^=(1LL<<i);
		for(int j=0; j<MAX2; j++) {
			for(int k=0; k<MAX2; k++) {
				dp2[j][k]=0;
			}
		}
		ok=0;
		rek2(0, 0);
		if(ok==0) {
			t^=(1LL<<i);
		}
	}
	cout << t << '\n';
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 212 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 160 ms 212 KB Output is correct
14 Correct 46 ms 16044 KB Output is correct
15 Correct 42 ms 15956 KB Output is correct
16 Correct 48 ms 16040 KB Output is correct
17 Correct 42 ms 15956 KB Output is correct
18 Correct 42 ms 15956 KB Output is correct
19 Correct 40 ms 15956 KB Output is correct
20 Correct 40 ms 15956 KB Output is correct
21 Correct 41 ms 16016 KB Output is correct
22 Correct 49 ms 15956 KB Output is correct
23 Correct 48 ms 15956 KB Output is correct
24 Correct 42 ms 15956 KB Output is correct
25 Correct 44 ms 15956 KB Output is correct
26 Correct 42 ms 15956 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 14 ms 332 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 80 ms 212 KB Output is correct
34 Correct 78 ms 316 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 107 ms 308 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 212 KB Output is correct
7 Correct 1 ms 340 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 163 ms 316 KB Output is correct
14 Correct 40 ms 16040 KB Output is correct
15 Correct 41 ms 15956 KB Output is correct
16 Correct 39 ms 16024 KB Output is correct
17 Correct 44 ms 15956 KB Output is correct
18 Correct 43 ms 15988 KB Output is correct
19 Correct 42 ms 15956 KB Output is correct
20 Correct 43 ms 15956 KB Output is correct
21 Correct 47 ms 16040 KB Output is correct
22 Correct 43 ms 16044 KB Output is correct
23 Correct 42 ms 16040 KB Output is correct
24 Correct 40 ms 15956 KB Output is correct
25 Correct 42 ms 16008 KB Output is correct
26 Correct 44 ms 15956 KB Output is correct
27 Correct 303 ms 308 KB Output is correct
28 Execution timed out 1078 ms 212 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 212 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 158 ms 308 KB Output is correct
14 Correct 301 ms 308 KB Output is correct
15 Execution timed out 1075 ms 212 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 5 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 155 ms 212 KB Output is correct
14 Correct 42 ms 15956 KB Output is correct
15 Correct 42 ms 15956 KB Output is correct
16 Correct 42 ms 16044 KB Output is correct
17 Correct 42 ms 16036 KB Output is correct
18 Correct 41 ms 15956 KB Output is correct
19 Correct 48 ms 16044 KB Output is correct
20 Correct 42 ms 15956 KB Output is correct
21 Correct 43 ms 16048 KB Output is correct
22 Correct 43 ms 15956 KB Output is correct
23 Correct 42 ms 15956 KB Output is correct
24 Correct 43 ms 15956 KB Output is correct
25 Correct 40 ms 15956 KB Output is correct
26 Correct 42 ms 15956 KB Output is correct
27 Correct 4 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 14 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 80 ms 212 KB Output is correct
34 Correct 72 ms 316 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 107 ms 308 KB Output is correct
37 Correct 303 ms 212 KB Output is correct
38 Execution timed out 1075 ms 212 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 157 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 14 ms 328 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 82 ms 212 KB Output is correct
21 Correct 73 ms 312 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 107 ms 308 KB Output is correct
24 Correct 314 ms 212 KB Output is correct
25 Execution timed out 1086 ms 212 KB Time limit exceeded
26 Halted 0 ms 0 KB -