oj.uz

Submission #474560

# Submission time Handle Problem Language Result Execution time Memory
474560 2021-09-19T03:19:55 Z PurpleCrayon Feast (NOI19_feast) C++17
100 / 100
 674 ms 14508 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int MAXN = 3e5+10, MOD = 1e9+7;
 
using ld = long double;
#define double ld
 
int n, k;
ll a[MAXN], ps[MAXN];
pair<double, ll> dp[MAXN];
 
pair<double, ll> v(double x) { // cnt, cost
    fill(dp, dp+n, make_pair(0., 0ll));
    pair<double, ll> prv{0., 0};
    for (int i = 0; i < n; i++) {
        if (i) dp[i] = dp[i-1];
        // {ps[i] - ps[j] + dp[j].first, dp[j].second + 1}
        dp[i] = max(dp[i], make_pair(prv.first + ps[i] - x, prv.second + 1));
        prv = max(prv, make_pair(-ps[i] + dp[i].first, dp[i].second));
    }
    return dp[n-1];
}
void solve() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) ps[i] = a[i] + (i ? ps[i-1] : 0);
 
    bool bad = 0;
    for (int i = 0; i < n; i++) if (a[i] < 0) bad = 1;
    if (!bad) {
        cout << ps[n-1] << '\n';
        return;
    }
 
 
    double lo = 0, hi = 1e18;
    for (int rep = 0; rep < 80; rep++) {
        double mid = (lo + hi) / 2;
        if (v(mid).second >= k) lo = mid;
        else hi = mid;
    }
    double opt = lo;
    auto [ans, cnt] = v(opt);
    ans += opt * cnt;
    cout << llround(ans) << '\n';
}
int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    int T=1;
    //cin >> T;
    while (T--) solve();
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4804 KB Output is correct
2 Correct 38 ms 4912 KB Output is correct
3 Correct 38 ms 4920 KB Output is correct
4 Correct 38 ms 4868 KB Output is correct
5 Correct 39 ms 4940 KB Output is correct
6 Correct 37 ms 4848 KB Output is correct
7 Correct 37 ms 4868 KB Output is correct
8 Correct 38 ms 4856 KB Output is correct
9 Correct 38 ms 4804 KB Output is correct
10 Correct 37 ms 4804 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 497 ms 14048 KB Output is correct
2 Correct 528 ms 14468 KB Output is correct
3 Correct 501 ms 14024 KB Output is correct
4 Correct 514 ms 14156 KB Output is correct
5 Correct 525 ms 14020 KB Output is correct
6 Correct 517 ms 13960 KB Output is correct
7 Correct 528 ms 14424 KB Output is correct
8 Correct 552 ms 14200 KB Output is correct
9 Correct 511 ms 13932 KB Output is correct
10 Correct 520 ms 14280 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 595 ms 14232 KB Output is correct
2 Correct 559 ms 14048 KB Output is correct
3 Correct 565 ms 14148 KB Output is correct
4 Correct 584 ms 14060 KB Output is correct
5 Correct 578 ms 14184 KB Output is correct
6 Correct 573 ms 14276 KB Output is correct
7 Correct 582 ms 14264 KB Output is correct
8 Correct 577 ms 14184 KB Output is correct
9 Correct 583 ms 14360 KB Output is correct
10 Correct 577 ms 14344 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 5 ms 332 KB Output is correct
22 Correct 5 ms 416 KB Output is correct
23 Correct 5 ms 332 KB Output is correct
24 Correct 5 ms 332 KB Output is correct
25 Correct 5 ms 332 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 5 ms 332 KB Output is correct
28 Correct 4 ms 424 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 4 ms 412 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4804 KB Output is correct
2 Correct 38 ms 4912 KB Output is correct
3 Correct 38 ms 4920 KB Output is correct
4 Correct 38 ms 4868 KB Output is correct
5 Correct 39 ms 4940 KB Output is correct
6 Correct 37 ms 4848 KB Output is correct
7 Correct 37 ms 4868 KB Output is correct
8 Correct 38 ms 4856 KB Output is correct
9 Correct 38 ms 4804 KB Output is correct
10 Correct 37 ms 4804 KB Output is correct
11 Correct 497 ms 14048 KB Output is correct
12 Correct 528 ms 14468 KB Output is correct
13 Correct 501 ms 14024 KB Output is correct
14 Correct 514 ms 14156 KB Output is correct
15 Correct 525 ms 14020 KB Output is correct
16 Correct 517 ms 13960 KB Output is correct
17 Correct 528 ms 14424 KB Output is correct
18 Correct 552 ms 14200 KB Output is correct
19 Correct 511 ms 13932 KB Output is correct
20 Correct 520 ms 14280 KB Output is correct
21 Correct 595 ms 14232 KB Output is correct
22 Correct 559 ms 14048 KB Output is correct
23 Correct 565 ms 14148 KB Output is correct
24 Correct 584 ms 14060 KB Output is correct
25 Correct 578 ms 14184 KB Output is correct
26 Correct 573 ms 14276 KB Output is correct
27 Correct 582 ms 14264 KB Output is correct
28 Correct 577 ms 14184 KB Output is correct
29 Correct 583 ms 14360 KB Output is correct
30 Correct 577 ms 14344 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 2 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 5 ms 332 KB Output is correct
52 Correct 5 ms 416 KB Output is correct
53 Correct 5 ms 332 KB Output is correct
54 Correct 5 ms 332 KB Output is correct
55 Correct 5 ms 332 KB Output is correct
56 Correct 5 ms 332 KB Output is correct
57 Correct 5 ms 332 KB Output is correct
58 Correct 4 ms 424 KB Output is correct
59 Correct 4 ms 332 KB Output is correct
60 Correct 4 ms 412 KB Output is correct
61 Correct 640 ms 14036 KB Output is correct
62 Correct 651 ms 14508 KB Output is correct
63 Correct 603 ms 14152 KB Output is correct
64 Correct 663 ms 14400 KB Output is correct
65 Correct 674 ms 14392 KB Output is correct
66 Correct 665 ms 14356 KB Output is correct
67 Correct 660 ms 14232 KB Output is correct
68 Correct 585 ms 14408 KB Output is correct
69 Correct 600 ms 14208 KB Output is correct
70 Correct 572 ms 14080 KB Output is correct