제출 #338795

#제출 시각아이디문제언어결과실행 시간메모리
338795ogibogi2004Bali Sculptures (APIO15_sculpture)C++14
21 / 100
1081 ms8044 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long const ll MAXN=2048; vector<pair<ll,ll> >g[MAXN]; ll n,a,b,cur; ll y[MAXN]; bool dp[MAXN][MAXN]; bool ok(ll idx) { //if(idx==1)cout<<idx<<endl; memset(dp,0,sizeof(dp)); dp[0][0]=1; for(ll i=0;i<=n;i++) { for(auto xd:g[i]) { if((xd.first|idx)!=idx)continue; for(ll j=0;j<=n;j++) { dp[xd.second+1][j+1]|=dp[i][j]; } } } for(ll i=a;i<=b;i++) { if(dp[n+1][i])return 1; } return 0; } int main() { cin>>n>>a>>b; for(ll i=1;i<=n;i++) { cin>>y[i]; } for(ll i=0;i<=n;i++) { ll sum=0; for(ll j=i;j<=n;j++) { sum+=y[j]; g[i].push_back({sum,j}); } } cur=(1ll<<61)-1ll; for(ll i=60;i>=0;i--) { if(ok(cur-(1ll<<i))) { cur-=(1ll<<i); } } cout<<cur<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...