# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23426 | rubabredwan | Bali Sculptures (APIO15_sculpture) | C++14 | 139 ms | 2120 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.
/* Bismillahir Rahmanir Rahim */
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
const int oo = 1e9;
int n, a, b, y[N];
int dp[N];
bool solve_big(long long fixed){
dp[0] = 0;
for(int i=1;i<=n;i++){
dp[i] = oo;
long long sum = 0;
for(int j=i;j>=1;j--){
sum += y[j];
if(sum & fixed) continue;
dp[i] = min(dp[i], dp[j-1] + 1);
}
}
if(dp[n] <= b) return true;
else return false;
}
long long F, fn[105][105];
int recur(int at, int cnt){
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... |