# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528626 | DanerZein | Road Closures (APIO21_roads) | C++14 | 43 ms | 5772 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;
const int MAX_N=2e5+10;
ll dp[MAX_N];
int n;
/*ll knap(int id){
if(id>=n) return 0;
ll ans=knap(id+1);
ans=max(knap(id+2)+W[id],ans);
return ans;
}*/
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
std::vector<int> V,
std::vector<int> W) {
n=N;
vector<ll> res;
ll s=0;
for(int i=0;i<U.size();i++){
s+=W[i];
}
res.push_back(s);
dp[0]=0;
for(int i=0;i<N-1;i++){
dp[i+1]=dp[i];
dp[i+2]=dp[i]+W[i];
}
res.push_back(s-max(dp[N],dp[N-1]));
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... |