oj.uz

Submission #573598

# Submission time Handle Problem Language Result Execution time Memory
573598 2022-06-06T21:49:05 Z danikoynov Feast (NOI19_feast) C++14
100 / 100
 295 ms 14464 KB 
/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 3e5 + 10;

int n;
ll k, a[maxn], dp[maxn][2], cnt[maxn][2], par[maxn];

pair < ll, int > calc(ll cost)
{
    dp[0][1] = -1e18;
    for (int i = 1; i <= n; i ++)
    {
        dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
        dp[i][1] = max(dp[i - 1][0] - cost, dp[i - 1][1]) + a[i];
        cnt[i][1] = cnt[i][0] = 0;
        if (dp[i - 1][0] == dp[i][0])
            cnt[i][0] = max(cnt[i][0], cnt[i - 1][0]);
        if (dp[i - 1][1] == dp[i][0])
            cnt[i][0] = max(cnt[i][0], cnt[i - 1][1]);
        if (dp[i - 1][0] - cost + a[i] == dp[i][1])
            cnt[i][1] = max(cnt[i][1], cnt[i - 1][0] + 1);
        if (dp[i - 1][1] + a[i] == dp[i][1])
            cnt[i][1] = max(cnt[i][1], cnt[i - 1][1]);
    }

    //for (int i = 1; i <= n; i ++)
       // cout << dp[i][0] << " - " << dp[i][1] << endl;
        pair < ll, int > ans = {dp[1][0], cnt[1][0]};
    for (int i = 1; i <= n; i ++)
        for (int j = 0; j < 2; j ++)
        if (make_pair((ll)dp[i][j], (int)cnt[i][j]) > ans)
            ans = {dp[i][j], cnt[i][j]};
    return ans;
    /**for (int i = 1; i <= n; i ++)
    {
        dp[i] = dp[i - 1];
        cnt[i] = cnt[i - 1];
        for (int j = 1; j <= i; j ++)
        {
            ll sum = dp[j - 1] - cost + par[i] - par[j - 1];
            if (sum > dp[i])
                dp[i] = sum;
            if (sum == dp[i])
                cnt[i] = max(cnt[i], cnt[j - 1] + 1);
        }
    }
    pair < ll, int > ans = {dp[1], cnt[1]};
    for (int i = 2; i <= n; i ++)
        if (make_pair((ll)dp[i], (int)cnt[i]) > ans)
            ans = {dp[i], cnt[i]};
    return ans;*/
}
void solve()
{
    cin >> n >> k;

    ll cnt = 0, neg = 0;
    for (int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        if (a[i] >= 0)
            cnt ++;
        else
            neg ++;
        par[i] = par[i - 1] + a[i];
    }
    k = min(cnt, k);

    /**if (neg <= 1)
    {

        ll f1 = 0, f2 = 0, pos = -1;
        for (int i = 1; i <= n; i ++)
        {
            if (a[i] < 0)
            {
                pos = i;
                break;
            }
            f1 += a[i];
        }

        for (int i = n; i > 0; i --)
        {
            if (a[i] < 0)
            {
                pos = i;
                break;
            }
            f2 += a[i];
        }

        if (pos == -1)
        {
            cout << f1 << endl;
        }
        else
        {
            if (k >= 2)
            cout << f1 + f2 << endl;
            else
                cout << max(f1, max(f2, f1 + f2 + a[pos]));
        }
        ///return;
    }*/

    ll lf = 0, rf = 1e12;
    while(lf <= rf)
    {
        ll mf = (lf + rf) / 2;
        pair < double, int > cur = calc(mf);
        if (cur.second >= k)
            lf = mf + 1;
        else
            rf = mf - 1;
    }

    if (lf == 0)
    {
        pair < ll, int > cur1 = calc(0);
        cout << cur1.first << endl;
        return;
    }
    double p1 = lf - 1, p2 = lf;
    pair < ll, int > cur1 = calc(p1), cur2 = calc(p2);
    cur1.first = cur1.first + cur1.second * p1;
    cur2.first = cur2.first + cur2.second * p2;
    double part = 1.0 - (double)(cur1.second - k) / (double)(cur1.second - cur2.second);
    double slope = (cur1.first - cur2.first);
    double ans = cur2.first + slope * part;
    ///cout << cur1.second << " " << cur2.second << " " << part << " " << cur1.second - k << " " << k << endl;

    if (cur1.second == cur2.second)
    {
        cout << cur1.first << endl;
        return;
    }
    cout << (ll)round(ans) << endl;

}

