Submission #239264

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
239264	2020-06-15T04:46:12 Z	dCoding	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	167 ms	512 KB

sculpture

/*
Soln seen.
In this problem, we have two separate approaches, one that'll solve subtask 1-4 and another for subtask 5.
The O(n^3) solution for subtasks 1-4 is that,
For each bit, we see whether it is possible that the bit is not set in the final answer.
So we calculate dp[number of elements][number of partitions] and dp[i][j] is true iff it is possible to set the current bit to 0 if
there is a partition at index k.
For the O(n^2) solution, our states are a bit different
We calculate dp[number of elements] and dp[i] stores the min number of partitions required if we want to set the current bit to 0.
Since we try to minimize the optimal answer, greedily minimizing the highest bit each time works.
*/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>

#define ll long long int
#define F0R(i,n) for(auto i = 0; i < (n); i++)
#define FOR(i,a,b) for(auto i = (a); i <= (b); i++)
#define ROF(i,a,b) for(auto i = (a); i >= (b); i--)
#define pii pair<int,int> 
#define pll pair<ll,ll>
#define vv vector
#define F first
#define S second
#define pb push_back
#define vi vector<int>

using namespace std;

const int MAXN = 2005;
int n,a,b;
ll pre[MAXN];

inline bool possible(ll num,ll currentSum,int bit) {
	return ((((currentSum|num)-currentSum)) < (1LL<<bit));
}

// O(n^2) solution
bool dpN2(ll sum,int bit) {
	int dp[n+5];
	memset(dp,0,sizeof(dp));
	FOR(i,1,n) {
		dp[i] = 100000;
		ROF(j,i-1,0) {
			if(possible(pre[i]-pre[j],sum,bit)) {
				dp[i] = min(dp[i],dp[j]+1);
			}
		}
	}
	return (dp[n] <= b);
}

// O(n^3) solution
bool dpN3(ll sum,int bit) {
	bool dp[n+5][n+5];
	memset(dp,false,sizeof(dp));
	dp[0][0] = true;
	FOR(i,1,n) {
		ROF(j,i-1,0) {
			// j elements done already
			if(possible(pre[i]-pre[j],sum,bit)) {
				FOR(k,1,n) {
					if(dp[j][k-1]) dp[i][k] = true;
				}
			}
		}
	}
	bool res = false;
	FOR(i,a,b) res |= dp[n][i];
	return res;
}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> a >> b;
	ll arr[n+5]; FOR(i,1,n) cin >> arr[i];
	FOR(i,1,n) pre[i] = pre[i-1]+arr[i];
	ll ans = 0;
	ROF(i,45,0) {
		if(a == 1) {
			if(!dpN2(ans,i)) ans += (1LL<<i);
		} else {
			if(!dpN3(ans,i)) ans += (1LL<<i);
		}
	}
	cout << ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
29.0 / 29.0

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

Submission #239264

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
29.0 / 29.0