oj.uz

Submission #950587

# Submission time Handle Problem Language Result Execution time Memory
950587 2024-03-20T13:00:53 Z VMaksimoski008 Feast (NOI19_feast) C++14
43 / 100
 1000 ms 262144 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(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];
    memset(dp, 0, sizeof(dp));

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

    cout << dp[n][K] << '\n';
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4952 KB Output is correct
2 Correct 85 ms 5064 KB Output is correct
3 Correct 81 ms 4956 KB Output is correct
4 Correct 80 ms 5084 KB Output is correct
5 Correct 80 ms 5056 KB Output is correct
6 Correct 79 ms 4956 KB Output is correct
7 Correct 81 ms 4956 KB Output is correct
8 Correct 89 ms 5068 KB Output is correct
9 Correct 78 ms 4988 KB Output is correct
10 Correct 80 ms 4956 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 5000 KB Output is correct
2 Correct 46 ms 5104 KB Output is correct
3 Correct 43 ms 5208 KB Output is correct
4 Runtime error 198 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 4952 KB Output is correct
2 Correct 86 ms 4956 KB Output is correct
3 Correct 123 ms 4956 KB Output is correct
4 Correct 86 ms 4952 KB Output is correct
5 Correct 87 ms 4956 KB Output is correct
6 Correct 94 ms 5072 KB Output is correct
7 Correct 87 ms 4956 KB Output is correct
8 Correct 86 ms 4952 KB Output is correct
9 Correct 88 ms 5108 KB Output is correct
10 Correct 91 ms 4952 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 532 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 4 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 1 ms 348 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 532 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 4 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 1 ms 348 KB Output is correct
21 Correct 582 ms 3668 KB Output is correct
22 Execution timed out 1055 ms 25948 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4952 KB Output is correct
2 Correct 85 ms 5064 KB Output is correct
3 Correct 81 ms 4956 KB Output is correct
4 Correct 80 ms 5084 KB Output is correct
5 Correct 80 ms 5056 KB Output is correct
6 Correct 79 ms 4956 KB Output is correct
7 Correct 81 ms 4956 KB Output is correct
8 Correct 89 ms 5068 KB Output is correct
9 Correct 78 ms 4988 KB Output is correct
10 Correct 80 ms 4956 KB Output is correct
11 Correct 46 ms 5000 KB Output is correct
12 Correct 46 ms 5104 KB Output is correct
13 Correct 43 ms 5208 KB Output is correct
14 Runtime error 198 ms 262144 KB Execution killed with signal 9
15 Halted 0 ms 0 KB -