#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |