Submission #200101

#	Time	Username	Problem	Language	Result	Execution time	Memory
200101		Saboon	Dostavljač (COCI18_dostavljac)	C++14	14 / 140	308 ms	2168 KiB

dostavljac

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 500 + 37;

int a[maxn];
vector<int> t[maxn];
short Time = 1, st[maxn], ft[maxn], pos[maxn];
short dis[maxn][maxn];
int dp[maxn][maxn];

void dfsdis(int v, int src, int par = -1){
	for (auto u : t[v]){
		if (u == par)
			continue;
		dis[src][u] = dis[src][v] + 1;
		dfsdis(u, src, v);
	}
}

void dfs(int v, int par = -1){
	pos[Time] = v;
	st[v] = Time ++;
	for (auto u : t[v])
		if (u != par)
			dfs(u, v);
}

int main(){
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 0; i < n - 1; i++){
		int v, u;
		cin >> v >> u;
		t[v].push_back(u);
		t[u].push_back(v);
	}
	for (int i = 1; i <= n; i++)
		dfsdis(i, i);
	dfs(1);
	memset(dp, -63, sizeof dp);
	dp[1][0] = 0, dp[1][1] = a[1];
	int answer = a[1];
	for (int i = 2; i <= n; i++){
		int v = pos[i];
		for (int x = 0; x <= m; x++){
			for (int j = 1; j < i; j++){
				int u = pos[j];
				if (dis[u][v] + 1 <= x)
					dp[i][x] = max(dp[i][x], dp[j][x - dis[u][v] - 1] + a[v]);
			}
			answer = max(answer, dp[i][x]);
		}
	}
	cout << answer << '\n';
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14