oj.uz

답안 #500107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
500107 2021-12-30T10:30:38 Z acm K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 0 ms 332 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m, a[200005], b[200005], c[200005][18], dp[200005][105];
vector<ll> v;
ll get(ll l, ll r, ll x) {
  l = max(l, x);
  ll y = __lg(r - l + 1);
  return min(c[l][y], c[r - (1 << y) + 1][y]);
}
void kek(ll k) {
  for (int i = 0; i <= __lg(n); i++)
    for (int j = 0; j + (1 << i) <= n; j++)
      c[j][i] =
          (i ? dp[j][k - 1] : min(c[j][i - 1], c[j + (1 << (i - 1))][i - 1]));
  for (int i = 0; i < k; i++) dp[i][k] = (1LL << 60);
  for (int i = k; i <= n; i++)
    dp[i][k] = min(get(b[i], i - 1, k - 1) + a[i], dp[b[i]][k]);
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    dp[i][1] = max(dp[i - 1][1], a[i]);
    while (sz(v) && a[v.back()] < a[i]) v.pop_back();
    b[i] = (sz(v) ? v.back() : 0);
    v.pb(i);
  }
  for (int i = 2; i <= m; i++) kek(i);
  cout << dp[n][m];
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

blocks.cpp: In function 'void ioi(std::string)':
blocks.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp: In function 'void kek(long long int)':
blocks.cpp:40:75: warning: array subscript -1 is below array bounds of 'long long int [18]' [-Warray-bounds]
   40 |           (i ? dp[j][k - 1] : min(c[j][i - 1], c[j + (1 << (i - 1))][i - 1]));
      |                                                ~~~~~~~~~~~~~~~~~~~~~~~~~~~^
blocks.cpp:40:75: warning: array subscript -1 is below array bounds of 'long long int [18]' [-Warray-bounds]

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Incorrect 0 ms 332 KB Output isn't correct
5 Halted 0 ms 0 KB -