oj.uz

Submission #947376

# Submission time Handle Problem Language Result Execution time Memory
947376 2024-03-16T04:24:11 Z SirCovidThe19th Feast (NOI19_feast) C++17
12 / 100
 176 ms 10968 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

const ll INF = (ll)300000 * 1000000000;

int main(){
    int n, k;
    cin >> n >> k;

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

    auto solveLambda = [&](ll lmb){
        pair<ll, ll> dp[n + 1][2];

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

            dp[i][1] = max(
                make_pair(dp[i - 1][0].first + a[i] - lmb, dp[i - 1][0].second + 1), 
                make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second)
            );
        }
        return max(dp[n][0], dp[n][1]);
    };

    ll lo = 0, hi = INT64_MAX;

    while (lo < hi){
        ll mid = (lo + hi) / 2;
        solveLambda(mid).second <= k ? hi = mid : lo = mid + 1;
    }    
    cout << solveLambda(lo).first + lo * k << endl;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 10656 KB Output is correct
2 Correct 152 ms 10844 KB Output is correct
3 Correct 156 ms 10796 KB Output is correct
4 Correct 164 ms 10804 KB Output is correct
5 Correct 154 ms 10796 KB Output is correct
6 Correct 152 ms 10652 KB Output is correct
7 Correct 151 ms 10520 KB Output is correct
8 Correct 155 ms 10856 KB Output is correct
9 Correct 158 ms 10668 KB Output is correct
10 Correct 152 ms 10780 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 10676 KB Output is correct
2 Correct 114 ms 10832 KB Output is correct
3 Correct 110 ms 10700 KB Output is correct
4 Correct 114 ms 10576 KB Output is correct
5 Correct 148 ms 10504 KB Output is correct
6 Correct 116 ms 10684 KB Output is correct
7 Correct 117 ms 10968 KB Output is correct
8 Correct 149 ms 10780 KB Output is correct
9 Correct 152 ms 10624 KB Output is correct
10 Correct 112 ms 10804 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 176 ms 10832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 10656 KB Output is correct
2 Correct 152 ms 10844 KB Output is correct
3 Correct 156 ms 10796 KB Output is correct
4 Correct 164 ms 10804 KB Output is correct
5 Correct 154 ms 10796 KB Output is correct
6 Correct 152 ms 10652 KB Output is correct
7 Correct 151 ms 10520 KB Output is correct
8 Correct 155 ms 10856 KB Output is correct
9 Correct 158 ms 10668 KB Output is correct
10 Correct 152 ms 10780 KB Output is correct
11 Correct 109 ms 10676 KB Output is correct
12 Correct 114 ms 10832 KB Output is correct
13 Correct 110 ms 10700 KB Output is correct
14 Correct 114 ms 10576 KB Output is correct
15 Correct 148 ms 10504 KB Output is correct
16 Correct 116 ms 10684 KB Output is correct
17 Correct 117 ms 10968 KB Output is correct
18 Correct 149 ms 10780 KB Output is correct
19 Correct 152 ms 10624 KB Output is correct
20 Correct 112 ms 10804 KB Output is correct
21 Incorrect 176 ms 10832 KB Output isn't correct
22 Halted 0 ms 0 KB -