# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50799 | waynetuinfor | Bali Sculptures (APIO15_sculpture) | C++17 | 477 ms | 16932 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 maxn = 2000 + 5;
long long s[maxn], y[maxn];
int dp[maxn][maxn], qu[maxn], dt[maxn];
vector<int> gr[maxn];
int main() {
int n, a, b; scanf("%d %d %d", &n, &a, &b);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &y[i]);
s[i] = s[i - 1] + y[i];
}
if (a == 1) {
long long ans = 0, mask = 0;
for (int t = 44; t >= 0; --t) {
for (int i = 0; i < maxn; ++i) gr[i].clear();
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < i; ++j) {
if (mask & (s[i] - s[j])) continue;
int bit = (s[i] - s[j]) >> t & 1;
if (bit == 0) gr[j].push_back(i);
}
}
memset(dt, -1, sizeof(dt));
dt[0] = 0;
int l = 0, r = 0;
qu[r++] = 0;
while (l < r) {
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... |