# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105816 | Kastanda | Bali Sculptures (APIO15_sculpture) | C++11 | 144 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;
const int N = 2020, N2 = 109;
int n, a, b, A[N], dp[N];
bitset < N2 > pd[N2];
inline bool Solve(long long Mask, int tp)
{
if (!tp)
{
dp[0] = 0;
for (int i = 1; i <= n; i++)
{
long long sum = A[i]; dp[i] = n + 1;
for (int j = i - 1; j >= 0; sum += A[j], j --)
if ((Mask & sum) == sum)
dp[i] = min(dp[i], dp[j] + 1);
}
return (dp[n] <= b);
}
pd[0][0] = 1;
for (int i = 1; i <= n; i++)
{
long long sum = A[i]; pd[i] = 0;
for (int j = i - 1; j >= 0; sum += A[j], j --)
if ((Mask & sum) == sum)
pd[i] |= (pd[j] << 1);
}
for (int i = a; i <= b; i++)
if (pd[n][i])
return 1;
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... |