제출 #1202006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1202006		Zbyszek99	Bali Sculptures (APIO15_sculpture)	C++20	100 / 100	66 ms	452 KiB

sculpture

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll arr[2001];
ll dp[2001];
bool dp2[101][101];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,a,b;
    cin >> n >> a >> b;
    rep(i,n) cin >> arr[i+1];
    if(a == 1)
    {
        ll not_take = 0;
        ll total = 0;
        for(ll bit = 42; bit >= 0; bit--)
        {
            total += (1LL << bit);
            not_take += (1LL << bit);
            rep2(i,1,n)
            {
                ll cur_sum = 0;
                dp[i] = 1e9;
                for(int j = i; j >= 1; j--)
                {
                    cur_sum += arr[j];
                    if((cur_sum & not_take) == 0)
                    {
                        dp[i] = min(dp[i],dp[j-1]+1);
                    }
                }
            }
            if(dp[n] > b) not_take -= (1LL << bit);
        }
        cout << total - not_take << "\n";
    }
    else
    {
        ll not_take = 0;
        ll total = 0;
        dp2[0][0] = 1;
        for(ll bit = 42; bit >= 0; bit--)
        {
            total += (1LL << bit);
            not_take += (1LL << bit);
            rep2(i,1,n)
            {
                rep2(ile,0,n) dp2[i][ile] = 0;
                ll cur_sum = 0;
                for(int j = i; j >= 1; j--)
                {
                    cur_sum += arr[j];
                    rep2(ile,1,n)
                    {
                        if((cur_sum & not_take) == 0)
                        {
                            dp2[i][ile] = dp2[i][ile] || dp2[j-1][ile-1];
                        }
                    }
                }
            }
            bool is = 0;
            rep2(i,a,b) if(dp2[n][i] == 1) is = 1;
            if(!is) not_take -= (1LL << bit);
        }
        cout << total - not_take << "\n";
    }
}

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