oj.uz

Submission #104461

# Submission time Handle Problem Language Result Execution time Memory
104461 2019-04-06T23:24:44 Z luciocf Chase (CEOI17_chase) C++14
100 / 100
 914 ms 327576 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 ant[2][maxn][maxk], ant_child[maxk];

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

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 x = soma[v]-1ll*a[u];

			ll D = max(d[0][v][i], x+d[0][v][i-1]);

			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 <= k; i++)
		ans = max({ans, d[0][u][i], soma[u]+d[0][u][i-1]});

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

		for (int i = 1; i <= k; i++)
			ant_child[i] = d[0][v][i];

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

			ll x = soma[v]-1ll*a[u];

			ll D = max(d[0][v][i], x+ant_child[i-1]);

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

			x = soma[u]-1ll*a[v];

			D = max(d[0][u][i], x+d[0][u][i-1]);
				
			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[0][u][i], d[1][u][i] = ant[1][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:79: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:82:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~
chase.cpp:87: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
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct
7 Correct 8 ms 5376 KB Output is correct
8 Correct 7 ms 5504 KB Output is correct
9 Correct 6 ms 4480 KB Output is correct
10 Correct 8 ms 6016 KB Output is correct
11 Correct 8 ms 5888 KB Output is correct
12 Correct 10 ms 5888 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 682 ms 272612 KB Output is correct
2 Correct 651 ms 272612 KB Output is correct
3 Correct 340 ms 179820 KB Output is correct
4 Correct 404 ms 321144 KB Output is correct
5 Correct 893 ms 325760 KB Output is correct
6 Correct 880 ms 325476 KB Output is correct
7 Correct 914 ms 325224 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct
7 Correct 8 ms 5376 KB Output is correct
8 Correct 7 ms 5504 KB Output is correct
9 Correct 6 ms 4480 KB Output is correct
10 Correct 8 ms 6016 KB Output is correct
11 Correct 8 ms 5888 KB Output is correct
12 Correct 10 ms 5888 KB Output is correct
13 Correct 682 ms 272612 KB Output is correct
14 Correct 651 ms 272612 KB Output is correct
15 Correct 340 ms 179820 KB Output is correct
16 Correct 404 ms 321144 KB Output is correct
17 Correct 893 ms 325760 KB Output is correct
18 Correct 880 ms 325476 KB Output is correct
19 Correct 914 ms 325224 KB Output is correct
20 Correct 908 ms 326184 KB Output is correct
21 Correct 76 ms 9336 KB Output is correct
22 Correct 840 ms 327288 KB Output is correct
23 Correct 381 ms 323064 KB Output is correct
24 Correct 842 ms 327576 KB Output is correct
25 Correct 333 ms 181432 KB Output is correct
26 Correct 620 ms 274556 KB Output is correct
27 Correct 630 ms 274724 KB Output is correct