| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 528623 | DanerZein | Road Closures (APIO21_roads) | C++14 | 41 ms | 5560 KiB |
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 "roads.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct dato{
int u,v,w;
dato(int uu,int vv,int ww){
u=uu; v=vv;
w=ww;
}
};
const int MAX_N=1e5+10;
bool orden(dato a,dato b){
return a.w>b.w;
}
bool vis[MAX_N];
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
std::vector<int> V,
std::vector<int> W) {
vector<ll> res;
vector<dato> ed;
ll s=0;
for(int i=0;i<U.size();i++){
ed.push_back(dato{U[i],V[i],W[i]});
s+=W[i];
}
sort(ed.begin(),ed.end(),orden);
memset(vis,0,sizeof vis);
res.push_back(s);
for(int i=0;i<N-1;i++){
if(!vis[ed[i].u] && !vis[ed[i].v]){
s-=ed[i].w;
vis[ed[i].u]=1;
vis[ed[i].v]=1;
}
}
res.push_back(s);
while(res.size()!=N) res.push_back(0);
return res;
}
Compilation message (stderr)
| # | 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... | ||||
