Submission #1177964

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177964		mahmudow_mahmyt	Road Closures (APIO21_roads)	C++20	5 / 100	32 ms	4936 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;
bool csub1(int &n,vector<int> &u,vector<int> &v,vector<int> &w){
	for(int i=0;i<u.size();i++) if(u[i]!=0) return false;
	return true;
}
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> sub2(int &n,vector<int> &u,vector<int> &v,vector<int> &w){
	ll dp[n+2][2];
	vector<ll> ans(n,0);
	dp[0][0]=0,dp[0][1]=0;
	for(int i=1;i<n;i++){
		ans[0]+=w[i];
		dp[i][0]=dp[i-1][0]+w[i-1];
		dp[i][1]=min(dp[i-1][1],dp[i-1][0]);
	} 
	ans[0]+=w[0];
	ans[1]=min(dp[n-1][0],dp[n-1][1]);
	return ans;
}
vector<ll> minimum_closure_costs(int n,vector<int> u,vector<int> v,vector<int> w){
	if(csub1(n,u,v,w)) return sub1(n,u,v,w);
	return sub2(n,u,v,w);
}

• Subtask 1: 5 / 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