제출 #1177933

#제출 시각아이디문제언어결과실행 시간메모리
1177933mahmudow_mahmyt도로 폐쇄 (APIO21_roads)C++20
0 / 100
20 ms3772 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>minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w){
	ll sum=0,mx=0;
	vector<ll> ans;
	for(int i=0;i<w.size();i++) sum+=w[i],mx=max(mx,sum);
	for(int i=1;i<=n;i++) ans.pb(0);
	ans[0]=sum,ans[1]=sum-mx;
	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...