# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17637 | Namnamseo | Bali Sculptures (APIO15_sculpture) | C++14 | 103 ms | 1828 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.
// explained in namnamseo.tistory.com
#include <iostream>
using namespace std;
typedef long long ll;
ll data[5010], pref[5010], ans;
int n;
int A, B;
void in(){
cin>>n>>A>>B;
int i;
for(i=1; i<=n; ++i) cin>>data[i], pref[i]=pref[i-1]+data[i];
}
int dp[5010];
int min(int a,int b){ return a>b?b:a; }
bool chk_no_lb(int k){
ll mask = (~ans) & (~((1ll<<k)-1));
int i,j;
for(i=1; i<=n; ++i){
dp[i]=1e9;
for(j=0; j<i; ++j){
if(((pref[i]-pref[j])&mask) == 0){
dp[i]=min(dp[i],dp[j]+1);
}
}
}
# | 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... |