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 "roads.h"
#include <bits/stdc++.h>
using namespace std;
int i;
long long dp[100005][2];
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
vector<long long> ans(N, 0LL);
for (i=0; i < N-1; ++i) ans[0] += (long long)W[i];
dp[0][0] = 0LL;
dp[0][1] = 0LL;
for (i=1; i < N; ++i) {
dp[i][1] = dp[i-1][0];
dp[i][0] = min(dp[i-1][0], dp[i-1][1])+(long long)W[i-1];
}
ans[1] = min(dp[N-1][0], dp[N-1][1]);
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... |