답안 #766959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766959	2023-06-26T09:37:00 Z	vito	Bali Sculptures (APIO15_sculpture)	C++	9 / 100	1000 ms	340 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int MAX1=2005;
const int MAX2=105;
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;
int rek1(int i) {
	if(i==n) {
		return 0;
	}
	ll sum=0;
	for(int j=i; j<n; j++) {
		sum+=a[j];
		if((sum|t)==t) {
			dp1[i]=min(dp1[i], 1+rek1(j+1));
		}
	}
	return dp1[i];
}
void rek2(int i, int sof) {
	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;
			}
			dp2[j+1][sof+1]=1;
			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;
			dp1[n]=0;
			if(rek1(0)>B) {
				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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	320 KB	Output is correct
6	Correct	4 ms	212 KB	Output is correct
7	Correct	14 ms	336 KB	Output is correct
8	Correct	107 ms	312 KB	Output is correct
9	Correct	119 ms	324 KB	Output is correct
10	Correct	131 ms	212 KB	Output is correct
11	Correct	106 ms	312 KB	Output is correct
12	Correct	108 ms	212 KB	Output is correct
13	Correct	114 ms	308 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 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	16 ms	212 KB	Output is correct
31	Correct	31 ms	212 KB	Output is correct
32	Correct	31 ms	316 KB	Output is correct
33	Correct	45 ms	212 KB	Output is correct
34	Correct	43 ms	324 KB	Output is correct
35	Correct	71 ms	212 KB	Output is correct
36	Correct	72 ms	212 KB	Output is correct

Subtask #2
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	5 ms	320 KB	Output is correct
7	Correct	14 ms	332 KB	Output is correct
8	Correct	116 ms	324 KB	Output is correct
9	Correct	107 ms	308 KB	Output is correct
10	Correct	106 ms	212 KB	Output is correct
11	Correct	107 ms	312 KB	Output is correct
12	Correct	111 ms	308 KB	Output is correct
13	Correct	108 ms	312 KB	Output is correct
14	Correct	1 ms	324 KB	Output is correct
15	Correct	1 ms	324 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	215 ms	316 KB	Output is correct
28	Execution timed out	1082 ms	328 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	4 ms	320 KB	Output is correct
7	Correct	17 ms	332 KB	Output is correct
8	Correct	107 ms	328 KB	Output is correct
9	Correct	109 ms	312 KB	Output is correct
10	Correct	106 ms	316 KB	Output is correct
11	Correct	126 ms	308 KB	Output is correct
12	Correct	108 ms	312 KB	Output is correct
13	Correct	113 ms	312 KB	Output is correct
14	Correct	224 ms	308 KB	Output is correct
15	Execution timed out	1081 ms	320 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	4 ms	324 KB	Output is correct
7	Correct	14 ms	328 KB	Output is correct
8	Correct	108 ms	212 KB	Output is correct
9	Correct	114 ms	320 KB	Output is correct
10	Correct	107 ms	312 KB	Output is correct
11	Correct	122 ms	308 KB	Output is correct
12	Correct	109 ms	312 KB	Output is correct
13	Correct	108 ms	320 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	320 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	324 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	17 ms	340 KB	Output is correct
31	Correct	30 ms	336 KB	Output is correct
32	Correct	31 ms	324 KB	Output is correct
33	Correct	45 ms	328 KB	Output is correct
34	Correct	43 ms	328 KB	Output is correct
35	Correct	72 ms	324 KB	Output is correct
36	Correct	71 ms	212 KB	Output is correct
37	Correct	215 ms	312 KB	Output is correct
38	Execution timed out	1087 ms	212 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	4 ms	212 KB	Output is correct
7	Correct	14 ms	324 KB	Output is correct
8	Correct	107 ms	316 KB	Output is correct
9	Correct	112 ms	324 KB	Output is correct
10	Correct	109 ms	308 KB	Output is correct
11	Correct	110 ms	308 KB	Output is correct
12	Correct	112 ms	308 KB	Output is correct
13	Correct	112 ms	324 KB	Output is correct
14	Correct	1 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	18 ms	332 KB	Output is correct
18	Correct	31 ms	212 KB	Output is correct
19	Correct	31 ms	212 KB	Output is correct
20	Correct	46 ms	308 KB	Output is correct
21	Correct	42 ms	212 KB	Output is correct
22	Correct	71 ms	328 KB	Output is correct
23	Correct	71 ms	212 KB	Output is correct
24	Correct	214 ms	308 KB	Output is correct
25	Execution timed out	1081 ms	212 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

답안 #766959

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0