Submission #1104551

#	Time	Username	Problem	Language	Result	Execution time	Memory
1104551		Whisper	Liteh and Newfiteh (INOI20_litehfiteh)	C++17	100 / 100	201 ms	284792 KiB

Main

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                         100005
#define LOG                             17

int nArr;
int A[MAX];


int cost[MAX][LOG];
int dp[LOG + 2][MAX][LOG + 2];
int new_dp[MAX];
void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];
    for (int i = 1; i <= nArr; ++i){
        if(A[i] > LOG) return void(cout << -1);
    }
    memset(dp, 0x3f, sizeof dp);
    for (int i = 1; i <= nArr; ++i){
        dp[0][i][A[i]] = 0;
        if(A[i] > 0)
            dp[0][i][A[i] - 1] = 1;
    }

    for (int l = 1; MASK(l) <= nArr; ++l){
        for (int i = 1; i <= nArr; ++i){
            int m = i + MASK(l - 1);
            for (int value = 0; value < LOG; ++value){
                minimize(dp[l][i][value], dp[l - 1][i][value + 1] + dp[l - 1][m][value + 1] + 1);
                minimize(dp[l][i][value], dp[l - 1][i][value] + dp[l - 1][m][value]);
            }
        }
    }

    memset(new_dp, 0x3f, sizeof new_dp);
    new_dp[0] = 0;

    for (int i = 1; i <= nArr; ++i){
        for (int l = 0; i - MASK(l) >= 0; ++l){
            minimize(new_dp[i], new_dp[i - MASK(l)] + dp[l][i - MASK(l) + 1][0]);
        }
    }
    cout << (new_dp[nArr] >= INF ? -1 : new_dp[nArr]);
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70