oj.uz

Submission #830828

# Submission time Handle Problem Language Result Execution time Memory
830828 2023-08-19T11:05:19 Z GrindMachine Feast (NOI19_feast) C++17
100 / 100
 151 ms 12756 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
http://www.serbanology.com/vault/The%20Trick%20From%20Aliens

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    vector<ll> pref(n+5);
    rep1(i,n) pref[i] = pref[i-1] + a[i];

    auto get = [&](ll lambda) -> pair<ld,ll>{
        vector<pair<ll,ll>> dp(n+5);
        pair<ll,ll> best = {0,0};

        rep1(i,n){
            // do nothing
            dp[i] = dp[i-1];

            // put in subarray
            pair<ll,ll> px = {pref[i]+best.ff-lambda,best.ss+1};
            amax(dp[i],px);

            px = {-pref[i]+dp[i].ff,dp[i].ss};
            amax(best,px);
        }

        return dp[n];
    };

    ll l = 0, r = inf1*n;
    ll lambda = -1;

    while(l <= r){
        ll mid = (l+r)/2;
        if(get(mid).ss <= k){
            lambda = mid;
            r = mid-1;
        }
        else{
            l = mid+1;
        }
    }

    auto [sum,cnt] = get(lambda);
    ll ans = sum + cnt*lambda;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 9428 KB Output is correct
2 Correct 60 ms 9544 KB Output is correct
3 Correct 65 ms 9640 KB Output is correct
4 Correct 71 ms 9628 KB Output is correct
5 Correct 60 ms 9556 KB Output is correct
6 Correct 71 ms 9376 KB Output is correct
7 Correct 60 ms 9396 KB Output is correct
8 Correct 73 ms 9560 KB Output is correct
9 Correct 59 ms 9440 KB Output is correct
10 Correct 60 ms 9560 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 9436 KB Output is correct
2 Correct 66 ms 9696 KB Output is correct
3 Correct 60 ms 9468 KB Output is correct
4 Correct 58 ms 9560 KB Output is correct
5 Correct 75 ms 9460 KB Output is correct
6 Correct 61 ms 9464 KB Output is correct
7 Correct 59 ms 9636 KB Output is correct
8 Correct 61 ms 9564 KB Output is correct
9 Correct 59 ms 9388 KB Output is correct
10 Correct 59 ms 9656 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 9596 KB Output is correct
2 Correct 90 ms 9484 KB Output is correct
3 Correct 96 ms 9568 KB Output is correct
4 Correct 88 ms 9484 KB Output is correct
5 Correct 94 ms 9572 KB Output is correct
6 Correct 100 ms 9628 KB Output is correct
7 Correct 91 ms 9660 KB Output is correct
8 Correct 93 ms 9572 KB Output is correct
9 Correct 89 ms 9644 KB Output is correct
10 Correct 89 ms 9652 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
11.0 / 11.0

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

Subtask #6
20.0 / 20.0

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

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 9428 KB Output is correct
2 Correct 60 ms 9544 KB Output is correct
3 Correct 65 ms 9640 KB Output is correct
4 Correct 71 ms 9628 KB Output is correct
5 Correct 60 ms 9556 KB Output is correct
6 Correct 71 ms 9376 KB Output is correct
7 Correct 60 ms 9396 KB Output is correct
8 Correct 73 ms 9560 KB Output is correct
9 Correct 59 ms 9440 KB Output is correct
10 Correct 60 ms 9560 KB Output is correct
11 Correct 64 ms 9436 KB Output is correct
12 Correct 66 ms 9696 KB Output is correct
13 Correct 60 ms 9468 KB Output is correct
14 Correct 58 ms 9560 KB Output is correct
15 Correct 75 ms 9460 KB Output is correct
16 Correct 61 ms 9464 KB Output is correct
17 Correct 59 ms 9636 KB Output is correct
18 Correct 61 ms 9564 KB Output is correct
19 Correct 59 ms 9388 KB Output is correct
20 Correct 59 ms 9656 KB Output is correct
21 Correct 90 ms 9596 KB Output is correct
22 Correct 90 ms 9484 KB Output is correct
23 Correct 96 ms 9568 KB Output is correct
24 Correct 88 ms 9484 KB Output is correct
25 Correct 94 ms 9572 KB Output is correct
26 Correct 100 ms 9628 KB Output is correct
27 Correct 91 ms 9660 KB Output is correct
28 Correct 93 ms 9572 KB Output is correct
29 Correct 89 ms 9644 KB Output is correct
30 Correct 89 ms 9652 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 316 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 320 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 324 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 316 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 316 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 130 ms 12444 KB Output is correct
62 Correct 136 ms 12756 KB Output is correct
63 Correct 103 ms 12416 KB Output is correct
64 Correct 124 ms 12672 KB Output is correct
65 Correct 151 ms 12652 KB Output is correct
66 Correct 143 ms 12600 KB Output is correct
67 Correct 147 ms 12440 KB Output is correct
68 Correct 106 ms 12612 KB Output is correct
69 Correct 99 ms 12412 KB Output is correct
70 Correct 101 ms 12368 KB Output is correct