oj.uz

Submission #1113193

# Submission time Handle Problem Language Result Execution time Memory
1113193 2024-11-16T03:20:38 Z kzhi Feast (NOI19_feast) C++14
71 / 100
 127 ms 63568 KB 
/*
    Author : kmv a.k.a kzhi
    K41 IT CHV
*/
#include <bits/stdc++.h>
using namespace std;


#define int long long
#define ll long long
#define FOR(i,a,b) for (int i = a ; i <= b; ++ i)
#define FOD(i,a,b) for (int i = a; i >= b; -- i)


#define BIT(mask,i)       ((mask >> i) & 1)
#define MASK(i)                (1ll << (i))
#define OFFBIT(mask,i)  (mask &~(1ll<<(i)))
#define ONBIT(mask,i) (mask | (1ll << (i)))
#define lg2(x)    (63 - __builtin_clzll(x))
#define c_bit          __builtin_popcountll

#define vi vector < int >
#define all(a) a.begin(), a.end()
#define pb push_back

#define ii pair<int,int>
#define pll pair < ll, ll >
#define fi first
#define se second

#define openfile(TASK) if (fopen(TASK".inp","r"))\
        {freopen(TASK".inp","r",stdin);freopen(TASK".out","w",stdout);}
#define endl '\n'
#define Faster ios_base::sync_with_stdio(false); \
                        cin.tie(0);  cout.tie(0);

#define mid(l,r) ((l + r) >> 1)
#define left(id) (id << 1)
#define right(id) ((id << 1) | 1)
#define ci const int

template <class X, class Y> bool maximize(X &a, const Y &b){if(a < b) return a = b, true;return false;}
template <class X, class Y> bool minimize(X &a, const Y &b){if(a > b) return a = b, true;return false;}

const int N = 3e5 + 5;
const ll oo = 1e17 + 7;
const int LOG = lg2(N);

int n, k;
int a[N];
ll t[N];

ll sum(int l, int r){
    if (l > r)
        return 0;
    return t[r] - t[l - 1];
}

bool ok1 = 1;
int cnt2 = 0, pos2 = -1;

namespace SUB1{
    ll pt[N];

    void SOLVE(){
        pt[0] = oo;
        ll res = - oo;

        FOR (i, 1, n){
            pt[i] = min(t[i], pt[i - 1]);
            maximize(res, t[i] - pt[i - 1]);
            maximize(res, t[i]);
        }

        maximize(res, 0ll);
        cout << res;
    }
}

namespace SUB6{
    static const int maxN = 2e3 + 5;

    ll dp[maxN][maxN][2];

    ll sol(int i, int cnt, bool ok){
        if (i == n + 1 || cnt == k + 1)
            return 0;
        if (dp[i][cnt][ok] != - oo)
            return dp[i][cnt][ok];
        ll cur = - oo;

        if (!ok){
            maximize(cur, sol(i + 1, cnt, 1) + a[i]);

            maximize(cur, sol(i + 1, cnt, 0));
        }
        else{
            maximize(cur, sol(i + 1, cnt, 1) + a[i]);

            maximize(cur, sol(i + 1, cnt + 1, 0) + max(a[i], 0ll));
        }

        return dp[i][cnt][ok] = cur;
    }

    void SOLVE(){
        FOR (i, 0, maxN - 1)
            FOR (j, 0, maxN - 1)
                FOR (ok, 0, 1)
                    dp[i][j][ok] = - oo;


        cout << sol(1, 1, 0);
    }
}

namespace FULL {
    pll dp[N][2];

    void calc(int mid){
        dp[1][0] = {0, 0}, dp[1][1] = {a[1] - mid, 1};
        for(int i = 2; i <= n; i++){
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
            dp[i][1] = max(make_pair(dp[i - 1][0].first + a[i] - mid, dp[i - 1][0].second + 1), make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second));
        }
    }

    void SOLVE(){
        ll l = -1, r = oo;

        while (l + 1 < r){
            ll mid = mid(l, r);
            calc(mid);

            if(max(dp[n][0], dp[n][1]).second >= k)
                l = mid;
            else
                r = mid;
        }

        calc(l);

        cout << l * k + max(dp[n][0], dp[n][1]).fi;
    }
}

