This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}
}
double ans = 1e18;
for (auto i : dp[H]) {
if (ans < i) ans = i;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |