# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
555959 | aryan12 | Road Closures (APIO21_roads) | C++17 | 58 ms | 9448 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;
const long long MAXN = 1e5 + 5;
vector<array<long long, 2> > g[MAXN];
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W)
{
long long sum = 0;
vector<long long> weights;
for(long long i = 0; i < U.size(); i++)
{
sum += W[i];
// cout << "U[i] = " << U[i] << ", V[i] = " << V[i] << ", W[i] = " << W[i] << "\n";
weights.push_back(W[i]);
}
vector<long long> ans;
ans.push_back(sum);
vector<long long> dp(N, 0);
dp[0] = weights[0];
dp[1] = weights[1];
for(int i = 2; i < N; i++)
{
dp[i] = min(dp[i - 2], dp[i - 1]) + weights[i];
}
ans.push_back(min(dp[N - 1], dp[N - 2]));
for(int i = 2; i < N; i++)
{
ans.push_back(0LL);
}
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... |