| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367814 | fotonoinoi | Road Closures (APIO21_roads) | C++20 | 30 ms | 9772 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)
{
vector<long long> ans;
vector<vector<int>> v(N);
long long sum=0;
for(int i=0;i<N-1;i++)
{
v[U[i]].push_back(V[i]);
v[V[i]].push_back(U[i]);
sum+=W[i];
}
sort(W.begin(),W.end(),greater<int>());
ans.push_back(sum);
for(int i=0;i<N-1;i++)
{
sum-=W[i];
ans.push_back(sum);
}
return ans;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
