oj.uz

Submission #795958

# Submission time Handle Problem Language Result Execution time Memory
795958 2023-07-28T01:06:44 Z 12345678 Feast (NOI19_feast) C++17
21 / 100
 1000 ms 32088 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e3+5;
ll n, k, dp[nx][nx], v[nx], qs[nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>v[i], qs[i]=qs[i-1]+v[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=0; j<=k; j++)
        {
            dp[i][j]=dp[i-1][j];
            if (j>0) for (int l=0; l<i; l++) dp[i][j]=max(dp[l][j-1]+qs[i]-qs[l], dp[i][j]);
            //cout<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
        }
    }
    cout<<dp[n][k];
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 10124 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 78 ms 30056 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 92 ms 32088 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 1 ms 596 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 592 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 3 ms 1616 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 2 ms 1484 KB Output is correct
16 Correct 2 ms 1384 KB Output is correct
17 Correct 3 ms 1492 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 3 ms 1616 KB Output is correct
12 Correct 3 ms 1492 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 3 ms 1492 KB Output is correct
15 Correct 2 ms 1484 KB Output is correct
16 Correct 2 ms 1384 KB Output is correct
17 Correct 3 ms 1492 KB Output is correct
18 Correct 1 ms 1364 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 998 ms 11152 KB Output is correct
22 Execution timed out 1083 ms 16296 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 10124 KB Time limit exceeded
2 Halted 0 ms 0 KB -