oj.uz

Submission #925267

# Submission time Handle Problem Language Result Execution time Memory
925267 2024-02-11T09:17:21 Z 12345678 Feast (NOI19_feast) C++17
100 / 100
 96 ms 2976 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e5+5;
ll n, k, qs[nx];

pair<ll, ll> sol(ll c)
{
    pair<ll, int> mx(0, 0), dp(0, 0);
    for (int i=1; i<=n; i++)
    {
        dp=max(dp, {mx.first+qs[i]-c, mx.second+1});
        mx=max(mx, {dp.first-qs[i], dp.second});
        //cout<<i<<' '<<dp[i].first<<' '<<-dp[i].second<<'\n';
    }
    return dp;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1];
    ll l=0, r=3e14+5;
    while (l<r)
    {
        ll md=(l+r+1)/2;
        if (sol(md).second>=k) l=md;
        else r=md-1;
    }
    cout<<sol(l).first+k*l;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2720 KB Output is correct
2 Correct 36 ms 2652 KB Output is correct
3 Correct 37 ms 2688 KB Output is correct
4 Correct 37 ms 2692 KB Output is correct
5 Correct 37 ms 2756 KB Output is correct
6 Correct 45 ms 2652 KB Output is correct
7 Correct 36 ms 2652 KB Output is correct
8 Correct 38 ms 2652 KB Output is correct
9 Correct 37 ms 2904 KB Output is correct
10 Correct 36 ms 2648 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2652 KB Output is correct
2 Correct 39 ms 2780 KB Output is correct
3 Correct 48 ms 2976 KB Output is correct
4 Correct 33 ms 2648 KB Output is correct
5 Correct 43 ms 2700 KB Output is correct
6 Correct 36 ms 2648 KB Output is correct
7 Correct 34 ms 2652 KB Output is correct
8 Correct 44 ms 2652 KB Output is correct
9 Correct 43 ms 2648 KB Output is correct
10 Correct 33 ms 2652 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 2688 KB Output is correct
2 Correct 60 ms 2684 KB Output is correct
3 Correct 60 ms 2692 KB Output is correct
4 Correct 61 ms 2732 KB Output is correct
5 Correct 59 ms 2652 KB Output is correct
6 Correct 64 ms 2652 KB Output is correct
7 Correct 65 ms 2904 KB Output is correct
8 Correct 60 ms 2688 KB Output is correct
9 Correct 60 ms 2684 KB Output is correct
10 Correct 62 ms 2776 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2720 KB Output is correct
2 Correct 36 ms 2652 KB Output is correct
3 Correct 37 ms 2688 KB Output is correct
4 Correct 37 ms 2692 KB Output is correct
5 Correct 37 ms 2756 KB Output is correct
6 Correct 45 ms 2652 KB Output is correct
7 Correct 36 ms 2652 KB Output is correct
8 Correct 38 ms 2652 KB Output is correct
9 Correct 37 ms 2904 KB Output is correct
10 Correct 36 ms 2648 KB Output is correct
11 Correct 41 ms 2652 KB Output is correct
12 Correct 39 ms 2780 KB Output is correct
13 Correct 48 ms 2976 KB Output is correct
14 Correct 33 ms 2648 KB Output is correct
15 Correct 43 ms 2700 KB Output is correct
16 Correct 36 ms 2648 KB Output is correct
17 Correct 34 ms 2652 KB Output is correct
18 Correct 44 ms 2652 KB Output is correct
19 Correct 43 ms 2648 KB Output is correct
20 Correct 33 ms 2652 KB Output is correct
21 Correct 73 ms 2688 KB Output is correct
22 Correct 60 ms 2684 KB Output is correct
23 Correct 60 ms 2692 KB Output is correct
24 Correct 61 ms 2732 KB Output is correct
25 Correct 59 ms 2652 KB Output is correct
26 Correct 64 ms 2652 KB Output is correct
27 Correct 65 ms 2904 KB Output is correct
28 Correct 60 ms 2688 KB Output is correct
29 Correct 60 ms 2684 KB Output is correct
30 Correct 62 ms 2776 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 91 ms 2648 KB Output is correct
62 Correct 93 ms 2784 KB Output is correct
63 Correct 74 ms 2652 KB Output is correct
64 Correct 95 ms 2768 KB Output is correct
65 Correct 96 ms 2908 KB Output is correct
66 Correct 93 ms 2760 KB Output is correct
67 Correct 93 ms 2904 KB Output is correct
68 Correct 62 ms 2648 KB Output is correct
69 Correct 63 ms 2948 KB Output is correct
70 Correct 61 ms 2652 KB Output is correct