oj.uz

Submission #861139

# Submission time Handle Problem Language Result Execution time Memory
861139 2023-10-15T12:40:49 Z sleepntsheep Feast (NOI19_feast) C++17
25 / 100
 28 ms 5724 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;
        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;
    }

    if (k == 1)
    {
    }

    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]);
                }
            } }
        cout << dp[n][k];
    }

    return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:34:59: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   34 |         if (k == 1) return cout << max({p[x-1], p[n] - p[x], p[n]}), 0;
      |                                                        ~~~^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4440 KB Output is correct
2 Correct 22 ms 4576 KB Output is correct
3 Correct 24 ms 4436 KB Output is correct
4 Correct 28 ms 4596 KB Output is correct
5 Correct 23 ms 4568 KB Output is correct
6 Correct 23 ms 4436 KB Output is correct
7 Correct 23 ms 4444 KB Output is correct
8 Correct 22 ms 4492 KB Output is correct
9 Correct 24 ms 4588 KB Output is correct
10 Correct 26 ms 4436 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 4532 KB Output is correct
2 Correct 15 ms 4700 KB Output is correct
3 Correct 16 ms 5696 KB Output is correct
4 Incorrect 16 ms 5724 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 4408 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 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 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 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 1112 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 1 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 2 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 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1112 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 1112 KB Output is correct
12 Correct 3 ms 1116 KB Output is correct
13 Correct 1 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 2 ms 1116 KB Output is correct
20 Correct 1 ms 1116 KB Output is correct
21 Incorrect 1 ms 1116 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 4440 KB Output is correct
2 Correct 22 ms 4576 KB Output is correct
3 Correct 24 ms 4436 KB Output is correct
4 Correct 28 ms 4596 KB Output is correct
5 Correct 23 ms 4568 KB Output is correct
6 Correct 23 ms 4436 KB Output is correct
7 Correct 23 ms 4444 KB Output is correct
8 Correct 22 ms 4492 KB Output is correct
9 Correct 24 ms 4588 KB Output is correct
10 Correct 26 ms 4436 KB Output is correct
11 Correct 15 ms 4532 KB Output is correct
12 Correct 15 ms 4700 KB Output is correct
13 Correct 16 ms 5696 KB Output is correct
14 Incorrect 16 ms 5724 KB Output isn't correct
15 Halted 0 ms 0 KB -