# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31137 | nibnalin | Bali Sculptures (APIO15_sculpture) | C++14 | 156 ms | 33460 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 <iostream>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long int lli;
const lli maxn = lli(2e3)+5, inf = lli(1e14)+5, maxb = 50;
lli n, a, b, A[maxn], memo1[maxn], memo2[maxn][maxn];
lli DP1(lli idx, lli mask)
{
if(idx > n) return 0;
else if(memo1[idx] != -1) return memo1[idx];
else
{
lli res = inf;
for(lli i = idx;i <= n;i++)
{
lli c = A[i]-A[idx-1];
if((mask|c) == mask)
{
res = min(res, DP1(i+1, mask)+1);
}
}
memo1[idx] = res;
return res;
}
}
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... |