제출 #1199205

#제출 시각아이디문제언어결과실행 시간메모리
1199205origabaiRoad Closures (APIO21_roads)C++20
5 / 100
30 ms3772 KiB
#include "roads.h" #include <bits/stdc++.h> using namespace std; std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) { std::vector<long long> ans(N); ans[0] = accumulate(W.begin(),W.end(),0LL); sort(W.begin(),W.end(),std::greater<long long>()); for (int i=0;i<N-1;i++){ ans[i+1] = ans[i] - W[i]; } 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...