oj.uz

답안 #950591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950591 2024-03-20T13:14:56 Z VMaksimoski008 Feast (NOI19_feast) C++14
63 / 100
 99 ms 25948 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n, K, neg = 0;
    cin >> n >> K;

    vector<int> v(n+1);
    vector<ll> pref(n+1);
    for(int i=1; i<=n; i++) {
        cin >> v[i];
        neg += (v[i] < 0);
        pref[i] = pref[i-1] + v[i];
    }

    if(neg == 0) {
        cout << pref[n] << '\n';
        return 0;
    }

    if(neg == 1) {
        ll ans1=0, ans2=0, N=0;
        for(int i=1; i<=n; i++) if(v[i] < 0) N = v[i];

        for(int i=1; i<=N; i++) {
            if(v[i] < 0) break;
            ans1 += v[i];
        }

        for(int i=N; i>=1; i--) {
            if(v[i] < 0) break;
            ans2 += v[i];
        }

        if(K >= 2) cout << pref[n] - N << '\n';
        else cout << max({ ans1, ans2, pref[n] }) << '\n';
        return 0;
    }

    if(K == 1) {
        ll ans = 0, sum = 0, mn = 0;

        for(int i=1; i<=n; i++) {
            sum += v[i];
            ans = max(ans, sum - mn);
            mn = min(mn, sum);
        }

        cout << ans << '\n';
        return 0;
    }

    ll dp[n+1][K+1], mx[K+1];
    memset(dp, 0, sizeof(dp));
    memset(mx, 0, sizeof(mx));
 
    for(int i=1; i<=n; i++) {
        for(int j=0; j<=K; j++) {
            dp[i][j] = dp[i-1][j];
            if(j) dp[i][j] = max(dp[i][j], pref[i] + mx[j-1]);
        }

        for(int j=0; j<=K; j++) mx[j] = max(mx[j], dp[i][j] - pref[i]);
    }
 
    cout << dp[n][K] << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 4952 KB Output is correct
2 Correct 81 ms 4956 KB Output is correct
3 Correct 82 ms 4952 KB Output is correct
4 Correct 81 ms 5084 KB Output is correct
5 Correct 81 ms 4956 KB Output is correct
6 Correct 79 ms 4976 KB Output is correct
7 Correct 93 ms 4956 KB Output is correct
8 Correct 81 ms 4952 KB Output is correct
9 Correct 79 ms 4956 KB Output is correct
10 Correct 81 ms 4956 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 4952 KB Output is correct
2 Correct 55 ms 4952 KB Output is correct
3 Incorrect 43 ms 5204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 5068 KB Output is correct
2 Correct 85 ms 5004 KB Output is correct
3 Correct 89 ms 4956 KB Output is correct
4 Correct 99 ms 5004 KB Output is correct
5 Correct 87 ms 5064 KB Output is correct
6 Correct 92 ms 4956 KB Output is correct
7 Correct 88 ms 5096 KB Output is correct
8 Correct 90 ms 4956 KB Output is correct
9 Correct 96 ms 5456 KB Output is correct
10 Correct 87 ms 5108 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 3432 KB Output is correct
22 Correct 21 ms 25948 KB Output is correct
23 Correct 5 ms 6236 KB Output is correct
24 Correct 3 ms 3740 KB Output is correct
25 Correct 4 ms 4956 KB Output is correct
26 Correct 3 ms 3164 KB Output is correct
27 Correct 4 ms 4700 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 4952 KB Output is correct
2 Correct 81 ms 4956 KB Output is correct
3 Correct 82 ms 4952 KB Output is correct
4 Correct 81 ms 5084 KB Output is correct
5 Correct 81 ms 4956 KB Output is correct
6 Correct 79 ms 4976 KB Output is correct
7 Correct 93 ms 4956 KB Output is correct
8 Correct 81 ms 4952 KB Output is correct
9 Correct 79 ms 4956 KB Output is correct
10 Correct 81 ms 4956 KB Output is correct
11 Correct 43 ms 4952 KB Output is correct
12 Correct 55 ms 4952 KB Output is correct
13 Incorrect 43 ms 5204 KB Output isn't correct
14 Halted 0 ms 0 KB -