oj.uz

Submission #766805

# Submission time Handle Problem Language Result Execution time Memory
766805 2023-06-26T07:40:34 Z vito Bali Sculptures (APIO15_sculpture) C++
9 / 100
 1000 ms 16076 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MAX1=101;
const int MAX2=2001;
const int INF=1e9+5;
int dp1[MAX1];
int dp2[MAX2][MAX2];
vector<int> a(MAX2);
int n, A, B, nas;
ll t=(1LL<<43)-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=42; ~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=42; ~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 4 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 276 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 134 ms 212 KB Output is correct
14 Correct 36 ms 15956 KB Output is correct
15 Correct 36 ms 15956 KB Output is correct
16 Correct 35 ms 15996 KB Output is correct
17 Correct 37 ms 15956 KB Output is correct
18 Correct 43 ms 15956 KB Output is correct
19 Correct 37 ms 15956 KB Output is correct
20 Correct 35 ms 15996 KB Output is correct
21 Correct 35 ms 15956 KB Output is correct
22 Correct 37 ms 15896 KB Output is correct
23 Correct 37 ms 15952 KB Output is correct
24 Correct 38 ms 15936 KB Output is correct
25 Correct 36 ms 15956 KB Output is correct
26 Correct 36 ms 16000 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 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 9 ms 336 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 57 ms 212 KB Output is correct
34 Correct 51 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 84 ms 312 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 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 134 ms 316 KB Output is correct
14 Correct 38 ms 15996 KB Output is correct
15 Correct 36 ms 15956 KB Output is correct
16 Correct 37 ms 15912 KB Output is correct
17 Correct 35 ms 15980 KB Output is correct
18 Correct 38 ms 15972 KB Output is correct
19 Correct 38 ms 15924 KB Output is correct
20 Correct 39 ms 16076 KB Output is correct
21 Correct 36 ms 15956 KB Output is correct
22 Correct 36 ms 15956 KB Output is correct
23 Correct 38 ms 15956 KB Output is correct
24 Correct 37 ms 15992 KB Output is correct
25 Correct 37 ms 15956 KB Output is correct
26 Correct 36 ms 15956 KB Output is correct
27 Correct 254 ms 212 KB Output is correct
28 Execution timed out 1071 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 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 134 ms 212 KB Output is correct
14 Correct 259 ms 212 KB Output is correct
15 Execution timed out 1086 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 4 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 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 133 ms 312 KB Output is correct
14 Correct 35 ms 15956 KB Output is correct
15 Correct 39 ms 15956 KB Output is correct
16 Correct 38 ms 15972 KB Output is correct
17 Correct 38 ms 15980 KB Output is correct
18 Correct 38 ms 15908 KB Output is correct
19 Correct 39 ms 15996 KB Output is correct
20 Correct 45 ms 16052 KB Output is correct
21 Correct 37 ms 15956 KB Output is correct
22 Correct 35 ms 15956 KB Output is correct
23 Correct 34 ms 15956 KB Output is correct
24 Correct 36 ms 15996 KB Output is correct
25 Correct 36 ms 15976 KB Output is correct
26 Correct 36 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 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 8 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 56 ms 212 KB Output is correct
34 Correct 50 ms 316 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 85 ms 308 KB Output is correct
37 Correct 259 ms 312 KB Output is correct
38 Execution timed out 1084 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 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 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 133 ms 312 KB Output is correct
14 Correct 0 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 9 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 55 ms 316 KB Output is correct
21 Correct 51 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 84 ms 212 KB Output is correct
24 Correct 255 ms 212 KB Output is correct
25 Execution timed out 1086 ms 212 KB Time limit exceeded
26 Halted 0 ms 0 KB -