Submission #918323

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
918323	2024-01-29T16:02:39 Z	trvhung	Bali Sculptures (APIO15_sculpture)	C++17	25 / 100	16 ms	3728 KB

sculpture

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
//-----------------------
// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            pb push_back
#define            pf push_front
#define            mp make_pair
#define      mem(f,x) memset(f, x, sizeof(f))
#define   __lcm(a, b) (1ll * a * b) / __gcd(a, b)
#define  bit(mask, i) ((mask >> i) & 1)
#define           pii pair<int, int>
#define           pll pair<ll, ll>
#define            el '\n'
#define             F first
#define             S second
#define         io(x) freopen(x".inp","r",stdin),freopen(x".out","w",stdout)
//-----------------------
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const int dx[4] = {0, 0, 1, -1}; //R L D U
const int dy[4] = {1, -1, 0, 0};
//-----AUTHOR trvhung VNG High School for Gifted Student-----

const int LOG = 15;
const int maxn = 2e3 + 5;
int n, A, B, a[maxn];

namespace onetwothree {
	ll dp[maxn][maxn], pref[maxn], sum;
	map<ll, set<ll> > v[maxn];

	bool check() {
		return (n <= 50 || (n == 100 && A == 1));
	}

	void solve() {
		for (int i = 1; i <= n; ++i)
			pref[i] = pref[i - 1] + a[i];

		sum = 0;
		for (int i = 1; i <= n; ++i) {
			sum += a[i];
			dp[i][1] = sum;
			v[i][1].insert(dp[i][1]);
		}

		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= min(i, B); ++j) {
				if (j == 1) continue;
				dp[i][j] = INF; sum = a[i];
				for (int k = i - 1; k >= j - 1; --k) {
					for (auto x: v[k][j - 1]) { 
						dp[i][j] = min(dp[i][j], x | sum);
						v[i][j].insert(x | sum);
					}
					sum += a[k];
				}
			}

		ll res = INF;
 		for (int i = A; i <= B; ++i)
 			res = min(res, dp[n][i]);

 		cout << res;
 	}
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> A >> B;
	for (int i = 1; i <= n; ++i)
		cin >> a[i];

	if (onetwothree::check()) onetwothree::solve();
    
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2648 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	2 ms	2652 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2608 KB	Output is correct
16	Correct	1 ms	2392 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2604 KB	Output is correct
19	Correct	1 ms	2648 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2652 KB	Output is correct
22	Correct	2 ms	2652 KB	Output is correct
23	Correct	1 ms	2652 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2648 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2600 KB	Output is correct
28	Correct	2 ms	2652 KB	Output is correct
29	Correct	2 ms	2648 KB	Output is correct
30	Correct	6 ms	3164 KB	Output is correct
31	Correct	16 ms	3728 KB	Output is correct
32	Correct	9 ms	3164 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	11 ms	3296 KB	Output is correct
35	Correct	10 ms	3420 KB	Output is correct
36	Correct	9 ms	3164 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2648 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2640 KB	Output is correct
7	Correct	1 ms	2404 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2652 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2652 KB	Output is correct
15	Correct	2 ms	2652 KB	Output is correct
16	Correct	2 ms	2652 KB	Output is correct
17	Correct	7 ms	3160 KB	Output is correct
18	Correct	16 ms	3704 KB	Output is correct
19	Correct	8 ms	3108 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	11 ms	3372 KB	Output is correct
22	Correct	10 ms	3420 KB	Output is correct
23	Correct	8 ms	3164 KB	Output is correct
24	Incorrect	0 ms	348 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2652 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2604 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2652 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2604 KB	Output is correct
22	Correct	1 ms	2648 KB	Output is correct
23	Correct	1 ms	2596 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	1 ms	2652 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2652 KB	Output is correct
29	Correct	1 ms	2652 KB	Output is correct
30	Correct	1 ms	2652 KB	Output is correct
31	Correct	1 ms	2652 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct
33	Correct	1 ms	2652 KB	Output is correct
34	Correct	1 ms	2652 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2904 KB	Output is correct
37	Correct	1 ms	2596 KB	Output is correct
38	Correct	1 ms	2652 KB	Output is correct
39	Correct	2 ms	2652 KB	Output is correct
40	Correct	6 ms	3120 KB	Output is correct
41	Correct	16 ms	3676 KB	Output is correct
42	Correct	8 ms	3160 KB	Output is correct
43	Correct	1 ms	2396 KB	Output is correct
44	Correct	11 ms	3548 KB	Output is correct
45	Correct	10 ms	3420 KB	Output is correct
46	Correct	9 ms	3144 KB	Output is correct
47	Incorrect	0 ms	348 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2648 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2600 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2636 KB	Output is correct
13	Correct	1 ms	2652 KB	Output is correct
14	Correct	1 ms	2604 KB	Output is correct
15	Correct	1 ms	2652 KB	Output is correct
16	Correct	1 ms	2652 KB	Output is correct
17	Correct	1 ms	2648 KB	Output is correct
18	Correct	1 ms	2656 KB	Output is correct
19	Correct	1 ms	2404 KB	Output is correct
20	Correct	1 ms	2660 KB	Output is correct
21	Correct	1 ms	2656 KB	Output is correct
22	Correct	1 ms	2404 KB	Output is correct
23	Correct	1 ms	2404 KB	Output is correct
24	Correct	1 ms	2652 KB	Output is correct
25	Correct	1 ms	2652 KB	Output is correct
26	Correct	2 ms	2652 KB	Output is correct
27	Correct	7 ms	3160 KB	Output is correct
28	Correct	16 ms	3676 KB	Output is correct
29	Correct	8 ms	3164 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	11 ms	3520 KB	Output is correct
32	Correct	10 ms	3420 KB	Output is correct
33	Correct	10 ms	3116 KB	Output is correct
34	Incorrect	0 ms	344 KB	Output isn't correct
35	Halted	0 ms	0 KB	-

Submission #918323

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0