Submission #981218

#TimeUsernameProblemLanguageResultExecution timeMemory
981218Faisal_SaqibRoad Closures (APIO21_roads)C++17
5 / 100
44 ms5560 KiB
#include "roads.h" #include <bits/stdc++.h> #include <vector> using namespace std; vector<long long> minimum_closure_costs(int n, std::vector<int> u,std::vector<int> v,std::vector<int> w) { bool subtask1=1; vector<long long> ans(n); for(int i=0;i<n;i++) { subtask1&=(u[i]==0); if(i<(n-1)) ans[0]+=w[i]; } if(subtask1) { sort(begin(w),end(w)); for(int i=1;i<n;i++) { ans[i]=ans[i-1]-w[n-i-1]; } return ans; } else{ } return std::vector<long long>(n, 0); }
#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...