제출 #1177944

#제출 시각아이디문제언어결과실행 시간메모리
1177944mahmudow_mahmyt도로 폐쇄 (APIO21_roads)C++20
5 / 100
30 ms4680 KiB
#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mxn 100002
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
vector<ll> sub1(int n,vector<int> u,vector<int> v,vector<int> w){
	vector<ll> ans(n,0);
	sort(w.begin(),w.end(),greater<int>());
	for(int i=n-2;i>=0;i--){
		ans[i]=ans[i+1];
		ans[i]+=(ll)w[i];
	}
	return ans;
}
vector<ll> minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w){
	return sub1(n,u,v,w);
}
#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...