oj.uz

Submission #917729

# Submission time Handle Problem Language Result Execution time Memory
917729 2024-01-28T16:51:59 Z tarche Feast (NOI19_feast) C++17
100 / 100
 992 ms 24216 KB 
// @tarche
// Feast
// OJUZ
// Singapore NOI 2019
// https://oj.uz/problem/view/NOI19_feast
// 2024-01-28
#include <bits/stdc++.h>
#define forn(i, n) for (tint i = 0; i < tint(n); i++)
#define forsn(i, s, n) for (tint i = s; i < tint(n); i++)
#define dforn(i, n) for (tint i = tint(n) - 1; i >= 0; i--)
#define dforsn(i, s, n) for (tint i = tint(n) - 1; i >= s; i--)
#define sz(x) tint(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define DBG(x) cerr << #x << " = " << x << endl

using namespace std;

#ifndef SMALL_TINT
using tint = long long;
#else
using tint = int;
#endif
using vi = vector<tint>;
using pii = pair<tint, tint>;

inline void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}

inline string YN(bool x, string y = "YES", string n = "NO") { return (x ? y : n); }

template <typename T>
inline void chmax(T &lhs, T rhs) {
  lhs = max(lhs, rhs);
}

template <typename T>
inline void chmin(T &lhs, T rhs) {
  lhs = min(lhs, rhs);
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[";
  forn(i, sz(v)) {
    if (i > 0) os << ", ";
    os << v[i];
  }
  os << "]";
  return os;
}

template <typename T, size_t N>
ostream &operator<<(ostream &os, const array<T, N> &v) {
  os << "[";
  forn(i, N) {
    if (i > 0) os << ", ";
    os << v[i];
  }
  os << "]";
  return os;
}

const tint INF = 1e18;
pii solve(const vi &nums, tint lambda) {
  tint n = sz(nums);
  vector<vector<pii>> dp(n + 1, vector<pii>(2, {-INF, 0}));
  dp[0][0].first = 0;

  forn(i, n) {
    chmax(dp[i + 1][0], dp[i][0]);
    chmax(dp[i + 1][0], dp[i][1]);
    chmax(dp[i + 1][1], {dp[i][1].first + nums[i], dp[i][1].second});
    if (dp[i + 1][0].first > -INF) {
      chmax(dp[i + 1][1], {dp[i][0].first + nums[i] - lambda, dp[i][0].second - 1});
    }
  }

  pii ans = max(dp[n][0], dp[n][1]);
  ans.second = -ans.second;
  ans.first += lambda * ans.second;
  return ans;
}

int main() {
  fastIO();

  tint n, k;
  cin >> n >> k;
  vi nums(n);
  forn(i, n) cin >> nums[i];

  tint lo = 0, hi = n * *max_element(all(nums));
  while (hi - lo > 1) {
    tint lambda = (hi + lo) / 2;
    if (solve(nums, lambda).second <= k) {
      hi = lambda;
    } else {
      lo = lambda;
    }
  }

  cout << solve(nums, hi).first << '\n';
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 958 ms 23476 KB Output is correct
2 Correct 906 ms 23680 KB Output is correct
3 Correct 992 ms 24120 KB Output is correct
4 Correct 948 ms 24192 KB Output is correct
5 Correct 895 ms 23664 KB Output is correct
6 Correct 928 ms 23372 KB Output is correct
7 Correct 848 ms 23584 KB Output is correct
8 Correct 921 ms 23912 KB Output is correct
9 Correct 899 ms 23708 KB Output is correct
10 Correct 867 ms 23832 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 521 ms 23692 KB Output is correct
2 Correct 533 ms 23936 KB Output is correct
3 Correct 534 ms 23380 KB Output is correct
4 Correct 540 ms 23612 KB Output is correct
5 Correct 895 ms 23300 KB Output is correct
6 Correct 512 ms 23328 KB Output is correct
7 Correct 536 ms 23968 KB Output is correct
8 Correct 904 ms 24116 KB Output is correct
9 Correct 854 ms 23588 KB Output is correct
10 Correct 539 ms 23900 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 929 ms 23688 KB Output is correct
2 Correct 917 ms 23656 KB Output is correct
3 Correct 898 ms 23684 KB Output is correct
4 Correct 928 ms 23488 KB Output is correct
5 Correct 915 ms 23940 KB Output is correct
6 Correct 911 ms 24196 KB Output is correct
7 Correct 936 ms 24140 KB Output is correct
8 Correct 906 ms 23720 KB Output is correct
9 Correct 920 ms 24216 KB Output is correct
10 Correct 935 ms 24076 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 604 KB Output is correct
23 Correct 3 ms 604 KB Output is correct
24 Correct 3 ms 604 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 3 ms 604 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 3 ms 604 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 958 ms 23476 KB Output is correct
2 Correct 906 ms 23680 KB Output is correct
3 Correct 992 ms 24120 KB Output is correct
4 Correct 948 ms 24192 KB Output is correct
5 Correct 895 ms 23664 KB Output is correct
6 Correct 928 ms 23372 KB Output is correct
7 Correct 848 ms 23584 KB Output is correct
8 Correct 921 ms 23912 KB Output is correct
9 Correct 899 ms 23708 KB Output is correct
10 Correct 867 ms 23832 KB Output is correct
11 Correct 521 ms 23692 KB Output is correct
12 Correct 533 ms 23936 KB Output is correct
13 Correct 534 ms 23380 KB Output is correct
14 Correct 540 ms 23612 KB Output is correct
15 Correct 895 ms 23300 KB Output is correct
16 Correct 512 ms 23328 KB Output is correct
17 Correct 536 ms 23968 KB Output is correct
18 Correct 904 ms 24116 KB Output is correct
19 Correct 854 ms 23588 KB Output is correct
20 Correct 539 ms 23900 KB Output is correct
21 Correct 929 ms 23688 KB Output is correct
22 Correct 917 ms 23656 KB Output is correct
23 Correct 898 ms 23684 KB Output is correct
24 Correct 928 ms 23488 KB Output is correct
25 Correct 915 ms 23940 KB Output is correct
26 Correct 911 ms 24196 KB Output is correct
27 Correct 936 ms 24140 KB Output is correct
28 Correct 906 ms 23720 KB Output is correct
29 Correct 920 ms 24216 KB Output is correct
30 Correct 935 ms 24076 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 360 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 3 ms 604 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 3 ms 604 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 3 ms 604 KB Output is correct
58 Correct 3 ms 604 KB Output is correct
59 Correct 3 ms 604 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 955 ms 23396 KB Output is correct
62 Correct 948 ms 24036 KB Output is correct
63 Correct 894 ms 23444 KB Output is correct
64 Correct 916 ms 23960 KB Output is correct
65 Correct 918 ms 23804 KB Output is correct
66 Correct 904 ms 23984 KB Output is correct
67 Correct 939 ms 23328 KB Output is correct
68 Correct 950 ms 23876 KB Output is correct
69 Correct 932 ms 23500 KB Output is correct
70 Correct 904 ms 23260 KB Output is correct