제출 #1162505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1162505		tw20000807	도로 폐쇄 (APIO21_roads)	C++20	7 / 100	37 ms	11592 KiB

roads

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

vector<long long> minimum_closure_costs(int n, vector<int> u,  vector<int> v, vector<int> w){

    #define all(v) v.begin(), v.end()
    #define int long long
    #define pii pair<int, int>
    #define X first
    #define Y second
    #define SZ(s) ((int)s.size())

    vector< vector< pii > > g(n);
    vector< int > ans(n);
    for(int i = 0; i < n - 1; ++i){
        g[u[i]].push_back({v[i], w[i]});
        g[v[i]].push_back({u[i], w[i]});
        ans[0] += w[i];
    }
    vector< int > dp(n + 1);
    dp[1] = w[0], dp[2] = w[1];
    for(int i = 3; i < n; ++i) dp[i] = max(dp[i - 1], dp[i - 2] + w[i - 1]);
    ans[1] = ans[0] - *max_element(all(dp));
    return 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