oj.uz

Submission #830841

# Submission time Handle Problem Language Result Execution time Memory
830841 2023-08-19T11:21:18 Z GrindMachine Feast (NOI19_feast) C++17
30 / 100
 897 ms 14392 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 = [&](ld lambda) -> pair<ld,ll>{
        vector<pair<ld,ll>> dp(n+5);
        pair<ld,ll> best = {0,0};
 
        rep1(i,n){
            // do nothing
            dp[i] = dp[i-1];
 
            // put in subarray
            pair<ld,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];
    };
 
    ld l = 0, r = inf1*n;
    ld lambda = -1;
 
    rep(iter,250){
        ld mid = (l+r)/2;
        if(get(mid).ss <= k){
            lambda = mid;
            r = mid;
        }
        else{
            l = mid;
        }
    }
 
    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 683 ms 13956 KB Output is correct
2 Correct 712 ms 14220 KB Output is correct
3 Correct 688 ms 14392 KB Output is correct
4 Correct 700 ms 14292 KB Output is correct
5 Correct 691 ms 14204 KB Output is correct
6 Correct 673 ms 14060 KB Output is correct
7 Correct 671 ms 13996 KB Output is correct
8 Correct 685 ms 14220 KB Output is correct
9 Correct 677 ms 14112 KB Output is correct
10 Correct 684 ms 14164 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 14068 KB Output is correct
2 Correct 691 ms 14284 KB Output is correct
3 Correct 665 ms 14036 KB Output is correct
4 Correct 680 ms 14272 KB Output is correct
5 Correct 646 ms 13992 KB Output is correct
6 Correct 663 ms 14032 KB Output is correct
7 Correct 706 ms 14392 KB Output is correct
8 Correct 658 ms 14304 KB Output is correct
9 Correct 646 ms 13948 KB Output is correct
10 Correct 698 ms 14324 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 888 ms 14252 KB Output is correct
2 Correct 891 ms 14080 KB Output is correct
3 Correct 880 ms 14204 KB Output is correct
4 Correct 875 ms 14072 KB Output is correct
5 Correct 878 ms 14240 KB Output is correct
6 Correct 887 ms 14328 KB Output is correct
7 Correct 893 ms 14336 KB Output is correct
8 Correct 876 ms 14200 KB Output is correct
9 Correct 889 ms 14380 KB Output is correct
10 Correct 897 ms 14344 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 683 ms 13956 KB Output is correct
2 Correct 712 ms 14220 KB Output is correct
3 Correct 688 ms 14392 KB Output is correct
4 Correct 700 ms 14292 KB Output is correct
5 Correct 691 ms 14204 KB Output is correct
6 Correct 673 ms 14060 KB Output is correct
7 Correct 671 ms 13996 KB Output is correct
8 Correct 685 ms 14220 KB Output is correct
9 Correct 677 ms 14112 KB Output is correct
10 Correct 684 ms 14164 KB Output is correct
11 Correct 720 ms 14068 KB Output is correct
12 Correct 691 ms 14284 KB Output is correct
13 Correct 665 ms 14036 KB Output is correct
14 Correct 680 ms 14272 KB Output is correct
15 Correct 646 ms 13992 KB Output is correct
16 Correct 663 ms 14032 KB Output is correct
17 Correct 706 ms 14392 KB Output is correct
18 Correct 658 ms 14304 KB Output is correct
19 Correct 646 ms 13948 KB Output is correct
20 Correct 698 ms 14324 KB Output is correct
21 Correct 888 ms 14252 KB Output is correct
22 Correct 891 ms 14080 KB Output is correct
23 Correct 880 ms 14204 KB Output is correct
24 Correct 875 ms 14072 KB Output is correct
25 Correct 878 ms 14240 KB Output is correct
26 Correct 887 ms 14328 KB Output is correct
27 Correct 893 ms 14336 KB Output is correct
28 Correct 876 ms 14200 KB Output is correct
29 Correct 889 ms 14380 KB Output is correct
30 Correct 897 ms 14344 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Incorrect 1 ms 212 KB Output isn't correct
37 Halted 0 ms 0 KB -