Submission #526005

#	Time	Username	Problem	Language	Result	Execution time	Memory
526005		armashka	K blocks (IZhO14_blocks)	C++17	53 / 100	1092 ms	10644 KiB

blocks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 2e5 + 10;
const int M = 1e3 + 5;
const ll inf = 2e18;
const ll mod = 1e9 + 7;
const double Pi = acos(-1); 

ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

ll n, k, a[N], dp[N][105], mx[N][25], lg[N];

ll get(ll l, ll r) {
    ll len = r - l + 1, k = lg[len];
    return max(mx[l][k], mx[r - (1 << k) + 1][k]);

}

const void solve(/*Armashka*/) {
    cin >> n >> k;
    for (int i = 1; i <= n; ++ i) cin >> a[i], mx[i][0] = a[i];
    for (int i = 2; i <= n; ++ i) lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= 20; ++ i) {
        for (int j = 1; j + (1 << i) - 1 <= n; ++ j) {
            mx[j][i] = max(mx[j][i - 1], mx[j + (1 << (i - 1))][i - 1]);
        }
    }
    for (int i = 1; i <= n; ++ i) {
        for (int j = 0; j <= 100; ++ j) dp[i][j] = inf;
    }
    for (ll i = 1; i <= n; ++ i) {
        for (int bl = 1; bl <= min(i, k); ++ bl) {
            for (int j = bl; j <= i; ++ j) {
                dp[i][bl] = min(dp[i][bl], dp[j - 1][bl - 1] + get(j, i));
            }
        }
    }
    cout << dp[n][k];
}  
 
signed main() {
    srand(time(NULL));
    fast;
    // file("");
    int tt = 1;
    // cin >> tt;
    while (tt --) {                                                             
        solve();
    }                            
}
// Uaqyt, otedi, ketedi, mulde bilinbei, ulger
// Kunder seni kutpeidi, susyz ospeidi gulder

Compilation message (stderr)

blocks.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

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