# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172304 | vibeduck | Bali Sculptures (APIO15_sculpture) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
/*
ST 3
• 1 <= N <= 100
• A = 1
• 1 <= B <= N
• 0 <= Yi <= 20
*/
int n, a, b;
const int mxn = 101;
int y[mxn];
int sub(int x, int y) {
// is x a submask of y
return ((x | y) <= y);
}
int can(int mask) {
vi dp(n + 1, 1e18); dp[n] = 0;
for (int i = n - 1; i >= 0; i--) {
int s = 0;
for (int j = i; j < n; j++) {
s += y[j];
if (sub(s, mask)) dp[i] = min(dp[i], dp[j + 1] + 1);
}
}
return (dp[0] <= b);
}
inline void solve() {
cin >> n >> a >> b;
for (int i = 0; i < n; i++) cin >> y[i];
int ans = (1 << 33) - 1;
for (int i = 32; i >= 0; i--) {
int tmp = (ans ^ (1 << i));
if (can(tmp)) ans = tmp;
}
cout << ans << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |