oj.uz

Submission #68756

# Submission time Handle Problem Language Result Execution time Memory
68756 2018-08-18T10:35:32 Z FedericoS Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 354 ms 1500 KB 
#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){

		while(clock()<100000);

		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 99 ms 248 KB Output is correct
2 Correct 100 ms 488 KB Output is correct
3 Correct 99 ms 568 KB Output is correct
4 Correct 100 ms 568 KB Output is correct
5 Correct 100 ms 568 KB Output is correct
6 Correct 100 ms 568 KB Output is correct
7 Correct 100 ms 692 KB Output is correct
8 Correct 100 ms 692 KB Output is correct
9 Correct 99 ms 692 KB Output is correct
10 Correct 100 ms 772 KB Output is correct
11 Correct 100 ms 772 KB Output is correct
12 Correct 100 ms 772 KB Output is correct
13 Correct 100 ms 772 KB Output is correct
14 Correct 2 ms 772 KB Output is correct
15 Incorrect 2 ms 772 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 772 KB Output is correct
2 Correct 100 ms 772 KB Output is correct
3 Correct 100 ms 772 KB Output is correct
4 Correct 100 ms 772 KB Output is correct
5 Correct 100 ms 772 KB Output is correct
6 Correct 100 ms 804 KB Output is correct
7 Correct 100 ms 804 KB Output is correct
8 Correct 100 ms 804 KB Output is correct
9 Correct 100 ms 804 KB Output is correct
10 Correct 100 ms 820 KB Output is correct
11 Correct 100 ms 820 KB Output is correct
12 Correct 100 ms 820 KB Output is correct
13 Correct 100 ms 820 KB Output is correct
14 Correct 2 ms 820 KB Output is correct
15 Incorrect 2 ms 820 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 100 ms 820 KB Output is correct
2 Correct 100 ms 820 KB Output is correct
3 Correct 100 ms 820 KB Output is correct
4 Correct 100 ms 820 KB Output is correct
5 Correct 100 ms 820 KB Output is correct
6 Correct 100 ms 820 KB Output is correct
7 Correct 100 ms 820 KB Output is correct
8 Correct 100 ms 820 KB Output is correct
9 Correct 100 ms 820 KB Output is correct
10 Correct 100 ms 920 KB Output is correct
11 Correct 100 ms 920 KB Output is correct
12 Correct 100 ms 920 KB Output is correct
13 Correct 100 ms 920 KB Output is correct
14 Correct 100 ms 920 KB Output is correct
15 Correct 100 ms 920 KB Output is correct
16 Correct 100 ms 932 KB Output is correct
17 Correct 101 ms 940 KB Output is correct
18 Correct 101 ms 940 KB Output is correct
19 Correct 100 ms 940 KB Output is correct
20 Correct 100 ms 948 KB Output is correct
21 Correct 100 ms 948 KB Output is correct
22 Correct 100 ms 948 KB Output is correct
23 Correct 100 ms 948 KB Output is correct
24 Correct 100 ms 948 KB Output is correct
25 Correct 100 ms 948 KB Output is correct
26 Correct 100 ms 948 KB Output is correct
27 Correct 100 ms 948 KB Output is correct
28 Correct 101 ms 948 KB Output is correct
29 Correct 102 ms 948 KB Output is correct
30 Correct 101 ms 948 KB Output is correct
31 Correct 100 ms 948 KB Output is correct
32 Correct 101 ms 948 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 948 KB Output is correct
2 Correct 100 ms 948 KB Output is correct
3 Correct 100 ms 948 KB Output is correct
4 Correct 100 ms 948 KB Output is correct
5 Correct 100 ms 948 KB Output is correct
6 Correct 100 ms 948 KB Output is correct
7 Correct 100 ms 948 KB Output is correct
8 Correct 100 ms 948 KB Output is correct
9 Correct 100 ms 948 KB Output is correct
10 Correct 100 ms 948 KB Output is correct
11 Correct 100 ms 948 KB Output is correct
12 Correct 100 ms 948 KB Output is correct
13 Correct 100 ms 948 KB Output is correct
14 Correct 2 ms 948 KB Output is correct
15 Incorrect 3 ms 948 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 100 ms 948 KB Output is correct
2 Correct 100 ms 948 KB Output is correct
3 Correct 100 ms 952 KB Output is correct
4 Correct 100 ms 1072 KB Output is correct
5 Correct 100 ms 1072 KB Output is correct
6 Correct 100 ms 1072 KB Output is correct
7 Correct 99 ms 1072 KB Output is correct
8 Correct 100 ms 1072 KB Output is correct
9 Correct 100 ms 1072 KB Output is correct
10 Correct 100 ms 1072 KB Output is correct
11 Correct 100 ms 1072 KB Output is correct
12 Correct 101 ms 1072 KB Output is correct
13 Correct 100 ms 1108 KB Output is correct
14 Correct 100 ms 1108 KB Output is correct
15 Correct 99 ms 1108 KB Output is correct
16 Correct 100 ms 1108 KB Output is correct
17 Correct 100 ms 1108 KB Output is correct
18 Correct 100 ms 1108 KB Output is correct
19 Correct 100 ms 1108 KB Output is correct
20 Correct 100 ms 1108 KB Output is correct
21 Correct 101 ms 1108 KB Output is correct
22 Correct 100 ms 1108 KB Output is correct
23 Correct 100 ms 1108 KB Output is correct
24 Correct 100 ms 1108 KB Output is correct
25 Correct 100 ms 1108 KB Output is correct
26 Correct 100 ms 1108 KB Output is correct
27 Correct 100 ms 1108 KB Output is correct
28 Correct 100 ms 1108 KB Output is correct
29 Correct 99 ms 1108 KB Output is correct
30 Correct 100 ms 1108 KB Output is correct
31 Correct 100 ms 1108 KB Output is correct
32 Correct 100 ms 1108 KB Output is correct
33 Correct 100 ms 1108 KB Output is correct
34 Correct 100 ms 1108 KB Output is correct
35 Correct 100 ms 1108 KB Output is correct
36 Correct 101 ms 1108 KB Output is correct
37 Correct 101 ms 1108 KB Output is correct
38 Correct 101 ms 1108 KB Output is correct
39 Correct 101 ms 1108 KB Output is correct
40 Correct 101 ms 1108 KB Output is correct
41 Correct 101 ms 1108 KB Output is correct
42 Correct 101 ms 1108 KB Output is correct
43 Correct 100 ms 1108 KB Output is correct
44 Correct 101 ms 1108 KB Output is correct
45 Correct 100 ms 1224 KB Output is correct
46 Correct 101 ms 1224 KB Output is correct
47 Correct 101 ms 1224 KB Output is correct
48 Correct 101 ms 1224 KB Output is correct
49 Correct 100 ms 1224 KB Output is correct
50 Correct 101 ms 1224 KB Output is correct
51 Correct 100 ms 1224 KB Output is correct
52 Correct 119 ms 1224 KB Output is correct
53 Correct 130 ms 1224 KB Output is correct
54 Correct 163 ms 1276 KB Output is correct
55 Correct 157 ms 1276 KB Output is correct
56 Correct 325 ms 1308 KB Output is correct
57 Correct 322 ms 1448 KB Output is correct
58 Correct 318 ms 1448 KB Output is correct
59 Correct 311 ms 1448 KB Output is correct
60 Correct 316 ms 1448 KB Output is correct
61 Correct 101 ms 1448 KB Output is correct
62 Correct 131 ms 1448 KB Output is correct
63 Correct 156 ms 1448 KB Output is correct
64 Correct 157 ms 1448 KB Output is correct
65 Correct 217 ms 1448 KB Output is correct
66 Correct 276 ms 1448 KB Output is correct
67 Correct 354 ms 1448 KB Output is correct
68 Correct 329 ms 1500 KB Output is correct
69 Correct 322 ms 1500 KB Output is correct