답안 #1019262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019262	2024-07-10T16:26:55 Z	Nicolaikrob	Feast (NOI19_feast)	C++17	21 / 100	1000 ms	262144 KB

feast

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n, k; cin >> n >> k;
    ll A[n+1], DP[n+2][k+2]; A[0] = 0;
    for(int i = 1; i <= n; i++) cin >> A[i];
    for(int i = 0; i < n+2; i++) DP[i][0] = 0;
    for(int i = 0; i < k+2; i++) DP[0][i] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) {
            DP[i][j] = DP[i-1][j];
            ll ns = A[i];
            for(int l = i-1; l >= 0; l--) {
                DP[i][j] = max(DP[i][j], DP[l][j-1]+ns);
                ns += A[l];
            }
        }
    }
    cout << DP[n][k];
}

Subtask #1

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	130 ms	262144 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1043 ms	10584 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1056 ms	12628 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 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	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	1 ms	344 KB	Output is correct

Subtask #5

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 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	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	1 ms	344 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	2 ms	536 KB	Output is correct
15	Correct	2 ms	508 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	4 ms	344 KB	Output is correct
18	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 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	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	1 ms	344 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	2 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	2 ms	536 KB	Output is correct
15	Correct	2 ms	508 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	4 ms	344 KB	Output is correct
18	Correct	1 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	538 ms	3664 KB	Output is correct
22	Execution timed out	1061 ms	25948 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #7

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	130 ms	262144 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-