# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45776 | daniel_02 | Bali Sculptures (APIO15_sculpture) | C++17 | 1086 ms | 644 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>
#define ll long long
using namespace std;
const int N = 2e3 + 7;
const ll inf = 1e18 + 7;
ll a[N], pr[N], ans = inf;
int n, x, y;
void conquer(int pos, ll sum, int rem)
{
if (rem == 1)
{
ll sm = pr[n] - pr[pos - 1];
sum = (sum | sm);
ans = min(ans, sum);
return;
}
for (int i = pos; i <= n - (rem - 1); i++)
{
ll sm = pr[i] - pr[pos - 1];
conquer(i + 1, (sum | sm), rem - 1);
}
}
main()
{
scanf("%d%d%d", &n, &x, &y);
if (n > 46)
{
assert(0);
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
pr[i] = pr[i - 1] + a[i];
}
for (int i = x; i <= y; i++)
{
conquer(1, 0, i);
}
cout << ans << endl;
}
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... |