Submission #1202340

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202340		jer033	Road Closures (APIO21_roads)	C++20	7 / 100	23 ms	4168 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    ll total = 0;
    for (int X: W)
        total = total + X;
    vector<ll> dp(N);
    dp[0] = 0;
    dp[1] = W[0];
    for (int i=2; i<N; i++)
        dp[i] = max(dp[i-1], W[i-1]+dp[i-2]);
    ll ans = total - dp[N-1];
    vector<ll> final_ans(N, 0);
    final_ans[0] = total; final_ans[1] = ans;
    return final_ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22