void SOLVE(){
    cin >> n >> k;

    FOR (i, 1, n){
        cin >> a[i];
        t[i] = t[i - 1] + a[i];
        if (a[i] < 0){
            ok1 = 0;
            cnt2 ++;
            pos2 = i;
        }
    }

    if (ok1){
        cout << t[n];
        return;
    }

    if (cnt2 == 1){
        if (k >= 2)
            cout << t[n] - a[pos2];
        else
            cout << max({t[n], sum(1, pos2 - 1), sum(pos2 + 1, n)});
        return;
    }

    if (k == 1){
        SUB1 :: SOLVE();
        return;
    }

    if (n <= 2000 && k <= 2000){
        SUB6 :: SOLVE();
        return;
    }

    FULL :: SOLVE();
}

signed main(){
    Faster
    openfile("feast")

    int q = 1;

//    cin >> q;

    while (q --){
        SOLVE();
    }

    return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:32:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         {freopen(TASK".inp","r",stdin);freopen(TASK".out","w",stdout);}
      |          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
feast.cpp:188:5: note: in expansion of macro 'openfile'
  188 |     openfile("feast")
      |     ^~~~~~~~
feast.cpp:32:47: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         {freopen(TASK".inp","r",stdin);freopen(TASK".out","w",stdout);}
      |                                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:188:5: note: in expansion of macro 'openfile'
  188 |     openfile("feast")
      |     ^~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4944 KB Output is correct
2 Correct 25 ms 4944 KB Output is correct
3 Correct 24 ms 4936 KB Output is correct
4 Correct 25 ms 4944 KB Output is correct
5 Correct 25 ms 4944 KB Output is correct
6 Correct 25 ms 4944 KB Output is correct
7 Correct 24 ms 4952 KB Output is correct
8 Correct 24 ms 5104 KB Output is correct
9 Correct 25 ms 4940 KB Output is correct
10 Correct 25 ms 4880 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 4944 KB Output is correct
2 Correct 18 ms 5800 KB Output is correct
3 Correct 19 ms 4944 KB Output is correct
4 Correct 16 ms 4944 KB Output is correct
5 Correct 23 ms 4944 KB Output is correct
6 Correct 21 ms 4944 KB Output is correct
7 Correct 17 ms 4944 KB Output is correct
8 Correct 25 ms 4944 KB Output is correct
9 Correct 25 ms 4972 KB Output is correct
10 Correct 17 ms 4944 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7240 KB Output is correct
2 Correct 28 ms 7244 KB Output is correct
3 Correct 28 ms 7272 KB Output is correct
4 Correct 28 ms 7120 KB Output is correct
5 Correct 36 ms 7296 KB Output is correct
6 Correct 26 ms 7248 KB Output is correct
7 Correct 26 ms 7248 KB Output is correct
8 Correct 27 ms 7264 KB Output is correct
9 Correct 27 ms 7424 KB Output is correct
10 Correct 27 ms 7428 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 40 ms 63304 KB Output is correct
3 Correct 42 ms 63312 KB Output is correct
4 Correct 39 ms 63272 KB Output is correct
5 Correct 40 ms 63204 KB Output is correct
6 Correct 41 ms 63292 KB Output is correct
7 Correct 45 ms 63456 KB Output is correct
8 Correct 44 ms 63192 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 39 ms 63268 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 40 ms 63304 KB Output is correct
3 Correct 42 ms 63312 KB Output is correct
4 Correct 39 ms 63272 KB Output is correct
5 Correct 40 ms 63204 KB Output is correct
6 Correct 41 ms 63292 KB Output is correct
7 Correct 45 ms 63456 KB Output is correct
8 Correct 44 ms 63192 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 39 ms 63268 KB Output is correct
11 Correct 42 ms 63304 KB Output is correct
12 Correct 41 ms 63304 KB Output is correct
13 Correct 40 ms 63304 KB Output is correct
14 Correct 39 ms 63352 KB Output is correct
15 Correct 40 ms 63392 KB Output is correct
16 Correct 40 ms 63312 KB Output is correct
17 Correct 40 ms 63312 KB Output is correct
18 Correct 45 ms 63344 KB Output is correct
19 Correct 54 ms 63244 KB Output is correct
20 Correct 45 ms 63428 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 40 ms 63304 KB Output is correct
3 Correct 42 ms 63312 KB Output is correct
4 Correct 39 ms 63272 KB Output is correct
5 Correct 40 ms 63204 KB Output is correct
6 Correct 41 ms 63292 KB Output is correct
7 Correct 45 ms 63456 KB Output is correct
8 Correct 44 ms 63192 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 39 ms 63268 KB Output is correct
11 Correct 42 ms 63304 KB Output is correct
12 Correct 41 ms 63304 KB Output is correct
13 Correct 40 ms 63304 KB Output is correct
14 Correct 39 ms 63352 KB Output is correct
15 Correct 40 ms 63392 KB Output is correct
16 Correct 40 ms 63312 KB Output is correct
17 Correct 40 ms 63312 KB Output is correct
18 Correct 45 ms 63344 KB Output is correct
19 Correct 54 ms 63244 KB Output is correct
20 Correct 45 ms 63428 KB Output is correct
21 Correct 52 ms 63436 KB Output is correct
22 Correct 67 ms 63384 KB Output is correct
23 Correct 60 ms 63568 KB Output is correct
24 Correct 53 ms 63408 KB Output is correct
25 Correct 54 ms 63568 KB Output is correct
26 Correct 58 ms 63464 KB Output is correct
27 Correct 58 ms 63384 KB Output is correct
28 Correct 47 ms 63512 KB Output is correct
29 Correct 47 ms 63568 KB Output is correct
30 Correct 46 ms 63560 KB Output is correct

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4944 KB Output is correct
2 Correct 25 ms 4944 KB Output is correct
3 Correct 24 ms 4936 KB Output is correct
4 Correct 25 ms 4944 KB Output is correct
5 Correct 25 ms 4944 KB Output is correct
6 Correct 25 ms 4944 KB Output is correct
7 Correct 24 ms 4952 KB Output is correct
8 Correct 24 ms 5104 KB Output is correct
9 Correct 25 ms 4940 KB Output is correct
10 Correct 25 ms 4880 KB Output is correct
11 Correct 16 ms 4944 KB Output is correct
12 Correct 18 ms 5800 KB Output is correct
13 Correct 19 ms 4944 KB Output is correct
14 Correct 16 ms 4944 KB Output is correct
15 Correct 23 ms 4944 KB Output is correct
16 Correct 21 ms 4944 KB Output is correct
17 Correct 17 ms 4944 KB Output is correct
18 Correct 25 ms 4944 KB Output is correct
19 Correct 25 ms 4972 KB Output is correct
20 Correct 17 ms 4944 KB Output is correct
21 Correct 29 ms 7240 KB Output is correct
22 Correct 28 ms 7244 KB Output is correct
23 Correct 28 ms 7272 KB Output is correct
24 Correct 28 ms 7120 KB Output is correct
25 Correct 36 ms 7296 KB Output is correct
26 Correct 26 ms 7248 KB Output is correct
27 Correct 26 ms 7248 KB Output is correct
28 Correct 27 ms 7264 KB Output is correct
29 Correct 27 ms 7424 KB Output is correct
30 Correct 27 ms 7428 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 40 ms 63304 KB Output is correct
33 Correct 42 ms 63312 KB Output is correct
34 Correct 39 ms 63272 KB Output is correct
35 Correct 40 ms 63204 KB Output is correct
36 Correct 41 ms 63292 KB Output is correct
37 Correct 45 ms 63456 KB Output is correct
38 Correct 44 ms 63192 KB Output is correct
39 Correct 1 ms 504 KB Output is correct
40 Correct 39 ms 63268 KB Output is correct
41 Correct 42 ms 63304 KB Output is correct
42 Correct 41 ms 63304 KB Output is correct
43 Correct 40 ms 63304 KB Output is correct
44 Correct 39 ms 63352 KB Output is correct
45 Correct 40 ms 63392 KB Output is correct
46 Correct 40 ms 63312 KB Output is correct
47 Correct 40 ms 63312 KB Output is correct
48 Correct 45 ms 63344 KB Output is correct
49 Correct 54 ms 63244 KB Output is correct
50 Correct 45 ms 63428 KB Output is correct
51 Correct 52 ms 63436 KB Output is correct
52 Correct 67 ms 63384 KB Output is correct
53 Correct 60 ms 63568 KB Output is correct
54 Correct 53 ms 63408 KB Output is correct
55 Correct 54 ms 63568 KB Output is correct
56 Correct 58 ms 63464 KB Output is correct
57 Correct 58 ms 63384 KB Output is correct
58 Correct 47 ms 63512 KB Output is correct
59 Correct 47 ms 63568 KB Output is correct
60 Correct 46 ms 63560 KB Output is correct
61 Correct 114 ms 14160 KB Output is correct
62 Incorrect 127 ms 17368 KB Output isn't correct
63 Halted 0 ms 0 KB -