# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43252 | trungpro | Bali Sculptures (APIO15_sculpture) | C++14 | 94 ms | 812 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>
#define LL long long
using namespace std;
const int N = 2005;
LL sum[N],ans;
bool f[N][N];
int dp[N],n,a,b;
bool sub1(LL mask) {
dp[0] = 0;
for (int i = 1 ; i <= n ; ++ i) {
dp[i] = b + 1;
for (int j = i - 1 ; j >= 0 ; -- j) {
if (((sum[i] -sum[j]) & ~mask) == 0)
dp[i] = min(dp[i],dp[j]+1);
}
}
return (dp[n] <= b);
}
bool sub2(LL mask) {
f[0][0] = 1;
for (int i = 1 ; i <= b ; ++ i)
f[0][i] = 0;
for (int i = 1 ; i <= n ; ++ i) {
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... |