제출 #981234

#제출 시각아이디문제언어결과실행 시간메모리
981234Faisal_Saqib도로 폐쇄 (APIO21_roads)C++17
0 / 100
35 ms3416 KiB
#include "roads.h" #include <bits/stdc++.h> //#include "grader.cpp" #include <vector> using namespace std; #define ll long long vector<long long> minimum_closure_costs(int n, std::vector<int> u,std::vector<int> v,std::vector<int> w) { vector<long long> ans(n); ll even=0,odd=0; ll even1=0; ll odd1=0; ans[1]=1e17; for(int i=0;i<(n-1);i++) { ans[0]+=w[i]; if(i%2) { odd+=w[i]; } else{ even+=w[i]; } } for(int i=0;i<(n-1);i++) { if(i%2) { odd-=w[i]; odd1+=w[i]; } else{ even-=w[i]; even1+=w[i]; } ans[1]=min(ans[1],min(odd1,even1)+min(odd,even)); } 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...