제출 #1061024

#제출 시각아이디문제언어결과실행 시간메모리
1061024stdfloat사이버랜드 (APIO23_cyberland)C++17
0 / 100
3045 ms1728508 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);
        }

        assert(dp[i][0] < 1e18);
    }

    double ans = 1e18;
    for (auto i : dp[H]) {
        if (i < ans) ans = i;
    }
    
    assert(ans < 1e18);

    return ans;
}
#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...