oj.uz

Submission #830840

# Submission time Handle Problem Language Result Execution time Memory
830840 2023-08-19T11:20:39 Z GrindMachine Feast (NOI19_feast) C++17
12 / 100
 1000 ms 14408 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,300){
        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 801 ms 13964 KB Output is correct
2 Correct 868 ms 14228 KB Output is correct
3 Correct 828 ms 14388 KB Output is correct
4 Correct 819 ms 14292 KB Output is correct
5 Correct 858 ms 14264 KB Output is correct
6 Correct 805 ms 13984 KB Output is correct
7 Correct 803 ms 13964 KB Output is correct
8 Correct 823 ms 14256 KB Output is correct
9 Correct 830 ms 14008 KB Output is correct
10 Correct 817 ms 14164 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 14104 KB Output is correct
2 Correct 846 ms 14408 KB Output is correct
3 Correct 815 ms 14032 KB Output is correct
4 Correct 822 ms 14164 KB Output is correct
5 Correct 794 ms 13984 KB Output is correct
6 Correct 802 ms 14036 KB Output is correct
7 Correct 885 ms 14404 KB Output is correct
8 Correct 835 ms 14316 KB Output is correct
9 Correct 767 ms 13880 KB Output is correct
10 Correct 824 ms 14328 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1068 ms 14244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 801 ms 13964 KB Output is correct
2 Correct 868 ms 14228 KB Output is correct
3 Correct 828 ms 14388 KB Output is correct
4 Correct 819 ms 14292 KB Output is correct
5 Correct 858 ms 14264 KB Output is correct
6 Correct 805 ms 13984 KB Output is correct
7 Correct 803 ms 13964 KB Output is correct
8 Correct 823 ms 14256 KB Output is correct
9 Correct 830 ms 14008 KB Output is correct
10 Correct 817 ms 14164 KB Output is correct
11 Correct 884 ms 14104 KB Output is correct
12 Correct 846 ms 14408 KB Output is correct
13 Correct 815 ms 14032 KB Output is correct
14 Correct 822 ms 14164 KB Output is correct
15 Correct 794 ms 13984 KB Output is correct
16 Correct 802 ms 14036 KB Output is correct
17 Correct 885 ms 14404 KB Output is correct
18 Correct 835 ms 14316 KB Output is correct
19 Correct 767 ms 13880 KB Output is correct
20 Correct 824 ms 14328 KB Output is correct
21 Execution timed out 1068 ms 14244 KB Time limit exceeded
22 Halted 0 ms 0 KB -