# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463886 | Hamed5001 | Bali Sculptures (APIO15_sculpture) | C++14 | 126 ms | 16208 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;
typedef long long ll;
const int mxN = 2e3+10;
int dp1[mxN][mxN], dp2[mxN];
int N, A, B;
int Y[mxN];
ll msk, ans;
int fun2(int idx, int grp) {
if (grp > B)
return 0;
if (idx == N)
return (A <= grp && grp <= B);
int &ret = dp1[idx][grp];
if (~ret) return ret;
ret = 0;
ll sum = 0;
for (int i = idx; i < N; ++i) {
sum += Y[i];
if (!(sum & msk))
ret |= fun2(i+1, grp+1);
}
return ret;
}
# | 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... |