Submission #1032235

#	Time	Username	Problem	Language	Result	Execution time	Memory
1032235		hasan2006	K blocks (IZhO14_blocks)	C++17	0 / 100	0 ms	348 KiB

blocks

#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 1e5 + 9 , mod = 1e9 + 7;
ll a[N] , b[N] , dp[N] , c[N] ,d[N] ;

void solve()
{
    ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
    cin>>n>>k;
    set<pair<int,int>>st;
    for(i = 1;i  <= n; i++){
        cin>>a[i];
        st.insert({a[i] , -i});
        auto it = st.upper_bound({a[i] , 0});
        if(it != st.end())
            b[i] = -it->se;
        c[i] = 1e15;
    }
    for(i = 1; i <= k; i++){
        for(j = 1; j <= n; j++)
        dp[j] = 1e15;
        for(j = i; j <= n; j++){
            x = max(i - 2 , b[j] - 1);
            if(b[j] >= i)
                dp[j] = dp[b[j]];
            if(a[i] <= a[i])
            dp[j] = d[j - 1] + a[i];
            //dp[j] = min(dp[j] , a[j] + c[x + 1]);
            //cout<<dp[j]<<" ";
        }
        //cout<<dp[n]<<"\n";
        c[n + 1] = 1e15;
        for(j = n; j >= 1; j--)
            c[j] = min(dp[j] , c[j + 1]) , d[j] = dp[j];

    }
    cout<<dp[n]<<"\n";
}

int main(){
    TL;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    int t = 1;
//    cin>>t;
    while(t--)
     {
        solve();
     }
}
// Author : حسن

Compilation message (stderr)

blocks.cpp: In function 'void solve()':
blocks.cpp:44:21: warning: self-comparison always evaluates to true [-Wtautological-compare]
   44 |             if(a[i] <= a[i])
      |                ~~~~ ^~ ~~~~
blocks.cpp:26:12: warning: unused variable 'q' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |            ^
blocks.cpp:26:23: warning: unused variable 'l' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                       ^
blocks.cpp:26:26: warning: unused variable 'r' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                          ^
blocks.cpp:26:30: warning: variable 'x' set but not used [-Wunused-but-set-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                              ^
blocks.cpp:26:34: warning: unused variable 'y' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                  ^
blocks.cpp:26:38: warning: unused variable 's' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                      ^
blocks.cpp:26:46: warning: unused variable 'f' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                              ^
blocks.cpp:26:54: warning: unused variable 'm' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                      ^
blocks.cpp:26:58: warning: unused variable 'mn' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                          ^~
blocks.cpp:26:69: warning: unused variable 'mx' [-Wunused-variable]
   26 |     ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mn = 1e18, mx = 0 ;
      |                                                                     ^~

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