This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector <long long> minimum_closure_costs(int n, vector <int> u, vector <int> v, vector <int> w)
{
vector <long long> ans;
int sm = 0;
sort(w.begin(), w.end());
for(int i = 0; i < n-1; i++)
sm += w[i];
for(int i = 0; i < n-1; i++)
{
ans.push_back(sm);
sm -= w[i];
}
ans.push_back(0);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |