Submission #41417

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
41417	2018-02-17T07:54:02 Z	cmaster	Bali Sculptures (APIO15_sculpture)	C++14	25 / 100	1000 ms	11480 KB

sculpture

#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
 
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0) 
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)5e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

int n, a[MAXN], l, r;
map < pair < ll, pair < ll, ll > >, ll > dp;

ll rec(int i, ll cost, int cnt) {
	if(i == n+1) {
		if(l <= cnt && cnt <= r) return cost;
		return (ll)1e15;
	}
	if(dp.count(mp(i, mp(cost, cnt)))) return dp[mp(i, mp(cost, cnt))];
	ll ans = (ll)1e15;
	ll sum = 0;
	rep(j, i, n) {
		sum += a[j];
		ans = min(ans, rec(j+1, cost | sum, cnt+1));
	}
	return dp[mp(i, mp(cost, cnt))] = ans;
}

int main() {
	#ifdef accepted
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	onlycin;
	cin >> n >> l >> r;
	rep(i, 1, n) cin >> a[i];
	cout << rec(1, 0, 0) << nxtl;
	
	return 0;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

16.0 / 16.0

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

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	3052 KB	Output is correct
2	Correct	1 ms	3052 KB	Output is correct
3	Correct	1 ms	3052 KB	Output is correct
4	Correct	1 ms	3052 KB	Output is correct
5	Correct	1 ms	3052 KB	Output is correct
6	Correct	2 ms	3052 KB	Output is correct
7	Correct	2 ms	3052 KB	Output is correct
8	Correct	3 ms	3052 KB	Output is correct
9	Correct	3 ms	3052 KB	Output is correct
10	Correct	2 ms	3052 KB	Output is correct
11	Correct	2 ms	3052 KB	Output is correct
12	Correct	2 ms	3052 KB	Output is correct
13	Correct	2 ms	3052 KB	Output is correct
14	Correct	2 ms	3052 KB	Output is correct
15	Correct	4 ms	3052 KB	Output is correct
16	Correct	27 ms	3052 KB	Output is correct
17	Correct	32 ms	3052 KB	Output is correct
18	Correct	99 ms	3052 KB	Output is correct
19	Correct	50 ms	3052 KB	Output is correct
20	Correct	41 ms	3052 KB	Output is correct
21	Correct	58 ms	3052 KB	Output is correct
22	Correct	66 ms	3052 KB	Output is correct
23	Correct	88 ms	3052 KB	Output is correct
24	Correct	104 ms	3052 KB	Output is correct
25	Correct	381 ms	6100 KB	Output is correct
26	Correct	837 ms	9996 KB	Output is correct
27	Execution timed out	1073 ms	11344 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

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

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	11480 KB	Output is correct
2	Correct	1 ms	11480 KB	Output is correct
3	Correct	1 ms	11480 KB	Output is correct
4	Correct	1 ms	11480 KB	Output is correct
5	Correct	1 ms	11480 KB	Output is correct
6	Correct	2 ms	11480 KB	Output is correct
7	Correct	2 ms	11480 KB	Output is correct
8	Correct	2 ms	11480 KB	Output is correct
9	Correct	2 ms	11480 KB	Output is correct
10	Correct	3 ms	11480 KB	Output is correct
11	Correct	2 ms	11480 KB	Output is correct
12	Correct	2 ms	11480 KB	Output is correct
13	Correct	3 ms	11480 KB	Output is correct
14	Correct	2 ms	11480 KB	Output is correct
15	Correct	2 ms	11480 KB	Output is correct
16	Correct	2 ms	11480 KB	Output is correct
17	Correct	7 ms	11480 KB	Output is correct
18	Correct	2 ms	11480 KB	Output is correct
19	Correct	3 ms	11480 KB	Output is correct
20	Correct	2 ms	11480 KB	Output is correct
21	Correct	2 ms	11480 KB	Output is correct
22	Correct	2 ms	11480 KB	Output is correct
23	Correct	1 ms	11480 KB	Output is correct
24	Correct	3 ms	11480 KB	Output is correct
25	Correct	6 ms	11480 KB	Output is correct
26	Correct	20 ms	11480 KB	Output is correct
27	Correct	29 ms	11480 KB	Output is correct
28	Correct	103 ms	11480 KB	Output is correct
29	Correct	43 ms	11480 KB	Output is correct
30	Correct	42 ms	11480 KB	Output is correct
31	Correct	62 ms	11480 KB	Output is correct
32	Correct	55 ms	11480 KB	Output is correct
33	Correct	73 ms	11480 KB	Output is correct
34	Correct	101 ms	11480 KB	Output is correct
35	Correct	387 ms	11480 KB	Output is correct
36	Correct	837 ms	11480 KB	Output is correct
37	Execution timed out	1056 ms	11480 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-