oj.uz

Submission #595950

# Submission time Handle Problem Language Result Execution time Memory
595950 2022-07-14T08:19:16 Z Tenis0206 Feast (NOI19_feast) C++11
12 / 100
 95 ms 9656 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int oo = 0x3f3f3f3f;

int n,k;
int v[300005];
int sp[300005];

pair<int,int> dp[300005];

pair<int,int> get_val(int c)
{
    int Max = 0, nrval = 0;
    int Max_pref = 0, nrval_pref = 0;
    for(int i=1;i<=n;i++)
    {
        dp[i].first = Max_pref + sp[i] - c;
        dp[i].second = nrval_pref + 1;
        if(dp[i].first > Max || (dp[i].first==Max && dp[i].second < nrval))
        {
            Max = dp[i].first;
            nrval = dp[i].second;
        }
        if(Max - sp[i] > Max_pref || (Max - sp[i]==Max_pref && nrval < nrval_pref))
        {
            Max_pref = Max - sp[i];
            nrval_pref = nrval;
        }
    }
    return {Max,nrval};
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
        sp[i] = sp[i-1] + v[i];
    }
    int st = -oo;
    int dr = oo;
    while(st<=dr)
    {
        int mij = (st + dr) >> 1;
        pair<int,int> val = get_val(mij);
        if(val.second==k)
        {
            cout<<val.first + k * mij<<'\n';
            return 0;
        }
        if(val.second<k)
        {
            dr = mij - 1;
        }
        else
        {
            st = mij + 1;
        }
    }
    pair<int,int> val = get_val(st);
    cout<<val.first + k * st<<'\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 9408 KB Output is correct
2 Correct 47 ms 9560 KB Output is correct
3 Correct 46 ms 9648 KB Output is correct
4 Correct 46 ms 9548 KB Output is correct
5 Correct 44 ms 9524 KB Output is correct
6 Correct 44 ms 9424 KB Output is correct
7 Correct 49 ms 9400 KB Output is correct
8 Correct 48 ms 9596 KB Output is correct
9 Correct 44 ms 9432 KB Output is correct
10 Correct 46 ms 9536 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 9416 KB Output is correct
2 Correct 24 ms 9656 KB Output is correct
3 Correct 24 ms 9428 KB Output is correct
4 Correct 37 ms 9556 KB Output is correct
5 Correct 32 ms 9428 KB Output is correct
6 Correct 23 ms 9428 KB Output is correct
7 Correct 37 ms 9628 KB Output is correct
8 Correct 36 ms 9532 KB Output is correct
9 Correct 35 ms 9292 KB Output is correct
10 Correct 81 ms 9560 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 95 ms 9592 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 9408 KB Output is correct
2 Correct 47 ms 9560 KB Output is correct
3 Correct 46 ms 9648 KB Output is correct
4 Correct 46 ms 9548 KB Output is correct
5 Correct 44 ms 9524 KB Output is correct
6 Correct 44 ms 9424 KB Output is correct
7 Correct 49 ms 9400 KB Output is correct
8 Correct 48 ms 9596 KB Output is correct
9 Correct 44 ms 9432 KB Output is correct
10 Correct 46 ms 9536 KB Output is correct
11 Correct 27 ms 9416 KB Output is correct
12 Correct 24 ms 9656 KB Output is correct
13 Correct 24 ms 9428 KB Output is correct
14 Correct 37 ms 9556 KB Output is correct
15 Correct 32 ms 9428 KB Output is correct
16 Correct 23 ms 9428 KB Output is correct
17 Correct 37 ms 9628 KB Output is correct
18 Correct 36 ms 9532 KB Output is correct
19 Correct 35 ms 9292 KB Output is correct
20 Correct 81 ms 9560 KB Output is correct
21 Incorrect 95 ms 9592 KB Output isn't correct
22 Halted 0 ms 0 KB -