Submission #1200519

#TimeUsernameProblemLanguageResultExecution timeMemory
1200519ElayV13도로 폐쇄 (APIO21_roads)C++20
5 / 100
30 ms3772 KiB
#include "roads.h" #include <bits/stdc++.h> using namespace std; vector < long long > minimum_closure_costs(int n , vector < int > u , vector < int > v , vector < int > w) { vector < long long > res(n); sort(w.begin() , w.end()); reverse(w.begin() , w.end()); long long s = accumulate(w.begin() , w.end() , 0ll); for(int i = 0;i < w.size();i++) { res[i] = s; s -= w[i]; } return res; }
#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...