Submission #48461

#	Time	Username	Problem	Language	Result	Execution time	Memory
48461		aleksami	Dostavljač (COCI18_dostavljac)	C++14	14 / 140	219 ms	2740 KiB

dostavljac

#include <bits/stdc++.h>

using namespace std;
#define MAXN 505
int n,m;
int dp[MAXN][MAXN][2];
int a[MAXN];
vector <int> g[MAXN];

void dfs(int v,int p)
{
	for(auto x:g[v])
	{
		if(x==p)continue;
		dfs(x,v);
		for(int i = m; i >= 0; i--)
		{
			for(int j = i; j >= 0; j--)
			{
				if(i-j-1>=0)dp[v][i][0]=max(dp[v][i][0],dp[v][j][1]+dp[x][i-j-1][0]);
				if(i-j-2>=0)dp[v][i][1]=max(dp[v][i][1],dp[v][j][1]+dp[x][i-j-2][1]);
			}
		}
	}
	for(int i = m; i >= 1; i--)
	{
		dp[v][i][0]=max(dp[v][i][0],dp[v][i-1][0]+a[v]);
		dp[v][i][1]=max(dp[v][i][1],dp[v][i-1][1]+a[v]);
		dp[v][i][0]=max(dp[v][i][0],dp[v][i][1]);
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	for(int i = 0; i < n-1; i++)
	{
		int u,v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1,0);
	cout << max(dp[1][m][0],dp[1][m][1]);
	return 0;
}

• 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