int main()
{
    solve();
    return 0;
}
/**
7 1
3 4 -1 2 3 -5 1
*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 13900 KB Output is correct
2 Correct 176 ms 14156 KB Output is correct
3 Correct 181 ms 14464 KB Output is correct
4 Correct 183 ms 14196 KB Output is correct
5 Correct 178 ms 14204 KB Output is correct
6 Correct 176 ms 13896 KB Output is correct
7 Correct 181 ms 13884 KB Output is correct
8 Correct 180 ms 14156 KB Output is correct
9 Correct 175 ms 13972 KB Output is correct
10 Correct 182 ms 14048 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 14060 KB Output is correct
2 Correct 142 ms 14348 KB Output is correct
3 Correct 138 ms 14008 KB Output is correct
4 Correct 132 ms 14120 KB Output is correct
5 Correct 184 ms 13916 KB Output is correct
6 Correct 137 ms 13956 KB Output is correct
7 Correct 132 ms 14284 KB Output is correct
8 Correct 188 ms 14284 KB Output is correct
9 Correct 176 ms 13864 KB Output is correct
10 Correct 133 ms 14276 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 14336 KB Output is correct
2 Correct 199 ms 14148 KB Output is correct
3 Correct 201 ms 14176 KB Output is correct
4 Correct 198 ms 14028 KB Output is correct
5 Correct 201 ms 14088 KB Output is correct
6 Correct 202 ms 14256 KB Output is correct
7 Correct 205 ms 14264 KB Output is correct
8 Correct 208 ms 14172 KB Output is correct
9 Correct 206 ms 14244 KB Output is correct
10 Correct 207 ms 14248 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 2 ms 412 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct

Subtask #7
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 13900 KB Output is correct
2 Correct 176 ms 14156 KB Output is correct
3 Correct 181 ms 14464 KB Output is correct
4 Correct 183 ms 14196 KB Output is correct
5 Correct 178 ms 14204 KB Output is correct
6 Correct 176 ms 13896 KB Output is correct
7 Correct 181 ms 13884 KB Output is correct
8 Correct 180 ms 14156 KB Output is correct
9 Correct 175 ms 13972 KB Output is correct
10 Correct 182 ms 14048 KB Output is correct
11 Correct 135 ms 14060 KB Output is correct
12 Correct 142 ms 14348 KB Output is correct
13 Correct 138 ms 14008 KB Output is correct
14 Correct 132 ms 14120 KB Output is correct
15 Correct 184 ms 13916 KB Output is correct
16 Correct 137 ms 13956 KB Output is correct
17 Correct 132 ms 14284 KB Output is correct
18 Correct 188 ms 14284 KB Output is correct
19 Correct 176 ms 13864 KB Output is correct
20 Correct 133 ms 14276 KB Output is correct
21 Correct 204 ms 14336 KB Output is correct
22 Correct 199 ms 14148 KB Output is correct
23 Correct 201 ms 14176 KB Output is correct
24 Correct 198 ms 14028 KB Output is correct
25 Correct 201 ms 14088 KB Output is correct
26 Correct 202 ms 14256 KB Output is correct
27 Correct 205 ms 14264 KB Output is correct
28 Correct 208 ms 14172 KB Output is correct
29 Correct 206 ms 14244 KB Output is correct
30 Correct 207 ms 14248 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 2 ms 340 KB Output is correct
52 Correct 2 ms 412 KB Output is correct
53 Correct 2 ms 340 KB Output is correct
54 Correct 2 ms 340 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 2 ms 340 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 2 ms 340 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 255 ms 14020 KB Output is correct
62 Correct 295 ms 14320 KB Output is correct
63 Correct 213 ms 13984 KB Output is correct
64 Correct 254 ms 14188 KB Output is correct
65 Correct 262 ms 14248 KB Output is correct
66 Correct 251 ms 14156 KB Output is correct
67 Correct 247 ms 13996 KB Output is correct
68 Correct 208 ms 14232 KB Output is correct
69 Correct 199 ms 14000 KB Output is correct
70 Correct 201 ms 13904 KB Output is correct