Submission #1177951

#TimeUsernameProblemLanguageResultExecution timeMemory
1177951MuhammetRoad Closures (APIO21_roads)C++17
7 / 100
27 ms9100 KiB
#include "bits/stdc++.h"
#include "roads.h"
// #include "grader.cpp"

using namespace std;

#define ll long long

vector<ll> minimum_closure_costs(int n, vector<int> u1,
    vector<int> u2, vector<int> w) {
    vector <ll> ans(n, 0);
    vector <vector <ll>> dp(n+1, vector <ll> (2, 0));
    ll s = 0;
    for(int i = 0; i < n-1; i++) {
        s += w[i];
        dp[i+1][0] = max(dp[i][0], dp[i][1]);
        dp[i+1][1] = dp[i][0] + w[i];
    }
    ans[0] = s;
    ans[1] = (s - max(dp[n-1][0], dp[n-1][1]));
    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...