# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600705 | narvalo | Ferries (NOI13_ferries) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
int ferries(int n , int m , vector<int> a , vector<int> b , vector<int> c) {
vector<vector<pair<int , int>>> adj(n);
for (int i = 0 ; i < m ; i++) {
a[i] -= 1 , b[i] -= 1;
adj[a[i]].emplace_back(b[i] , c[i]);
adj[b[i]].emplace_back(a[i] , c[i]);
}
sort(c.rbegin() , c.rend());
if (m == n - 1) {
int ans = -1;
function<void(int , int , int)> Dfs = [&](int cur , int pre , int depth) {
if (cur == n - 1) {
ans = depth;
}
for (auto x : adj[cur]) {
if (x.first == pre) continue;
Dfs(x.first , cur , depth + 1);
}
return ;
};
Dfs(0 , -1 , 0);
int res = 0;
for (int i = 0 ; i < ans ; i += 1) {
res += c[i];
}
return res;
}
else {
int res = 0;
for (int i = 0 ; i < 2 ; i += 1) {
res += c[i];
}
return res;
}
}