oj.uz

Submission #564866

# Submission time Handle Problem Language Result Execution time Memory
564866 2022-05-19T21:03:39 Z aryan12 Dostavljač (COCI18_dostavljac) C++17
140 / 140
 288 ms 2412 KB 
#include <bits/stdc++.h>
using namespace std;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 502;
int n, m;
vector<int> a(MAXN);
vector<int> g[MAXN];
int dp[MAXN][MAXN][2];

void dfs(int node, int par)
{
	for(int i = 1; i <= m; i++)
	{
		dp[node][i][1] = a[node];
		dp[node][i][0] = a[node];
	}
	for(int to: g[node])
	{
		if(to == par)
		{
			continue;
		}
		dfs(to, node);
		for(int tot_time = m; tot_time > 0; tot_time--)
		{
			for(int cur_time = tot_time; cur_time > 0; cur_time--)
			{
				if(tot_time - cur_time - 1 >= 0) dp[node][tot_time][0] = max(dp[node][tot_time][0], max(dp[to][cur_time][0], dp[to][cur_time][1]) + dp[node][tot_time - cur_time - 1][1]);
				if(tot_time - cur_time - 2 >= 0) dp[node][tot_time][0] = max(dp[node][tot_time][0], dp[to][cur_time][1] + dp[node][tot_time - cur_time - 2][0]);
				if(tot_time - cur_time - 2 >= 0) dp[node][tot_time][1] = max(dp[node][tot_time][1], dp[to][cur_time][1] + dp[node][tot_time - cur_time - 2][1]);
			}
		}
	}
}

void Solve() 
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	for(int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	if(n == 1)
	{
		cout << a[1] << "\n";
		return;
	}
	dfs(1, -1);
	cout << max(dp[1][m][1], dp[1][m][0]) << "\n";
}

int32_t main() 
{
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	// cin >> t;
	for(int i = 1; i <= t; i++) 
	{
		//cout << "Case #" << i << ": ";
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 476 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 752 KB Output is correct
2 Correct 3 ms 724 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 39 ms 940 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 1056 KB Output is correct
2 Correct 23 ms 1120 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1512 KB Output is correct
2 Correct 171 ms 1496 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 1860 KB Output is correct
2 Correct 56 ms 1828 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 2412 KB Output is correct
2 Correct 28 ms 2296 KB Output is correct