# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110223 | SamAnd | Bali Sculptures (APIO15_sculpture) | C++17 | 1086 ms | 14612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 2003, M = 102;
int n;
int ll, rr;
int a[N];
void solv0()
{
long long ans = (1LL << 62);
for (int x = 0; x < (1 << n); ++x)
{
if ((x & (1 << 0)) == 0)
continue;
vector<long long> v;
long long y = a[1];
for (int i = 1; i < n; ++i)
{
if ((x & (1 << i)))
{
v.push_back(y);
y = a[i + 1];
}
else
y += a[i + 1];
}
v.push_back(y);
long long yans = 0;
for (int i = 0; i < v.size(); ++i)
yans = yans | v[i];
if (ll <= v.size() && v.size() <= rr)
ans = min(ans, yans);
}
cout << ans << endl;
}
bool dp[M][M][1 << 12] = {};
void solv1()
{
dp[0][0][0] = true;
for (int i = 1; i <= n; ++i)
{
int s = 0;
for (int j = i; j >= 1; --j)
{
s += a[j];
for (int k = 0; k <= rr; ++k)
{
for (int x = 0; x < (1 << 12); ++x)
{
if (!dp[j - 1][k][x])
continue;
dp[i][k + 1][x | s] = true;
}
}
}
}
int ans = (1 << 12);
for (int k = ll; k <= rr; ++k)
{
for (int x = 0; x < (1 << 12); ++x)
{
if (dp[n][k][x])
ans = min(ans, x);
}
}
cout << ans << endl;
}
int main()
{
//freopen("input.txt", "r", stdin);
cin >> n >> ll >> rr;
for (int i = 1; i <= n; ++i)
cin >> a[i];
if (n <= 20)
solv0();
else
solv1();
return 0;
}
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... |