Submission #861137

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
861137	2023-10-15T12:37:33 Z	sleepntsheep	Feast (NOI19_feast)	C++17	21 / 100	3 ms	1128 KB

feast

#include <cstdio>
#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 305
#define ALL(x) x.begin(), x.end()

int n, k, a[N];
long long p[N];
long long dp[N][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];

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

Subtask #1

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	604 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	604 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	1 ms	472 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct

Subtask #5

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	1 ms	472 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	3 ms	1112 KB	Output is correct
12	Correct	3 ms	860 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	3 ms	1116 KB	Output is correct
15	Correct	3 ms	1112 KB	Output is correct
16	Correct	2 ms	976 KB	Output is correct
17	Correct	3 ms	1128 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	1112 KB	Output is correct

Subtask #6

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	1 ms	472 KB	Output is correct
3	Correct	1 ms	600 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	0 ms	604 KB	Output is correct
9	Correct	0 ms	604 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	3 ms	1112 KB	Output is correct
12	Correct	3 ms	860 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	3 ms	1116 KB	Output is correct
15	Correct	3 ms	1112 KB	Output is correct
16	Correct	2 ms	976 KB	Output is correct
17	Correct	3 ms	1128 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	1112 KB	Output is correct
21	Runtime error	1 ms	604 KB	Execution killed with signal 11
22	Halted	0 ms	0 KB	-

Subtask #7

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	600 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-