oj.uz

답안 #861163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861163 2023-10-15T14:04:57 Z sleepntsheep Feast (NOI19_feast) C++17
30 / 100
 30 ms 3988 KB 
#include <cstdio>
#include <climits>
#include <functional>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll=long long;

#define N 300005
#define ALL(x) x.begin(), x.end()

int n, k, a[N];
long long p[N];

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) cin >> a[i], p[i] = p[i-1] + a[i];

    if (count_if(a+1, a+1+n,[](int x){ return x<0; }) == 0) return cout << accumulate(a+1,a+1+n, 0ll), 0;

    if (count_if(a+1, a+1+n,[](int x){ return x<0; }) == 1)
    {
        int x=0;
        for (int i = 1; i <= n; ++i) if (a[i] < 0) x = i;
        if (k == 1) return cout << max({p[x-1], p[n] - p[x], p[n]}), 0;
        else return cout << p[n] - a[x], 0;
    }

    if (k == 1)
    {
        long long ans = 0, mn = 0;
        for (int i = 1; i <= n; ++i) ans = max(ans, p[i] - mn), mn = min(mn, p[i]);
        return cout << ans, 0;
    }

    if (n <= 3000)
    {
        vector<vector<vector<long long>>> dp(2, vector<vector<long long>>(3005, vector<long long>(2)));
        long long ans = 0;
        for (int i = 1; i <= n; ++i)
        {
            for (int j = 1; j <= k; ++i)
            {
                dp[i&1][j][0] = max(dp[!(i&1)][j][0], dp[!(i&1)][j][1]);
                dp[i&1][j][1] = max({a[i] + dp[!(i&1)][j-1][0], a[i] + dp[!(i&1)][j][1]});
                ans = max({ans, dp[i&1][j][0], dp[i&1][j][1]});
            }
        }
        return cout << ans, 0;
    }

    if (n <= 300)
    {
        long long dp[305][305]{0};
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= k; ++j)
            {
                dp[i][j] = max({dp[i-1][j], dp[i][j], dp[i][j-1]});
                for (int l = 0; l < i; ++l) dp[i][j] = max(dp[i][j], dp[l][j-1] + p[i] - p[l]);
            }
        return cout << dp[n][k], 0;
    }

    assert(0);
#if 0
    {
        function<void(int, int, int, int, int)> compute = [&](int i, int l, int r, int optl, int optr)
        {
            if (l > r) return;
            int m = (l+r)/2;
            pair<long long, int> best = {LLONG_MIN, -1};
            for (int k = optl; k <= min(m, optr); ++k)
                best = max(best, {(dp[!(i&1)][k]) + p[m] - p[k], k});
            dp[i&1][m] = best.first;
            compute(i, l, m-1, optl, best.second), compute(i, m+1, r, best.second, optr);
        };

        long long ans = 0;
        for (int i = 1; i <= k; ++i)
        {
            compute(i, 1, n, 0, n-1);
            for (int i = 1; i <= n; ++i) dp[i&1][i] = max(dp[i&1][i], dp[i&1][i-1]);
            ans = max(ans, *max_element(dp[i&1], dp[i&1]+n+1));
        }
        return cout << ans,0;
    }
#endif

    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 3668 KB Output is correct
2 Correct 23 ms 3664 KB Output is correct
3 Correct 23 ms 3920 KB Output is correct
4 Correct 23 ms 3928 KB Output is correct
5 Correct 22 ms 3932 KB Output is correct
6 Correct 22 ms 3676 KB Output is correct
7 Correct 28 ms 3748 KB Output is correct
8 Correct 23 ms 3932 KB Output is correct
9 Correct 22 ms 3628 KB Output is correct
10 Correct 22 ms 3932 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 3676 KB Output is correct
2 Correct 15 ms 3732 KB Output is correct
3 Correct 15 ms 3676 KB Output is correct
4 Correct 15 ms 3688 KB Output is correct
5 Correct 22 ms 3676 KB Output is correct
6 Correct 14 ms 3676 KB Output is correct
7 Correct 15 ms 3988 KB Output is correct
8 Correct 23 ms 3924 KB Output is correct
9 Correct 22 ms 3676 KB Output is correct
10 Correct 20 ms 3932 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3920 KB Output is correct
2 Correct 25 ms 3676 KB Output is correct
3 Correct 27 ms 3816 KB Output is correct
4 Correct 25 ms 3664 KB Output is correct
5 Correct 25 ms 3820 KB Output is correct
6 Correct 30 ms 3856 KB Output is correct
7 Correct 25 ms 3928 KB Output is correct
8 Correct 25 ms 3856 KB Output is correct
9 Correct 25 ms 3932 KB Output is correct
10 Correct 25 ms 3924 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 3 ms 1468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 3 ms 1468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 3 ms 1468 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 3668 KB Output is correct
2 Correct 23 ms 3664 KB Output is correct
3 Correct 23 ms 3920 KB Output is correct
4 Correct 23 ms 3928 KB Output is correct
5 Correct 22 ms 3932 KB Output is correct
6 Correct 22 ms 3676 KB Output is correct
7 Correct 28 ms 3748 KB Output is correct
8 Correct 23 ms 3932 KB Output is correct
9 Correct 22 ms 3628 KB Output is correct
10 Correct 22 ms 3932 KB Output is correct
11 Correct 15 ms 3676 KB Output is correct
12 Correct 15 ms 3732 KB Output is correct
13 Correct 15 ms 3676 KB Output is correct
14 Correct 15 ms 3688 KB Output is correct
15 Correct 22 ms 3676 KB Output is correct
16 Correct 14 ms 3676 KB Output is correct
17 Correct 15 ms 3988 KB Output is correct
18 Correct 23 ms 3924 KB Output is correct
19 Correct 22 ms 3676 KB Output is correct
20 Correct 20 ms 3932 KB Output is correct
21 Correct 25 ms 3920 KB Output is correct
22 Correct 25 ms 3676 KB Output is correct
23 Correct 27 ms 3816 KB Output is correct
24 Correct 25 ms 3664 KB Output is correct
25 Correct 25 ms 3820 KB Output is correct
26 Correct 30 ms 3856 KB Output is correct
27 Correct 25 ms 3928 KB Output is correct
28 Correct 25 ms 3856 KB Output is correct
29 Correct 25 ms 3932 KB Output is correct
30 Correct 25 ms 3924 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Runtime error 3 ms 1468 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -