# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23046 | Bruteforceman | Bali Sculptures (APIO15_sculpture) | C++11 | 99 ms | 2092 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;
int a[2005];
int dp[2005];
int n, A, B;
typedef long long Long;
Long p[2005];
const int bit = 42;
long long mask;
const int inf = 1e8;
void solve (int x) {
mask ^= 1LL << x;
for(int i = 1; i <= n; i++) {
dp[i] = inf;
for(int j = 0; j < i; j++) {
long long sum = p[i] - p[j];
if((sum | mask) == mask) dp[i] = min(dp[i], dp[j] + 1);
}
}
if(dp[n] > B) {
mask |= (1LL << x);
}
}
int xp[105][105];
void fuck(int x) {
mask ^= 1LL << x;
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... |