# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249015 | SamAnd | Bali Sculptures (APIO15_sculpture) | C++17 | 35 ms | 512 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;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N4 = 102, N5 = 2002;
int n, ul, ur;
int a[N5];
void ka()
{
scanf("%d%d%d", &n, &ul, &ur);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
}
void solv4()
{
bool dp[N4][N4];
ll ans = 0;
for (int i = 50; i >= 0; --i)
{
memset(dp, false, sizeof dp);
dp[0][0] = true;
for (int j = 1; j <= n; ++j)
{
ll s = 0;
for (int k = j; k >= 1; --k)
{
s += a[k];
if (((ans >> i) & (s >> i)) != (s >> i))
continue;
for (int q = 0; q <= n; ++q)
{
if (dp[k - 1][q])
dp[j][q + 1] = true;
}
}
}
bool z = false;
for (int q = ul; q <= ur; ++q)
{
if (dp[n][q])
{
z = true;
break;
}
}
if (!z)
{
ans |= (1LL << i);
}
}
printf("%lld\n", ans);
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
ka();
solv4();
return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
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... |