oj.uz

Submission #103432

# Submission time Handle Problem Language Result Execution time Memory
103432 2019-03-30T16:38:04 Z thiago4532 Chase (CEOI17_chase) C++17
0 / 100
 725 ms 274148 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int maxn = 1e5+10;
const int maxv = 110;
 
typedef long long ll;
 
int n, c;
int num[maxn];
 
ll soma[maxn], ans;
ll d[2][maxn][maxv], ant[2][maxn][maxv], ant2[maxv];
 
vector<int> grafo[maxn];
 
void dfs(int u, int p)
{
	for (auto v: grafo[u])
	{
		if (v == p) continue;
 
		dfs(v, u);
 
		for (int i = 1; i <= c; i++)
		{
			ll D = max(d[0][v][i], d[0][v][i-1]+soma[v]-(ll)num[u]);
 
			if (D > d[0][u][i]) d[1][u][i] = d[0][u][i], d[0][u][i] = D;
			else if (D > d[1][u][i]) d[1][u][i] = D;
		}
	}
}
 
void rotate(int u, int p)
{
	for (int i = 1; i <= c; i++)
		ans = max({ans, d[0][u][i], d[0][u][i-1]+soma[u]});
 
	for (auto v: grafo[u])
	{
		if (v == p) continue;
 
		for (int i = 1; i <= c; i++)
		{
			ant[0][u][i] = d[0][u][i], ant[1][u][i] = d[1][u][i];
 
			ll D = max(d[0][v][i], ant[0][v][i-1]+soma[v]-(ll)num[u]);
 
			if (d[0][u][i] == D) d[0][u][i] = d[1][u][i];
 
			D = max(d[0][u][i], d[0][u][i-1]+soma[u]-(ll)num[v]);
 
			if (D > d[0][v][i]) d[1][v][i] = d[0][v][i], d[0][v][i] = D;
			else if (D > d[1][v][i]) d[1][v][i] = D;
		}
 
		rotate(v, u);
 
		for (int i = 1; i <= c; i++)
			d[0][u][i] = ant[0][u][i], d[1][u][i] = ant[1][u][i];
	}
}
 
int main(void)
{
	ios::sync_with_stdio(false); cin.tie(0);
 
	cin >> n >> c;
 
	for (int i = 1; i <= n; i++)
		cin >> num[i];
 
	for (int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
 
		grafo[u].push_back(v); grafo[v].push_back(u);
	}
 
	for (int u = 1; u <= n; u++)
		for (auto v: grafo[u])
			soma[u] += (ll)num[v];
 
	dfs(1, 0); rotate(1, 0);
 
	cout << ans << "\n"; 
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Incorrect 5 ms 2944 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Incorrect 5 ms 2944 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 725 ms 274148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Incorrect 5 ms 2944 KB Output isn't correct
3 Halted 0 ms 0 KB -