| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 43937 | Kerim | Bali Sculptures (APIO15_sculpture) | C++17 | 144 ms | 16508 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 MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x) cerr<< #x <<" = "<< x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=2005;
int dp[N][N],pd[N];
ll par[N];
int n,a,b;
int f(int pos,int comp,ll mask){
if(comp>b)
return 0;
if(pos>n)
return (a<=comp);
int &ret=dp[pos][comp];
if(~ret)
return ret;ret=0;
for(int i=pos;i<=n;i++){
ll sum=par[i]-par[pos-1];
if((mask&sum)==sum and f(i+1,comp+1,mask))
return ret=1;
}return ret;
}
int f1(int pos,ll mask){
if(pos>n)
return 0;
int &ret=pd[pos];
if(~ret)
return ret;ret=INF;
for(int i=pos;i<=n;i++){
ll sum=par[i]-par[pos-1];
if((mask&sum)==sum)
umin(ret,f1(i+1,mask)+1);
}
return ret;
}
int main(){
//~ freopen("file.in", "r", stdin);
scanf("%d%d%d",&n,&a,&b);
for(int i=1;i<=n;i++){
int x;
scanf("%d",&x);
par[i]=par[i-1]+x;
}
ll ans=(1LL<<45)-1;
if(a>1){
for(int i=44;i>=0;i--){
memset(dp,-1,sizeof dp);
if(f(1,0,ans-(1LL<<i)))
ans-=(1LL<<i);
}
}
else{
for(int i=44;i>=0;i--){
memset(pd,-1,sizeof pd);
if(f1(1,ans-(1LL<<i))<=b)
ans-=(1LL<<i);
}
}
printf("%lld\n",ans);
return 0;
}
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... | ||||
