oj.uz

Submission #98156

# Submission time Handle Problem Language Result Execution time Memory
98156 2019-02-21T02:54:37 Z luciocf Chase (CEOI17_chase) C++14
0 / 100
 603 ms 17528 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;

vector<int> grafo[maxn];

multiset<ll> S;

void dfs(int u, int p)
{
	S.insert(-(soma[u]-(ll)num[p]));

	for (auto v: grafo[u])
		if (v != p) dfs(v, u);
}

void solve(int u, int p)
{
	for (auto v: grafo[u])
	{
		if (v == p) continue;

		auto it = S.find(-soma[u]); S.erase(it);
		it = S.find(-(soma[v]-(ll)num[u])); S.erase(it);

		S.insert(-soma[v]); S.insert(-(soma[u]-(ll)num[v]));

		ll aux = 0LL, ind = 1;
		for (auto x: S)
		{
			aux += -x, ind++;
			if (ind > min(n, c)) break;
		}

		ans = max(ans, aux);

		solve(v, u);

		it = S.find(-soma[v]); S.erase(it);
		it = S.find(-(soma[u]-(ll)num[v])); S.erase(it);


		S.insert(-soma[u]); S.insert(-(soma[v]-(ll)num[u]));
	}
}

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); solve(1, 0);

	cout << ans << "\n";
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

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