Submission #393018

#	Time	Username	Problem	Language	Result	Execution time	Memory
393018		SavicS	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	156 ms	16076 KiB

sculpture

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 2005;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, A, B;
ll niz[maxn];

int dp[maxn][maxn];

int pd[maxn];
bool da_li(ll X) {

    if(A == 1) {
        memset(pd, inf, sizeof(pd));
        pd[0] = 0;
        ff(i,1,n) {
            ll zbir = 0;
            fb(j,i,1) {
                zbir += niz[j];
                if(!(zbir & (~X)))pd[i] = min(pd[i], pd[j - 1] + 1);
            }
        }

        return pd[n] <= B;

    }

    memset(dp, 0, sizeof(dp));

    dp[0][0] = 1;
    ff(i,1,n) {
        ff(j,1,B) {
            ll zbir = 0;
            fb(l,i,1) {
                zbir += niz[l];
                if(!(zbir & (~X)))dp[i][j] |= dp[l - 1][j - 1];
            }
        }
    }

    ff(i,A,B) {
        if(dp[n][i] == 1)return 1;
    }
    return 0;

}

int main() 
{
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    cin >> n >> A >> B;
    ff(i,1,n)cin >> niz[i];

    ll rez = (1ll << 41) - 1;
    fb(mask,40,0) {
        if(da_li(rez ^ (1ll << mask)))rez ^= (1ll << mask);
    }

    cout << rez << endl;

    return 0;
}
/**

6 1 3
8 1 2 1 5 4

// probati bojenje sahovski ili slicno

**/

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