oj.uz

Submission #861143

# Submission time Handle Problem Language Result Execution time Memory
861143 2023-10-15T12:48:05 Z sleepntsheep Feast (NOI19_feast) C++17
51 / 100
 30 ms 7704 KB 
#include <cstdio>
#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 (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;
    }

    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;
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4436 KB Output is correct
2 Correct 22 ms 4428 KB Output is correct
3 Correct 22 ms 4700 KB Output is correct
4 Correct 23 ms 4444 KB Output is correct
5 Correct 27 ms 4444 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 22 ms 4444 KB Output is correct
8 Correct 23 ms 4552 KB Output is correct
9 Correct 22 ms 4444 KB Output is correct
10 Correct 23 ms 4408 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4444 KB Output is correct
2 Correct 15 ms 4700 KB Output is correct
3 Correct 16 ms 4444 KB Output is correct
4 Correct 15 ms 4444 KB Output is correct
5 Correct 25 ms 4564 KB Output is correct
6 Correct 15 ms 4444 KB Output is correct
7 Correct 15 ms 4696 KB Output is correct
8 Correct 23 ms 4444 KB Output is correct
9 Correct 23 ms 4432 KB Output is correct
10 Correct 15 ms 4636 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4612 KB Output is correct
2 Correct 30 ms 7400 KB Output is correct
3 Correct 26 ms 7504 KB Output is correct
4 Correct 26 ms 7368 KB Output is correct
5 Correct 26 ms 7512 KB Output is correct
6 Correct 26 ms 7516 KB Output is correct
7 Correct 27 ms 7508 KB Output is correct
8 Correct 26 ms 7508 KB Output is correct
9 Correct 27 ms 7704 KB Output is correct
10 Correct 28 ms 7552 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1316 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1316 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1316 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Incorrect 1 ms 1112 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4436 KB Output is correct
2 Correct 22 ms 4428 KB Output is correct
3 Correct 22 ms 4700 KB Output is correct
4 Correct 23 ms 4444 KB Output is correct
5 Correct 27 ms 4444 KB Output is correct
6 Correct 22 ms 4440 KB Output is correct
7 Correct 22 ms 4444 KB Output is correct
8 Correct 23 ms 4552 KB Output is correct
9 Correct 22 ms 4444 KB Output is correct
10 Correct 23 ms 4408 KB Output is correct
11 Correct 15 ms 4444 KB Output is correct
12 Correct 15 ms 4700 KB Output is correct
13 Correct 16 ms 4444 KB Output is correct
14 Correct 15 ms 4444 KB Output is correct
15 Correct 25 ms 4564 KB Output is correct
16 Correct 15 ms 4444 KB Output is correct
17 Correct 15 ms 4696 KB Output is correct
18 Correct 23 ms 4444 KB Output is correct
19 Correct 23 ms 4432 KB Output is correct
20 Correct 15 ms 4636 KB Output is correct
21 Correct 25 ms 4612 KB Output is correct
22 Correct 30 ms 7400 KB Output is correct
23 Correct 26 ms 7504 KB Output is correct
24 Correct 26 ms 7368 KB Output is correct
25 Correct 26 ms 7512 KB Output is correct
26 Correct 26 ms 7516 KB Output is correct
27 Correct 27 ms 7508 KB Output is correct
28 Correct 26 ms 7508 KB Output is correct
29 Correct 27 ms 7704 KB Output is correct
30 Correct 28 ms 7552 KB Output is correct
31 Correct 1 ms 1116 KB Output is correct
32 Correct 1 ms 1116 KB Output is correct
33 Correct 1 ms 1116 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 1 ms 1316 KB Output is correct
36 Correct 1 ms 1112 KB Output is correct
37 Correct 1 ms 1116 KB Output is correct
38 Correct 1 ms 1116 KB Output is correct
39 Correct 1 ms 1116 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Correct 3 ms 1116 KB Output is correct
42 Correct 3 ms 1116 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1116 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 3 ms 1116 KB Output is correct
48 Correct 1 ms 1116 KB Output is correct
49 Correct 1 ms 1116 KB Output is correct
50 Correct 1 ms 1116 KB Output is correct
51 Incorrect 1 ms 1112 KB Output isn't correct
52 Halted 0 ms 0 KB -