제출 #1173638

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173638		MPG	K blocks (IZhO14_blocks)	C++20	53 / 100	1093 ms	5444 KiB

blocks

//#pragma GCC optomize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2") 



#include <bits/stdc++.h>
using namespace std;
typedef long long       ll;
#define     max_heap priority_queue<pair <ll, pair <ll, ll>>>
//#define     min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
#define     min_heap priority_queue<pair <ll, pair <ll, ll>>, vector<pair <ll, pair <ll, ll>>>, greater<pair <ll, pair <ll, ll>>>>

#define     sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define     filE freopen("in.txt", "r", stdin);// freopen("out1.txt", "w", stdout); 
#define     endl '\n'
#define     md(a) (a % mod + mod) % mod
#define     pb push_back
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//cout << setprecision(5) << fixed << f;
//hash prime = 769


ll const maxn = 2e5 + 123;
ll const inf = 3e18;
ll const loG = 18; // 23
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 500;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}



ll n, k, arr[maxn], dp[maxn][2], chap[maxn], sz = 2;
vector <ll> seg;

void setter(ll i, ll val, ll x, ll lx, ll rx){
    if (rx - lx == 1){
        seg[x] = val;
        return;
    }
    ll mid = (lx + rx) / 2, a = 2 * x + 1, b = a + 1;
    if (i < mid)
        setter(i, val, a, lx, mid);
    else
        setter(i, val, b, mid, rx);
    seg[x] = min(seg[a], seg[b]);
}

ll get(ll l, ll r, ll x, ll lx, ll rx){
    if (l >= rx || lx >= r)
        return inf;
    if (l <= lx && rx <= r)
        return seg[x];
    ll mid = (lx + rx) / 2, a = 2 * x + 1, b = a + 1;
    ll val1 = get(l, r, a, lx, mid);
    ll val2 = get(l, r, b, mid, rx);
    return min(val1, val2);
}




void Solve(){

cin >> n >> k;
while (sz <= n)
    sz = sz * 2;
seg.resize(2 * sz);
for (int i = 0; i < seg.size(); i++)
    seg[i] = inf;



for (int i = 1; i < n + 1; i++)
    cin >> arr[i];
vector <ll> stk; stk.clear();
for (int i = 1; i < n + 1; i++){
    while (stk.size() && arr[stk.back()] <= arr[i])
        stk.pop_back();
    if (stk.size()){
        chap[i] = stk.back();
    }
    stk.pb(i);
}

for (int i = 1; i < n + 1; i++){
    dp[i][0] = max(dp[i - 1][0], arr[i]);
    setter(i, dp[i][0], 0, 0, sz);
    dp[i][1] = inf;
}
dp[0][1] = inf;

for (int j = 2; j < k + 1; j++){
    for (int i = 1; i < n + 1; i++){
        dp[i][1] = min(get(chap[i], i, 0, 0, sz) + arr[i], dp[chap[i]][1]);
    }
    for (int i = 1; i < n + 1; i++){
        dp[i][0] = dp[i][1];
        setter(i, dp[i][0], 0, 0, sz);
        dp[i][1] = inf;
    }
}
cout << dp[n][0] << endl;

}



int main(){
sariE;
//filE;



int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}

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