Submission #735165

#	Time	Username	Problem	Language	Result	Execution time	Memory
735165		PoonYaPat	Road Closures (APIO21_roads)	C++14	0 / 100	24 ms	2764 KiB

roads

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
vector<ll> ans;
ll sum=0,dp[100001];

vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
    for (int i=0; i<n-1; ++i) sum+=W[i];
    ans.push_back(sum);

    dp[0]=0;
    dp[1]=W[0];
    for (int i=2; i<=n-1; ++i) dp[i]=min(dp[i-2],dp[i-1])+W[i-1];
    ans.push_back(min(dp[n-2],dp[n-1]));

    for (int i=2; i<n; ++i) ans.push_back(0);

    return ans;
}

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