제출 #925239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
925239		TAhmed33	Road Closures (APIO21_roads)	C++17	0 / 100	35 ms	4500 KiB

roads

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <ll> minimum_closure_costs (int N, vector <int> u, vector <int> v, vector <int> w) {
    vector <ll> ans;
    sort(w.begin(), w.end());
    ll pref[(int)w.size() + 1] = {};
    for (int i = 0; i < (int)w.size(); i++) {
        pref[i + 1] = w[i + 1] + pref[i];
    }
    for (int i = 0; i < N; i++) {
        ans.push_back(pref[N - 1 - i]);
    }
    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