Submission #569333

#	Time	Username	Problem	Language	Result	Execution time	Memory
569333		gavgav	Road Closures (APIO21_roads)	C++17	5 / 100	59 ms	6060 KiB

roads

#include<bits/stdc++.h>
using namespace std;
#define vec vector
#define ll long long
vec<ll>minimum_closure_costs(int n,vec<int> u,vec<int> v,vec<int> w){
    vec<ll> ws(n-1);
    ll sum=0;
    for(ll i=0;i<n-1;ws[i]=w[i],sum+=w[i],++i);
    sort(ws.begin(),ws.end(),greater<ll>());
  	vec<ll> ans(n, sum);
    for(ll i=1;i<n;++i){
        ans[i]=ans[i-1]-ws[i-1];
    }
    return ans;
}

• Subtask 1: 5 / 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