Submission #588642

#	Time	Username	Problem	Language	Result	Execution time	Memory
588642		Sam_a17	K blocks (IZhO14_blocks)	C++14	100 / 100	284 ms	81664 KiB

blocks

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(stack <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\
const long long inf = 1e15;
const int N = 1e5 + 10, K = 1e2 + 10;
long long dp[K][N], a[N], n, k;

void solve_() {
  cin >> n >> k;

  for(int i = 1; i <= n; i++) {
    cin >> a[i];
  }

  for(int i = 1; i <= n; i++) {
    dp[1][i] = max(dp[1][i - 1], a[i]);
  }

  for(int i = 0; i <= k; i++) {
    for(int j = 0; j <= n; j++) {
      if(!dp[i][j]) {
        dp[i][j] = inf;
      }
    }
  }

  for(int i = 2; i <= k; i++) {
    deque<pair<int, long long>> st;

    for(int j = 1; j < i; j++) {
      if(dp[i - 1][j] == inf) continue;
      st.push_back({j, dp[i - 1][j]});
    }

    for(int j = i; j <= n; j++) {
      long long mini = dp[i - 1][j - 1];
      while(!st.empty() && a[st.back().first] <= a[j]) {
        mini = min(mini, st.back().second);
        st.pop_back();
      }

      // if(j == 5) {
      //   dbg(mini)
      //   dbg(st)
      // } 

      if(!st.empty()) {
        dp[i][j] = min(dp[i][j], dp[i][st.back().first]);
        dp[i][j] = min(dp[i][j], dp[i - 1][st.back().first] + a[j]);
      }
      st.push_back({j, mini});
      
      dp[i][j] = min(dp[i][j], mini + a[j]);
    }
  }

  printf("%d\n", dp[k][n]);
}
 
int main () {
  setIO("");
 
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1;
  solve(test_cases);
 
  return 0;
}

Compilation message (stderr)

blocks.cpp: In function 'void solve_()':
blocks.cpp:127:12: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  127 |   printf("%d\n", dp[k][n]);
      |           ~^     ~~~~~~~~
      |            |            |
      |            int          long long int
      |           %lld
blocks.cpp: In function 'void setIO(std::string)':
blocks.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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