Submission #1162429

#TimeUsernameProblemLanguageResultExecution timeMemory
1162429brintonRoad Closures (APIO21_roads)C++20
5 / 100
40 ms3768 KiB
#include "roads.h"

#include <bits/stdc++.h>
using namespace std;
vector<long long> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W) {
  // sub1
  long long tot = 0;
  for(auto &i:W)tot += i;
  sort(W.rbegin(),W.rend());
  vector<long long> ans(N);
  ans[0] = tot;
  for(int i = 1;i < N;i++){
    ans[i] = ans[i-1]-W[i-1];
  }
  return ans;
}
#undef int
#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...