# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981244 | Faisal_Saqib | Road Closures (APIO21_roads) | 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 "roads.h"
#include <bits/stdc++.h>
#include "grader.cpp"
#include <vector>
using namespace std;
#define ll long long
const ll N=1e5+10;
ll f[N];
vector<long long> minimum_closure_costs(int n, std::vector<int> u,std::vector<int> v,std::vector<int> w) {
vector<long long> ans(n);
f[0]=f[1]=0;
for(int i=2;i<(n-1);i++)
{
f[i]=w[i-1]+f[i-1];
f[i]=min(f[i],w[i-2]+f[i-2]);
/*
0
|w[0]
1
|w[1]
2
|w[2]
3
|w[3]
4
|
*/
}
for(int i=0;i<(n-1);i++)
ans[0]+=w[i];
ans[1]=f[n-2];
return ans;
}