제출 #425864

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425864		Ozy	도로 폐쇄 (APIO21_roads)	C++17	7 / 100	72 ms	14228 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debugsl(a) cout << #a << " = " << a << ", "
#define debug(a) cout << #a << " = " << a << endl

#define MAX 100000
#define des first
#define peso second

vector< pair<lli,lli> > hijos[MAX+2];
lli dp[MAX+2][2];

std::vector <long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    vector<long long> res (N, 0);

    rep(i,0,N-2) {
        hijos[ U[i] ].push_back({V[i], W[i]});
        hijos[ V[i] ].push_back({U[i], W[i]});
    }

    rep(i,1,N-1) {
        for (auto h : hijos[i]) if (h.des == i-1) {

            dp[i][1] = dp[i-1][0];
            dp[i][0] = min(dp[i-1][0], dp[i-1][1]);
            dp[i][0] += h.peso;

            res[0] += h.peso;

        }
    }
    res[1] = min(dp[N-1][0], dp[N-1][1]);

    return res;
}

• 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