Submission #996465

# Submission time Handle Problem Language Result Execution time Memory
996465 2024-06-10T16:19:54 Z overwatch9 Stove (JOI18_stove) C++17
20 / 100
1000 ms 119640 KB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int N, K;
vector <int> t;
const int maxn = 5000 + 1;
ll dp[maxn][maxn];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> K;
    t.resize(N+1);
    for (int i = 1; i <= N; i++)
        cin >> t[i];
    ll ans = 1e18;
    for (int i = 0; i <= N; i++) {
        fill(dp[i], dp[i] + maxn, 1e18);
    }
    dp[0][0] = 0;
    for (int j = 1; j <= N; j++) {
        for (int k = 1; k <= K; k++) {
            for (int i = j; i <= N; i++) {
                dp[i][k] = min(dp[i][k], dp[j-1][k-1] + t[i] - t[j] + 1);
                if (i == N)
                    ans = min(ans, dp[i][k]);
            }
        }
    }
    cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 0 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 0 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 76 ms 119640 KB Output is correct
11 Correct 655 ms 119640 KB Output is correct
12 Execution timed out 1016 ms 119632 KB Time limit exceeded
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 0 ms 2652 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 0 ms 2652 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 0 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 76 ms 119640 KB Output is correct
11 Correct 655 ms 119640 KB Output is correct
12 Execution timed out 1016 ms 119632 KB Time limit exceeded
13 Halted 0 ms 0 KB -