제출 #807723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807723		farhan132	K blocks (IZhO14_blocks)	C++17	100 / 100	143 ms	4668 KiB

blocks

/***Farhan132***/
// #pragma GCC optimize("Ofast,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
const ll inf = numeric_limits<int>::max()-5;
const ll INF = (ll)2e18;
 
// ll dx[]={0,1,0,-1};
// ll dy[]={1,0,-1,0};
// ll dxx[]={0,1,0,-1,1,1,-1,-1};
// ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e5 + 5;

ll dp[2][N];
ll a[N], h[N];

void solve(){

    ll n, k; cin >> n >> k;

    ll row = 0;
    dp[row][0] = 0;

    for(ll i = 1; i <= n; i++){
        cin >> a[i];
        dp[row][i] = max(dp[row][i - 1], a[i]);
    }

    for(ll itr = 2; itr <= k; itr++){
        row ^= 1;
        stack < ll > st; ll mn = INF;
        for(ll i = 1; i <= n; i++){
            while(st.size() && a[st.top()] < a[i]){
             mn = min(mn, h[st.top()]);
             st.pop();
            }
            dp[row][i] = INF;
            ll j = 0;
            if(st.size()){
                dp[row][i] = min(dp[row][st.top()], dp[row^1][st.top()] + a[i]);
                j = st.top();
            }
            dp[row][i] = min(dp[row][i], mn + a[i]);
            h[i] = min(dp[row^1][i], mn); mn = INF;
            st.push(i);
        }
    }
    cout << dp[row][n] << '\n';


    
   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0; //cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
} 

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'void solve()':
blocks.cpp:70:16: warning: variable 'j' set but not used [-Wunused-but-set-variable]
   70 |             ll j = 0;
      |                ^
blocks.cpp: In function 'int main()':
blocks.cpp:101:15: warning: unused variable 'CT' [-Wunused-variable]
  101 |     ll T = 1, CT = 0; //cin >> T;
      |               ^~

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