Submission #130019

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
130019	2019-07-13T18:57:28 Z	kostia244	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	40 ms	504 KB

sculpture

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define pb push_back
#define __V vector
#define all(x) x.begin(), x.end()
#define oit ostream_iterator
#define mod M
using namespace std;
void doin() {
	cin.tie();
	cout.tie();
	ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);
#endif
}
template<typename X, typename Y>
istream& operator>>(istream& in, pair<X, Y> &a) {
	in >> a.first >> a.second;
	return in;
}
template<typename T>
void getv(T& i) {
	cin >> i;
}
template<typename T, typename ... Ns>
void getv(vector<T>& v, int n, Ns ... ns) {
	v.resize(n);
	for (auto& i : v)
		getv(i, ns...);
}
template<typename T>
void getv1(T& i) {
	cin >> i;
}
template<typename T, typename ... Ns>
void getv1(vector<T>& v, int n, Ns ... ns) {
	v.resize(n + 1);
	for (int i = 1; i <= n; i++)
		getv(v[i], ns...);
}
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
inline void getch(char &x) {
	while (x = getchar_unlocked(), x < 33) {
		;
	}
}
inline void getstr(string &str) {
	str.clear();
	char cur;
	while (cur = getchar_unlocked(), cur < 33) {
		;
	}
	while (cur > 32) {
		str += cur;
		cur = getchar_unlocked();
	}
}
template<typename T> inline bool sc(T &num) {
	bool neg = 0;
	int c;
	num = 0;
	while (c = getchar_unlocked(), c < 33) {
		if (c == EOF)
			return false;
	}
	if (c == '-') {
		neg = 1;
		c = getchar_unlocked();
	}
	for (; c > 47; c = getchar_unlocked())
		num = num * 10 + c - 48;
	if (neg)
		num *= -1;
	return true;
}
typedef unsigned long long ull;
typedef long long ll;
typedef float ld;
typedef ll _I;
typedef pair<_I, _I> pi;
typedef pair<ld, ld> pd;
typedef map<_I, _I> mii;
typedef __V <_I> vi;
typedef __V <char> vc;
typedef __V <ld> vd;
typedef __V <vd> vvd;
typedef __V <pi> vpi;
typedef __V <__V<_I>> vvi;
typedef __V <__V<char>> vvc;
typedef __V <__V<pi>> vvpi;
using AntonTsypko = void;
using arsijo = AntonTsypko;
using god = arsijo;
uniform_real_distribution<double> double_dist(0, 1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, A, B, dp[101][101];
vi a, pref;
ll ans = (1ll << 61) - 1;
int can1(int i = 0) {
	if (i == n)
		return 0;
	if (dp[i][0] != -1)
		return dp[i][0];
	int& res = dp[i][0];
	res = INT_MAX;
	for (int j = i + 1; j <= n; j++) {
		ll sum = pref[j - 1] - (i ? pref[i - 1] : 0);
		if ((ans | sum) != ans)
			continue;
		res = min(res, 1+can1(j));
	}
	return res;
}
int can(int i = 0, int cuts = 0) {
	if(n > 100) {
		int k = can1();
		return k<=B;
	}
	if(cuts > B)
		return 0;
	if (i == n)
		return cuts >= A;
	if (dp[i][cuts] != -1)
		return dp[i][cuts];
	int& res = dp[i][cuts];
	res = 0;
	for (int j = i + 1; j <= n; j++) {
		ll sum = pref[j - 1] - (i ? pref[i - 1] : 0);
		if ((ans | sum) != ans)
			continue;
		res |= can(j, cuts+1);
	}
	return res;
}

int main() {
	doin();
	cin >> n >> A >> B;
	getv(a, n);
	pref.resize(n);
	pref[0] = a[0];
	for (int i = 1; i < n; i++)
		pref[i] = a[i] + pref[i - 1];
	for (int i = 60; i >= 0; i--) {
		memset(dp, -1, sizeof(dp));
		ans -= (1ll << i);
		if (!can())
			ans += (1ll << i);
	}
	cout << ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	380 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	3 ms	376 KB	Output is correct
17	Correct	5 ms	376 KB	Output is correct
18	Correct	6 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	380 KB	Output is correct
21	Correct	6 ms	376 KB	Output is correct
22	Correct	6 ms	352 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	6 ms	376 KB	Output is correct
25	Correct	7 ms	376 KB	Output is correct
26	Correct	14 ms	376 KB	Output is correct
27	Correct	29 ms	376 KB	Output is correct
28	Correct	40 ms	504 KB	Output is correct
29	Correct	38 ms	428 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	33 ms	440 KB	Output is correct
32	Correct	38 ms	376 KB	Output is correct

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	3 ms	380 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	6 ms	380 KB	Output is correct
29	Correct	6 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	6 ms	376 KB	Output is correct
32	Correct	6 ms	376 KB	Output is correct
33	Correct	5 ms	376 KB	Output is correct
34	Correct	6 ms	376 KB	Output is correct
35	Correct	6 ms	376 KB	Output is correct
36	Correct	14 ms	376 KB	Output is correct
37	Correct	29 ms	376 KB	Output is correct
38	Correct	39 ms	376 KB	Output is correct
39	Correct	39 ms	376 KB	Output is correct
40	Correct	3 ms	376 KB	Output is correct
41	Correct	33 ms	376 KB	Output is correct
42	Correct	38 ms	376 KB	Output is correct
43	Correct	4 ms	376 KB	Output is correct
44	Correct	9 ms	376 KB	Output is correct
45	Correct	17 ms	376 KB	Output is correct
46	Correct	23 ms	376 KB	Output is correct
47	Correct	21 ms	376 KB	Output is correct
48	Correct	3 ms	376 KB	Output is correct
49	Correct	24 ms	376 KB	Output is correct
50	Correct	24 ms	380 KB	Output is correct
51	Incorrect	3 ms	376 KB	Output isn't correct
52	Halted	0 ms	0 KB	-

Submission #130019

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 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
0 / 29.0