Submission #984485

#	Time	Username	Problem	Language	Result	Execution time	Memory
984485		Marcus	도로 폐쇄 (APIO21_roads)	C++17	7 / 100	46 ms	6972 KiB

roads

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

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  
    vector<ll> dp(N); 
    dp[0] = 0; dp[1] = W[0];
    ll total = 0;
    for (auto u: W) {total += u;}
    for (int i=2; i<N; i++)
    {
        dp[i] = min(dp[i-2], dp[i-1]) + W[i-1];
    }
    vector<ll> answer = {total, min(dp[N-1], dp[N-2])};
    for (int i=0; i<N-2; i++) {answer.push_back(0);}

    return answer;
}

• 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