#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 5e18
#define nl '\n'
vector<ll> minimum_closure_costs(int n, vector<int> a, vector<int> b, vector<int> w){
vector<ll> ans(n);
ans[0] = accumulate(w.begin(), w.end(), 0ll);
for(ll i=2; i<n; i++) ans[i] = 0;
ll dp[2];
dp[0] = 0;
dp[1] = w[0];
for(ll i=1; i<n-1; i++){
ll x = dp[0];
dp[0] = max(dp[0], dp[1]);
dp[1] = x + w[i];
}
ans[1] = ans[0] - max(dp[0], dp[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... |