Submission #1223390

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223390		Jer	Road Closures (APIO21_roads)	C++20	7 / 100	45 ms	10172 KiB

roads

#include "roads.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

typedef long long ll;

const int MAXN = 100005;
int con[MAXN];
int n;
ll total = 0;
ll dp[MAXN];
ll w[MAXN];

ll solve(int i){
	if (dp[i] != -1)
		return dp[i];

	if (i == n - 1)
		return w[i];
	
	if (i == n - 2)
		return max(w[i], w[i + 1]);
	
	dp[i] = max(w[i] + solve(i + 2), solve(i + 1));
	return dp[i];
}

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	n = N;
	
	for (int i = 0; i < n - 1; i++)
		w[i] = (ll)W[i], total += w[i];
	
	vector<ll> res;

	memset(dp, -1, sizeof dp);

	res.push_back(total);
	res.push_back(total - solve(0));

	for (int i = 0; i < n - 2; i++)
		res.push_back(0);
	
	return res;
}

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