Submission #68753

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68753	2018-08-18T10:29:30 Z	FedericoS	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	234 ms	1528 KB

sculpture

#include <iostream>
using namespace std;
typedef long long int ll;

ll INF=1e18;
ll P=60;
int N,A,B;
ll Y[2005];
ll V[2005];
ll ans,res;
bool M[2005][2005];
bool flag;

int main(){

	cin>>N>>A>>B;
	for(int i=0;i<N;i++)
		cin>>Y[i];

	if(A==1){

		ans=(1LL<<P)-1;

		for(int c=P-1;c>=0;c--){

			ans=ans^(1LL<<c);

			fill(V,V+N,INF);

			for(int i=N-1;i>=0;i--){
				res=0;
				for(int j=i;j<N;j++){
					res+=Y[j];
					if((res|ans)==ans)
						V[i]=min(V[i],V[j+1]+1);
				}

			}

			if(V[0]==INF or V[0]>B)
				ans=ans^(1LL<<c);

			//for(int i=0;i<N+1;i++)cout<<(V[i]==INF?-1:V[i])<<" ";cout<<endl;

		}

		cout<<ans;
			
	}
	else{

		M[0][N]=true;

		ans=(1LL<<P)-1;

		for(int c=P-1;c>=0;c--){

			ans=ans^(1LL<<c);

			for(int k=1;k<N;k++){

				fill(M[k],M[k]+N,false);

				for(int i=N-1;i>=0;i--){
					res=0;
					for(int j=i;j<N;j++){
						res+=Y[j];
						if((res|ans)==ans)
							M[k][i]=M[k][i]|M[k-1][j+1];
					}

				}
				
			}

			flag=false;
			for(int k=A;k<=B;k++)
				if(M[k][0])
					flag=true;

			if(!flag)
				ans=ans^(1LL<<c);

			//for(int i=0;i<N+1;i++)cout<<(V[i]==INF?-1:V[i])<<" ";cout<<endl;

		}

		cout<<ans;

	}

}
/*
6 1 3
8 1 2 1 5 4
*/

