oj.uz

Submission #328142

# Submission time Handle Problem Language Result Execution time Memory
328142 2020-11-15T13:04:31 Z hivakarami Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 512 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long int ll;
typedef long double doublel;
#define f first
#define s second
 
const int N = 3000 + 100;
const int sq = 200;
const ll mod =  1e9 + 7;
const ll inf = 1e16;	

int dp[N];
ll y[N];
bool d[200][200];




int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);	
	
	
	int n, a, b;
	cin >> n >> a >> b;
	for(int i = 0; i < n; i++)
		cin >> y[i];
	
	
	if(a == 0)
	{
		ll ans = (1ll << 42)-1;
		//cout << ans << endl;
		for(int i = 41; i >= 0; i--)
		{
			ans ^= (1ll << i);
			//cout << ans << endl;
			
			for(int j = 0; j < n; j++)
			{
				dp[j] = b+1;
				ll sum = y[j];
				for(int k = j-1; k >= 0; k--)
				{
					if((ans | sum) == ans)
					{
						dp[j] = min(dp[j], 1 + dp[k]);
					}
					sum += y[k];
				}
				if((ans | sum) == ans)
					dp[j] = 1;
					
					
				
			}	
			
			if(dp[n-1] > b)
				ans ^= (1ll << i);
			
		}
			
			
		cout << ans << endl;
		
		return 0;
	}




	ll ans = (1ll << 42)-1;
	//cout << ans << endl;
	for(int t = 41; t >= 0; t--)
	{
		ans ^= (1ll << t);
		//cout << ans << endl;
		bool bol = false;
		for(int k = 1; k <= b; k++)
		{
			for(int i = 0; i < n; i++)
			{
				d[i][k] = false;
				ll sum = y[i];
				for(int j = i-1; j >= 0; j--)
				{
					if((ans|sum) == ans)
						d[i][k] |= d[j][k-1];
					sum += y[j];
				}
				
				if((ans|sum) == ans)
					d[i][1] = true;
					
			//	cout << i << ' ' << k << ' ' << d[i][k] << endl;	
			}
			
			if(k >= a)
				bol |= d[n-1][k];
			
		}
		if(!bol)
			ans ^= (1ll << t);	
	}
		
		
	cout << ans << endl;
		
	
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 236 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 2 ms 364 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 3 ms 364 KB Output is correct
18 Correct 3 ms 364 KB Output is correct
19 Correct 3 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 3 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 3 ms 364 KB Output is correct
26 Correct 7 ms 364 KB Output is correct
27 Correct 23 ms 364 KB Output is correct
28 Correct 51 ms 364 KB Output is correct
29 Correct 49 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 24 ms 364 KB Output is correct
32 Correct 37 ms 364 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 3 ms 364 KB Output is correct
42 Correct 3 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 3 ms 364 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 3 ms 364 KB Output is correct
48 Correct 3 ms 364 KB Output is correct
49 Correct 7 ms 364 KB Output is correct
50 Correct 23 ms 364 KB Output is correct
51 Correct 51 ms 364 KB Output is correct
52 Correct 50 ms 492 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 24 ms 364 KB Output is correct
55 Correct 38 ms 492 KB Output is correct
56 Correct 3 ms 364 KB Output is correct
57 Correct 7 ms 364 KB Output is correct
58 Correct 20 ms 364 KB Output is correct
59 Correct 41 ms 364 KB Output is correct
60 Correct 38 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 45 ms 364 KB Output is correct
63 Correct 45 ms 364 KB Output is correct
64 Correct 38 ms 364 KB Output is correct
65 Correct 3 ms 364 KB Output is correct
66 Correct 3 ms 364 KB Output is correct
67 Correct 7 ms 364 KB Output is correct
68 Correct 20 ms 364 KB Output is correct
69 Correct 42 ms 400 KB Output is correct
70 Correct 38 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 45 ms 364 KB Output is correct
73 Correct 33 ms 364 KB Output is correct
74 Correct 30 ms 364 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 3 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 364 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 3 ms 364 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 23 ms 364 KB Output is correct
38 Correct 50 ms 364 KB Output is correct
39 Correct 49 ms 512 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 24 ms 364 KB Output is correct
42 Correct 37 ms 364 KB Output is correct
43 Correct 3 ms 364 KB Output is correct
44 Correct 7 ms 364 KB Output is correct
45 Correct 19 ms 364 KB Output is correct
46 Correct 41 ms 364 KB Output is correct
47 Correct 40 ms 420 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 45 ms 364 KB Output is correct
50 Correct 44 ms 364 KB Output is correct
51 Correct 9 ms 364 KB Output is correct
52 Execution timed out 1088 ms 364 KB Time limit exceeded
53 Halted 0 ms 0 KB -