Submission #569320

#	Time	Username	Problem	Language	Result	Execution time	Memory
569320		gavgav	Road Closures (APIO21_roads)	C++17	0 / 100	41 ms	3248 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, 0);
    ll sum=0;
    for(ll i=1;i<n;ws[i]=w[i-1],sum+=w[i-1],++i);
    sort(++(ws.begin()),ws.end(),greater<ll>());
    ll ans[n]{sum};
    for(ll i=1;i<n;++i){
        ans[i]=ans[i-1]-w[i-1];
    }
    return ws;
}

• 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