Submission #437705

#TimeUsernameProblemLanguageResultExecution timeMemory
437705ala2Road Closures (APIO21_roads)C++14
5 / 100
67 ms6400 KiB
#include "roads.h" #include <vector> #include<algorithm> using namespace std ; vector<long long>v; vector<long long> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W) { sort(W.begin(),W.end()); v.push_back(0); v.push_back(W[0]); for(int i=2;i<=N;i++) v.push_back(v[i-1]+W[i-1]); v.pop_back(); reverse(v.begin(),v.end()); return v; }
#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...