oj.uz

Submission #104462

# Submission time Handle Problem Language Result Execution time Memory
104462 2019-04-06T23:28:19 Z luciocf Chase (CEOI17_chase) C++14
30 / 100
 697 ms 252604 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;
const int maxk = 110;

typedef long long ll;

int n, k;

int a[maxn];

ll soma[maxn];
ll d[2][maxn][maxk], ans;

ll ant[maxn][maxk];

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 <= k; i++)
		{
			ll D = max(d[0][v][i], d[0][v][i-1]+soma[v]-1ll*a[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)
{
	ans = max({ans, d[0][u][min(n, k)], soma[u]+d[0][u][min(n, k)-1]});

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

		for (int i = 1; i <= k; i++)
		{
			ant[u][i] = d[0][u][i];

			ll D = max(d[0][v][i], d[0][v][i-1]+soma[v]-1ll*a[u]);

			if (d[0][u][i] == D) d[0][u][i] = d[1][u][i];
		}

		for (int i = 1; i <= k; i++)
		{
			ll D = max(d[0][u][i], d[0][u][i-1]+soma[u]-1ll*a[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 <= k; i++)
			d[0][u][i] = ant[u][i];
	}
}

int main(void)
{
	scanf("%d %d", &n, &k);

	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);

	for (int i = 1; i < n; i++)
	{
		int u, v;
		scanf("%d %d", &u, &v);

		grafo[u].push_back(v); grafo[v].push_back(u);
	}

	for (int i = 1; i <= n; i++)
		for (auto v: grafo[i])
			soma[i] += 1ll*a[v];

	dfs(1, 0);
	rotate(1, 0);

	printf("%lld\n", ans);
}

Compilation message

chase.cpp: In function 'int main()':
chase.cpp:73:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
chase.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
chase.cpp:81:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &u, &v);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 5 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2688 KB Output is correct
5 Incorrect 5 ms 2688 KB Output isn't correct
6 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 Correct 5 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2688 KB Output is correct
5 Incorrect 5 ms 2688 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 509 ms 227768 KB Output is correct
2 Correct 489 ms 227764 KB Output is correct
3 Correct 279 ms 179696 KB Output is correct
4 Correct 389 ms 249984 KB Output is correct
5 Correct 697 ms 252604 KB Output is correct
6 Correct 673 ms 252408 KB Output is correct
7 Correct 677 ms 252220 KB Output is correct

Subtask #4
0 / 30.0

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