Submission #1073418

#	Time	Username	Problem	Language	Result	Execution time	Memory
1073418		steveonalex	K blocks (IZhO14_blocks)	C++17	100 / 100	154 ms	5188 KiB

blocks

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, k; cin >> n >> k;
    vector<ll> a(n+1);
    for(int i= 1; i<=n; ++i) cin >> a[i];

    vector<ll> b(n+1, INF);
    b[0] = 0;

    for(int iteration = 1; iteration<=k; ++iteration) {
        vector<int> st;
        vector<ll> val, pref;
        vector<ll> c(n+1, INF);

        for(int i = iteration; i<=n; ++i){
            ll cur = a[i] + b[i-1];
            while(st.size() && st.back() <= a[i]){
                int u = st.back(); 
                minimize(cur, val.back() + a[i] - u);
                st.pop_back(); val.pop_back(); pref.pop_back();
            }
            st.push_back(a[i]);
            val.push_back(cur);
            if (pref.size()) pref.push_back(min(pref.back(), cur));
            else pref.push_back(cur);

            c[i] = pref.back();
        }

        b = c;
    }

    cout << b.back() << "\n";
    // printArr(b);
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 18 / 18
• Subtask 3: 21 / 21
• Subtask 4: 47 / 47