Submission #674600

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
674600	2022-12-25T09:53:23 Z	parsadox2	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	141 ms	480 KB

sculpture

#include <bits/stdc++.h>
#define pb 		push_back
#define F		first
#define S 		second
#define debug(x)    cout << #x << "= " << x << ", "
#define ll 		long long
#define fast 		ios::sync_with_stdio(false), cin.tie(0),  cout.tie(0)
#define Sz(x)         (int) x.size()
#define int long long
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 2e3 + 10 , maxl = 50;
int n , ar[maxn] , a , b , res , ps[maxn];
int dp[maxn];

bool find_ans(int mask)
{
	for(int i = 1 ; i <= n ; i++)
		dp[i] = n + 1;
	dp[0] = 0;
	for(int i = 1 ; i <= n ; i++)
	{
		for(int k = 0 ; k < i ; k++)
		{
			int tmp = ps[i] - ps[k];
			if((tmp & mask) == tmp)
				dp[i] = min(dp[i] , dp[k] + 1);
		}
	}
	bool flg = false;
	if(dp[n] <= b)
		flg = true;
	return flg;
}

void solve()
{
	for(int bit = maxl ; bit > -1 ; bit--)
	{
		int tmp = res;
		tmp |= ((1LL << (bit)) - 1);
		if(!find_ans(tmp))
			res |= (1LL << bit);
	}
}

int32_t main()
{
	fast;
	cin >> n >> a >> b;
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> ar[i];
		ps[i] = ps[i - 1] + ar[i];
	}
	solve();
	cout << res << endl;
	return 0;
}

Subtask #1
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	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Incorrect	0 ms	324 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	Verdict	Execution time	Memory	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	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	324 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	324 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	0 ms	212 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	1 ms	340 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	328 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	328 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	2 ms	328 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	328 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	328 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	328 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 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	1 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 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	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	328 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	224 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	0 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	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 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	340 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	336 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	1 ms	212 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	212 KB	Output is correct
39	Correct	2 ms	212 KB	Output is correct
40	Correct	1 ms	324 KB	Output is correct
41	Correct	1 ms	212 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	212 KB	Output is correct
46	Correct	1 ms	328 KB	Output is correct
47	Correct	1 ms	324 KB	Output is correct
48	Correct	1 ms	224 KB	Output is correct
49	Correct	1 ms	332 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	1 ms	352 KB	Output is correct
52	Correct	16 ms	356 KB	Output is correct
53	Correct	21 ms	340 KB	Output is correct
54	Correct	37 ms	340 KB	Output is correct
55	Correct	37 ms	340 KB	Output is correct
56	Correct	136 ms	368 KB	Output is correct
57	Correct	138 ms	480 KB	Output is correct
58	Correct	131 ms	384 KB	Output is correct
59	Correct	130 ms	380 KB	Output is correct
60	Correct	141 ms	340 KB	Output is correct
61	Correct	1 ms	212 KB	Output is correct
62	Correct	21 ms	360 KB	Output is correct
63	Correct	38 ms	348 KB	Output is correct
64	Correct	38 ms	340 KB	Output is correct
65	Correct	67 ms	340 KB	Output is correct
66	Correct	106 ms	352 KB	Output is correct
67	Correct	135 ms	384 KB	Output is correct
68	Correct	137 ms	380 KB	Output is correct
69	Correct	133 ms	352 KB	Output is correct

Submission #674600

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