Submission #1177942

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177942		mahmudow_mahmyt	Road Closures (APIO21_roads)	C++20	0 / 100	22 ms	4492 KiB

roads

#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){
	ll sum=0;
	vector<ll> ans(n,0);
	sort(w.begin(),w.end());
	for(int i=0;i<n;i++){
		if(i!=0) ans[i]=ans[i-1];
		ans[i]+=(ll)w[i];
	}
	reverse(ans.begin(),ans.end());
	return ans;
}
vector<ll> minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w){
	return sub1(n,u,v,w);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 14
• Subtask 4: 0 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22