Submission #1061013

#TimeUsernameProblemLanguageResultExecution timeMemory
1061013stdfloatCyberland (APIO23_cyberland)C++17
0 / 100
3065 ms1729044 KiB
#include <bits/stdc++.h>
#include "cyberland.h"
// #include "stub.cpp"
using namespace std;

double solve(int n, int M, int K, int H, vector<int> X, vector<int> Y, vector<int> C, vector<int> a) {
    vector<vector<double>> dp(H + 1, vector<double>(K + 1, 1e18));

    int l = H;
    while (0 < l && a[l]) l--;

    dp[l][0] = 0;
    for (int i = l + 1; i <= H; i++) {
        for (int j = 0; j <= K; j++) {
            if (dp[i - 1][j] < 1e18) dp[i][j] = min(dp[i][j], dp[i - 1][j] + C[i - 1]);
            if (j && a[i] == 2 && dp[i - 1][j - 1] < 1e18) dp[i][j] = min(dp[i][j], (dp[i - 1][j - 1] + C[i - 1]) / 2);
        }
    }

    return *min_element(dp[H].begin(), dp[H].end());
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...