Submission #1166332

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166332		escobrand	K blocks (IZhO14_blocks)	C++20	100 / 100	337 ms	75180 KiB

blocks

#include <bits/stdc++.h>

using namespace std;
#define all(v) v.begin(),v.end()
#define eb push_back
#define ll long long
#define fi first
#define se second
int t,n,i,k,j;
const int maxn = 1e6 + 10,maxk = 110,inf = 1e9 + 500;
int a[maxn],dp[maxn][maxk];
stack<pair<int,int>> st[maxk];
vector<pair<int,int>> v[maxk];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin>>n>>k;

    for(i = 1;i<=k;i++)
    {
      dp[0][i] = inf;
      st[i].push({inf,0});
      v[i].eb({0,-100000});
    }
    v[0].eb({0,-100000});
    for(i = 1;i<=n;i++)
    {
      dp[i][0] = inf;
      cin>>a[i];

      for(j = k;j;j--)
      {
        dp[i][j] = inf;
        if(j <= i)
        {
          while(st[j].top().fi <= a[i] && st[j].size() > j)
          {
            st[j].pop();
          }
          if(i == j)
          {
            dp[i][j] = dp[i-1][j-1] + a[i];
          }
          
          int l = 1,r = v[j-1].size() - 1;
          while(l < r)
          {
            int m = (l + r)/2;
            if(v[j-1][m].fi >= st[j].top().se)r = m;
            else l = m + 1;
          }
          if(v[j-1][l].fi >= st[j].top().se)dp[i][j] = min(dp[i][j],v[j-1][l].se + a[i]);
          
          // for(int l = i-1;l >= st[j].top().se;l--)dp[i][j] = min(dp[i][j] , dp[l][j-1] + a[i]);
          
          if(st[j].top().fi > a[i])dp[i][j] = min(dp[i][j], dp[ st[j].top().se ][j]);
        }
        st[j].push({a[i],i});
        while(v[j].back().fi <=i && v[j].back().se >= dp[i][j])v[j].pop_back();
        v[j].eb({i,dp[i][j]});
      }
    }
    
    // for(j = 0;j<=k;j++)
    // {
    //   for(i = 0;i<=n;i++)
    //   {
    //     cout<<(dp[i][j] >= 1e9 ? -1 : dp[i][j])<<' ';
    //   }
    //   cout<<'\n';
    // }
    
    // for(j  = 0;j<=k;j++)
    // {
    //   for(auto l : v[j])cout<<l.fi<<' '<<l.se<<'\n';
    //   cout<<'\n';
    // }

    cout<<dp[n][k];
    return 0;
}

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