Submission #934579

#	Time	Username	Problem	Language	Result	Execution time	Memory
934579		MinaRagy06	Road Closures (APIO21_roads)	C++17	5 / 100	51 ms	21052 KiB

roads

#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "roads.h"
using namespace std;
#define ll long long

const int N = 100'005;
int t[N], curt;
vector<array<int, 2>> adj[N];
void build(int i, int p) {
	t[i] = curt++;
	vector<array<int, 2>> newadj;
	for (auto &[nxt, w] : adj[i]) {
		if (nxt == p) continue;
		build(nxt, i);
		newadj.push_back({t[nxt], w});
	}
	adj[i] = newadj;
}
vector<vector<int>> dp[N];
vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
	for (int i = 0; i < n - 1; i++) {
		adj[u[i]].push_back({v[i], w[i]});
		adj[v[i]].push_back({u[i], w[i]});
	}
	build(0, -1);
	sort(adj[0].begin(), adj[0].end(), [&] (array<int, 2> x, array<int, 2> y) {
		return x[1] < y[1];
			});
	vector<ll> ret(n);
	ll s = 0;
	for (int i = n - 1; i >= 0; i--) {
		ret[i] = s;
		if (i > 0) s += adj[0][n - 1 - i][1];
	}
	return ret;
}

• 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