Submission #1075350

# Submission time Handle Problem Language Result Execution time Memory
1075350 2024-08-26T03:33:16 Z South_Cloud Feast (NOI19_feast) C++17
41 / 100
14 ms 60500 KB
#include<bits/stdc++.h>

using namespace std;

const int N = 2007;

int n, K, a[N];

long long f[N][N][2], ans = 0;

int main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cin >> n >> K;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= K; j++) {
            f[i][j][0] = max(f[i - 1][j][0], f[i - 1][j][1]);
            if(j > 0) f[i][j][1] = max(f[i - 1][j - 1][0], f[i - 1][j][1]) + a[i];
        }
    }
    for(int i = 0; i <= K; i++) ans = max(ans, max(f[n][i][0], f[n][i][1]));
    cout << ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 26972 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 8660 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10584 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10708 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 0 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 10588 KB Output is correct
12 Correct 1 ms 8660 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 10584 KB Output is correct
15 Correct 1 ms 10584 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 1 ms 10588 KB Output is correct
18 Correct 1 ms 10588 KB Output is correct
19 Correct 1 ms 10588 KB Output is correct
20 Correct 1 ms 10708 KB Output is correct
21 Correct 6 ms 41308 KB Output is correct
22 Correct 14 ms 60500 KB Output is correct
23 Correct 7 ms 46428 KB Output is correct
24 Correct 6 ms 46172 KB Output is correct
25 Correct 6 ms 48984 KB Output is correct
26 Correct 6 ms 47712 KB Output is correct
27 Correct 6 ms 47196 KB Output is correct
28 Correct 6 ms 46168 KB Output is correct
29 Correct 5 ms 44380 KB Output is correct
30 Correct 5 ms 45844 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -