Submission #528622

#TimeUsernameProblemLanguageResultExecution timeMemory
528622DanerZeinRoad Closures (APIO21_roads)C++14
5 / 100
58 ms5644 KiB
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
  vector<ll> res;
  ll s=0;
  for(int i=0;i<N-1;i++) s+=W[i];
  sort(W.begin(),W.end());
  for(int i=W.size()-1;i>=0;i--){
    res.push_back(s);
    s-=W[i];
  }
  res.push_back(s);
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...