oj.uz

Submission #601033

# Submission time Handle Problem Language Result Execution time Memory
601033 2022-07-21T10:18:42 Z pakhomovee Stove (JOI18_stove) C++17
50 / 100
 1000 ms 3412 KB 
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define int long long
const int maxn = 100'001;
const int inf = 1e18;
int dp[maxn];
int dp1[maxn];
int p[maxn];

pair<int, int> eval(int lambda, vector<int> &t) {
    const int n = t.size();
    fill(dp, dp + maxn, inf);
    fill(p, p + maxn, -1);
    fill(dp1, dp1 + maxn, inf);
    dp[0] = 0;
    dp1[0] = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = i; j > 0; --j) {
            if (dp[i] > dp[j - 1] + t[i - 1] - t[j - 1] + 1 + lambda) {
                dp1[i] = dp1[j - 1] + 1;
                dp[i] = dp[j - 1] + t[i - 1] - t[j - 1] + 1 + lambda;
            } else if (dp[i] == dp[j - 1] + t[i - 1] - t[j - 1] + 1 + lambda) {
                dp1[i] = min(dp1[i], dp1[j - 1] + 1);
            }
        }
    }
    return { dp[n], dp1[n] };
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> t(n);
    for (int& i : t) {
        cin >> i;
    }
    int l = -1, r = 1e16;
    while (l + 1 < r) {
        int m = (l + r) / 2;
        if (eval(m, t).second > k) {
            l = m;
        } else {
            r = m;
        }
    }
    auto [a, b] = eval(r, t);
    cout << a - k * r;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2644 KB Output is correct
2 Correct 11 ms 2644 KB Output is correct
3 Correct 7 ms 2644 KB Output is correct
4 Correct 6 ms 2644 KB Output is correct
5 Correct 6 ms 2644 KB Output is correct
6 Correct 7 ms 2644 KB Output is correct
7 Correct 8 ms 2644 KB Output is correct
8 Correct 6 ms 2644 KB Output is correct
9 Correct 8 ms 2668 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2644 KB Output is correct
2 Correct 11 ms 2644 KB Output is correct
3 Correct 7 ms 2644 KB Output is correct
4 Correct 6 ms 2644 KB Output is correct
5 Correct 6 ms 2644 KB Output is correct
6 Correct 7 ms 2644 KB Output is correct
7 Correct 8 ms 2644 KB Output is correct
8 Correct 6 ms 2644 KB Output is correct
9 Correct 8 ms 2668 KB Output is correct
10 Correct 318 ms 2676 KB Output is correct
11 Correct 288 ms 2680 KB Output is correct
12 Correct 306 ms 2680 KB Output is correct
13 Correct 296 ms 2644 KB Output is correct
14 Correct 303 ms 2672 KB Output is correct
15 Correct 282 ms 2672 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2644 KB Output is correct
2 Correct 11 ms 2644 KB Output is correct
3 Correct 7 ms 2644 KB Output is correct
4 Correct 6 ms 2644 KB Output is correct
5 Correct 6 ms 2644 KB Output is correct
6 Correct 7 ms 2644 KB Output is correct
7 Correct 8 ms 2644 KB Output is correct
8 Correct 6 ms 2644 KB Output is correct
9 Correct 8 ms 2668 KB Output is correct
10 Correct 318 ms 2676 KB Output is correct
11 Correct 288 ms 2680 KB Output is correct
12 Correct 306 ms 2680 KB Output is correct
13 Correct 296 ms 2644 KB Output is correct
14 Correct 303 ms 2672 KB Output is correct
15 Correct 282 ms 2672 KB Output is correct
16 Execution timed out 1073 ms 3412 KB Time limit exceeded
17 Halted 0 ms 0 KB -