Submission #1312174

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312174		yusifm	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	1 ms	576 KiB

sculpture

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
vector<ll>pow2;
void solve()
{
    ll n,m,l,num,res,sum,ans=INF;
    cin>>n>>m>>l;
    vector<ll>nums;
    set<ll>idxs;
    for(int i=0;i<n;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    for(int i=m;i<=l;i++)
    {
        for(int j=1;j<pow2[n-1];j++)
        {
            idxs.clear();
            for(int k=0;k<n-1;k++)
            {
                if(j&pow2[k])
                {
                    idxs.in(k);
                }
            }
            if(idxs.size()==i-1)
            {
                res=0,sum=0;
                for(int j=0;j<nums.size();j++)
                {
                    sum+=nums[j];
                    if(idxs.find(j)!=idxs.end())
                    {
                        res|=sum,sum=0;
                    }
                }
                res|=sum;
                ans=min(ans,res);
            }
        }
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    for(int i=1;i<INF;i*=2)
    {
        pow2.pb(i);
    }
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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