Submission #779090

# Submission time Handle Problem Language Result Execution time Memory
779090 2023-07-11T07:42:59 Z vjudge1 Stove (JOI18_stove) C++17
50 / 100
1000 ms 1452 KB
#include <bits/stdc++.h>

using namespace std;

int n, k;
vector <int> dp, v;

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

//    freopen("stove.in", "r", stdin);
//    freopen("stove.out", "w", stdout);

    cin >> n >> k;
    dp.resize(n + 1, INT_MAX);
    v.resize(n + 1);

    dp[1] = 1;

    for(int i = 1; i <= n; i ++)
        cin >> v[i];

    for(int i = 2; i <= n; i ++)
    {
        int last = min(k, i);
        for(int j = last; j >= 2; j --)
        {
            if(dp[j] != INT_MAX)
                dp[j] = min(dp[j] + v[i] - v[i - 1], dp[j - 1] + 1);
            else
                dp[j] = dp[j - 1] + 1;
        }
        dp[1] = dp[1] + v[i] - v[i - 1];

    }

    cout << dp[k];
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 372 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 6 ms 332 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 372 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 6 ms 332 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 13 ms 1284 KB Output is correct
17 Correct 21 ms 1452 KB Output is correct
18 Correct 123 ms 1356 KB Output is correct
19 Execution timed out 1012 ms 1356 KB Time limit exceeded
20 Halted 0 ms 0 KB -