Submission #1318795

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318795		yusifm	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	1096 ms	420 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 ll sz=1000000,INF=1000000000000000000;
using namespace std;
void solve()
{
    ll n,m,l,num,cnt,sum,Res,ans=INF;
    cin>>n>>m>>l;
    vector<ll>nums,res;
    for(int i=0;i<n;i++)
    {
        cin>>num;
        nums.pb(num);
    }
    for(int i=m-1;i<=l-1;i++)
    {
        res.clear();
        for(int j=0;j<i;j++)
        {
            res.pb(1);
        }
        for(int j=0;j<=n-i-1;j++)
        {
            res.pb(0);
        }
        if(res[res.size()-1]==0)
        {
            sort(all(res));
            Res=0,sum=0;
            for(int j=0;j<res.size();j++)
            {
                sum+=nums[j];
                if(res[j])
                {
                    Res|=sum,sum=0;
                }
            }
            Res|=sum,ans=min(ans,Res);
            while(next_permutation(all(res)))
            {
                Res=0,sum=0;
                for(int j=0;j<res.size();j++)
                {
                    sum+=nums[j];
                    if(res[j])
                    {
                        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);
    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