제출 #1056217

#제출 시각아이디문제언어결과실행 시간메모리
1056217Gangsta도로 폐쇄 (APIO21_roads)C++14
0 / 100
34 ms3796 KiB
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back

using namespace std;

vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
	vector <ll> ans;
	ll sm = 0, sm1 = 0;
	for(int i = 0; i < n-1; i++){
		if(i % 2 == 1) sm += w[i];
		else sm1 += w[i];
	}
	for(int i = 0; i < n; i++){
		if(i == 0) ans.pb(sm+sm1);
		else if(i == 1) ans.pb(min(sm,sm1));
		else ans.pb(0);
	}
	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...