Submission #626966

#	Time	Username	Problem	Language	Result	Execution time	Memory
626966		Glory	Road Closures (APIO21_roads)	C++17	0 / 100	35 ms	3248 KiB

roads

#include<bits/stdc++.h>

#define vi vector<int>
#define vll vector<long long>
using namespace std;

vll minimum_closure_costs(int N,vi U,vi V,vi W){
     vll ans(N+100,0);
     
     long long res = 0;
     for(auto it: W) res+= it;
 
     sort(W.begin(),W.end(),greater<int>());
 
     ans[0]=res;
 
     for(int i=1; i< N; i++){
        res-=W[i-1];
        ans[i]=res;
     }
 
     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