Submission #1350445

#TimeUsernameProblemLanguageResultExecution timeMemory
1350445SulARoad Closures (APIO21_roads)C++20
7 / 100
16 ms4144 KiB
#include <bits/stdc++.h>
using namespace std;

vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
    vector<long long> ans(n);
    vector<long long> dp(n+1);
    for (int i = n-3; i >= 0; i--) {
        dp[i] = min(dp[i+1] + w[i], dp[i+2] + w[i+1]);
    }
    ans[0] = accumulate(w.begin(), w.end(), 0ll);
    ans[1] = dp[0];
    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...