Subtask #1
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	492 KB	Output is correct
3	Correct	3 ms	628 KB	Output is correct
4	Correct	2 ms	628 KB	Output is correct
5	Correct	2 ms	628 KB	Output is correct
6	Correct	2 ms	628 KB	Output is correct
7	Correct	2 ms	652 KB	Output is correct
8	Correct	2 ms	652 KB	Output is correct
9	Correct	3 ms	652 KB	Output is correct
10	Correct	2 ms	652 KB	Output is correct
11	Correct	2 ms	712 KB	Output is correct
12	Correct	2 ms	712 KB	Output is correct
13	Correct	2 ms	712 KB	Output is correct
14	Correct	2 ms	752 KB	Output is correct
15	Incorrect	2 ms	752 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	752 KB	Output is correct
2	Correct	2 ms	752 KB	Output is correct
3	Correct	2 ms	752 KB	Output is correct
4	Correct	2 ms	752 KB	Output is correct
5	Correct	2 ms	752 KB	Output is correct
6	Correct	2 ms	752 KB	Output is correct
7	Correct	2 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	2 ms	752 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct
11	Correct	2 ms	752 KB	Output is correct
12	Correct	2 ms	752 KB	Output is correct
13	Correct	2 ms	752 KB	Output is correct
14	Correct	2 ms	752 KB	Output is correct
15	Incorrect	2 ms	752 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	756 KB	Output is correct
2	Correct	2 ms	764 KB	Output is correct
3	Correct	2 ms	888 KB	Output is correct
4	Correct	2 ms	888 KB	Output is correct
5	Correct	2 ms	888 KB	Output is correct
6	Correct	2 ms	888 KB	Output is correct
7	Correct	3 ms	896 KB	Output is correct
8	Correct	2 ms	896 KB	Output is correct
9	Correct	2 ms	896 KB	Output is correct
10	Correct	2 ms	896 KB	Output is correct
11	Correct	2 ms	896 KB	Output is correct
12	Correct	2 ms	896 KB	Output is correct
13	Correct	2 ms	896 KB	Output is correct
14	Correct	2 ms	896 KB	Output is correct
15	Correct	2 ms	928 KB	Output is correct
16	Correct	2 ms	928 KB	Output is correct
17	Correct	2 ms	928 KB	Output is correct
18	Correct	2 ms	928 KB	Output is correct
19	Correct	2 ms	952 KB	Output is correct
20	Correct	3 ms	952 KB	Output is correct
21	Correct	2 ms	956 KB	Output is correct
22	Correct	2 ms	960 KB	Output is correct
23	Correct	2 ms	960 KB	Output is correct
24	Correct	2 ms	960 KB	Output is correct
25	Correct	3 ms	960 KB	Output is correct
26	Correct	3 ms	960 KB	Output is correct
27	Correct	3 ms	960 KB	Output is correct
28	Correct	3 ms	960 KB	Output is correct
29	Correct	3 ms	960 KB	Output is correct
30	Correct	3 ms	960 KB	Output is correct
31	Correct	3 ms	960 KB	Output is correct
32	Correct	3 ms	960 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	960 KB	Output is correct
2	Correct	2 ms	960 KB	Output is correct
3	Correct	2 ms	960 KB	Output is correct
4	Correct	2 ms	960 KB	Output is correct
5	Correct	2 ms	960 KB	Output is correct
6	Correct	3 ms	960 KB	Output is correct
7	Correct	3 ms	960 KB	Output is correct
8	Correct	2 ms	960 KB	Output is correct
9	Correct	2 ms	960 KB	Output is correct
10	Correct	2 ms	960 KB	Output is correct
11	Correct	2 ms	960 KB	Output is correct
12	Correct	2 ms	960 KB	Output is correct
13	Correct	2 ms	960 KB	Output is correct
14	Correct	2 ms	960 KB	Output is correct
15	Incorrect	2 ms	960 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5
29.0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	960 KB	Output is correct
2	Correct	2 ms	960 KB	Output is correct
3	Correct	2 ms	960 KB	Output is correct
4	Correct	2 ms	1080 KB	Output is correct
5	Correct	2 ms	1080 KB	Output is correct
6	Correct	2 ms	1080 KB	Output is correct
7	Correct	2 ms	1080 KB	Output is correct
8	Correct	2 ms	1080 KB	Output is correct
9	Correct	2 ms	1080 KB	Output is correct
10	Correct	3 ms	1080 KB	Output is correct
11	Correct	2 ms	1080 KB	Output is correct
12	Correct	2 ms	1080 KB	Output is correct
13	Correct	2 ms	1080 KB	Output is correct
14	Correct	2 ms	1080 KB	Output is correct
15	Correct	2 ms	1080 KB	Output is correct
16	Correct	2 ms	1080 KB	Output is correct
17	Correct	2 ms	1080 KB	Output is correct
18	Correct	2 ms	1080 KB	Output is correct
19	Correct	2 ms	1080 KB	Output is correct
20	Correct	2 ms	1080 KB	Output is correct
21	Correct	2 ms	1080 KB	Output is correct
22	Correct	2 ms	1080 KB	Output is correct
23	Correct	2 ms	1080 KB	Output is correct
24	Correct	2 ms	1080 KB	Output is correct
25	Correct	3 ms	1080 KB	Output is correct
26	Correct	2 ms	1080 KB	Output is correct
27	Correct	2 ms	1080 KB	Output is correct
28	Correct	2 ms	1080 KB	Output is correct
29	Correct	2 ms	1080 KB	Output is correct
30	Correct	2 ms	1080 KB	Output is correct
31	Correct	2 ms	1080 KB	Output is correct
32	Correct	3 ms	1080 KB	Output is correct
33	Correct	2 ms	1080 KB	Output is correct
34	Correct	2 ms	1080 KB	Output is correct
35	Correct	3 ms	1192 KB	Output is correct
36	Correct	3 ms	1192 KB	Output is correct
37	Correct	3 ms	1192 KB	Output is correct
38	Correct	3 ms	1192 KB	Output is correct
39	Correct	3 ms	1192 KB	Output is correct
40	Correct	3 ms	1192 KB	Output is correct
41	Correct	3 ms	1192 KB	Output is correct
42	Correct	3 ms	1192 KB	Output is correct
43	Correct	2 ms	1192 KB	Output is correct
44	Correct	3 ms	1236 KB	Output is correct
45	Correct	2 ms	1236 KB	Output is correct
46	Correct	3 ms	1236 KB	Output is correct
47	Correct	3 ms	1236 KB	Output is correct
48	Correct	2 ms	1236 KB	Output is correct
49	Correct	3 ms	1236 KB	Output is correct
50	Correct	3 ms	1236 KB	Output is correct
51	Correct	3 ms	1244 KB	Output is correct
52	Correct	22 ms	1244 KB	Output is correct
53	Correct	34 ms	1244 KB	Output is correct
54	Correct	63 ms	1244 KB	Output is correct
55	Correct	60 ms	1244 KB	Output is correct
56	Correct	231 ms	1244 KB	Output is correct
57	Correct	226 ms	1328 KB	Output is correct
58	Correct	219 ms	1328 KB	Output is correct
59	Correct	214 ms	1328 KB	Output is correct
60	Correct	234 ms	1328 KB	Output is correct
61	Correct	3 ms	1328 KB	Output is correct
62	Correct	34 ms	1328 KB	Output is correct
63	Correct	62 ms	1328 KB	Output is correct
64	Correct	59 ms	1460 KB	Output is correct
65	Correct	110 ms	1460 KB	Output is correct
66	Correct	167 ms	1460 KB	Output is correct
67	Correct	220 ms	1488 KB	Output is correct
68	Correct	222 ms	1488 KB	Output is correct
69	Correct	232 ms	1528 KB	Output is correct

Submission #68753

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0