제출 #404626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
404626		teehandsome	Bali Sculptures (APIO15_sculpture)	C++11	21 / 100	2 ms	332 KiB

sculpture

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxn=2010;
int n,a,b;
int sum[mxn];
int dp[mxn];

ll f(int l,int r) {
    if(!l) return sum[r];
    return sum[r]-sum[l-1];
}

int dfs(ll val) {
    for(int i=0;i<n;i++) dp[i]=mxn;
    for(int i=0;i<n;i++) {
        if((sum[i]&val)==0) {
            dp[i]=1;
        }
    }
    for(int i=1;i<n;i++) {
        for(int j=i-1;j>=0;j--) {
            if((f(j+1,i)&val)==0) dp[i]=min(dp[i],1+dp[j]);
        }
    }
    return dp[n-1];
}

int main () {
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>a>>b;
    vector<int> a(n);
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=0;i<n;i++) {
        sum[i]=a[i];
        if(i) sum[i]+=sum[i-1];
    }
    ll val=0;
    for(int i=57;i>=0;i--) {
        val+=(1LL<<i);
//        debug(i,val,dfs(val));
        if(dfs(val)<=b) continue;
        val-=(1LL<<i);
    }
    cout<<(1LL<<58)-1-val<<endl;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 21 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29