Submission #981253

#TimeUsernameProblemLanguageResultExecution timeMemory
981253Faisal_SaqibRoad Closures (APIO21_roads)C++17
0 / 100
28 ms4180 KiB
#include "roads.h" #include <bits/stdc++.h> //#include "grader.cpp" #include <vector> using namespace std; #define ll long long 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); vector<ll> f(n+2); f[0]=f[1]=0; for(int i=2;i<(n-1);i++) f[i]=min(((ll)w[i-1])+f[i-1],((ll)w[i-2])+f[i-2]); for(int i=0;i<(n-1);i++) ans[0]+=((ll)w[i]); ans[1]=f[n-2]; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...