Submission #437702

#TimeUsernameProblemLanguageResultExecution timeMemory
437702ala2Road Closures (APIO21_roads)C++14
0 / 100
43 ms4104 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(W[0]);
                     for(int i=1;i<N;i++)
                    v.push_back(v[i-1]+W[i]);
             v.pop_back();
              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...