Submission #1193293

#	Time	Username	Problem	Language	Result	Execution time	Memory
1193293		trvhung	Bali Sculptures (APIO15_sculpture)	C++17	21 / 100	23 ms	10824 KiB

sculpture

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
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            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int N = 1e2 + 5;
const int MAX = (1 << 11);
int n, a, b, x[N];
bool dp[N][N][MAX];

void solve() {
	cin >> n >> a >> b;
	for (int i = 1; i <= n; ++i)
		cin >> x[i];

	dp[0][0][0] = 1;
	for (int i = 0; i < n; ++i)
		for (int j = 0; j < b; ++j)
			for (int v = 0; v < MAX; ++v)
				if (dp[i][j][v]) {
					int cur = 0;
					for (int k = i + 1; k <= n; ++k) {
						cur += x[k];
						dp[k][j + 1][v | cur] = 1;
					}
				}

	for (int i = 0; i < MAX; ++i)
		for (int j = 1; j <= b; ++j)
			if (dp[n][j][i])
				return cout << i, void();
}

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

    if (!MULTI) solve();
    else {
        int test; cin >> test;
        while (test--) solve();
    }
    
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 21 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29