# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
414057 | flashmt | Road Closures (APIO21_roads) | C++17 | 78 ms | 11860 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;
const long long oo = 1LL << 60;
int n;
vector<pair<int, int>> a[100100];
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) {
n = N;
int isLine = 1;
for (int i = 0; i < n - 1; i++)
{
a[U[i]].push_back({V[i], W[i]});
a[V[i]].push_back({U[i], W[i]});
if (U[i] != i || V[i] != i + 1)
isLine = 0;
}
vector<long long> ans(n);
ans[0] = accumulate(W.begin(), W.end(), 0LL);
// cout << ans[0] << endl;
// 1
if (a[0].size() == n - 1)
{
sort(W.begin(), W.end(), greater<int>());
for (int i = n - 2; i >= 0; i--)
ans[i] = ans[i + 1] + W[i];
return ans;
}
// 2
if (isLine)
{
vector<long long> f(n, oo);
f[0] = 0;
f[1] = W[0];
for (int i = 2; i < n; i++)
f[i] = min(f[i - 1], f[i - 2]) + W[i - 1];
ans[1] = min(f[n - 1], f[n - 2]);
}
return ans;
}
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... |