P9847 [ICPC2021 Nanjing R] Crystalfly 题解（SPJ）

本文主要是介绍P9847 [ICPC2021 Nanjing R] Crystalfly 题解（SPJ），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

[ICPC2021 Nanjing R] Crystalfly

传送门？

题面翻译

给定一个 $n(1\le n\le10^5)$ 个节点的树，每个节点上有 $a_i$ 只晶蝶。派蒙最初在 $1$ 号节点，并获得 $1$ 号节点的所有晶蝶，接下来每一秒她可以移动到相邻的节点上并获得节点上的所有晶蝶，但是当她每到达一个节点 $u$ 后，对于每个与 $u$ 相邻的节点 $v$ ，节点 $v$ 上的的晶蝶会在 $t_v(1\le t_v\le3)$ 秒内消失，在 $t_v$ 秒后再到达节点 $v$ 将无法获得节点上的晶蝶。现在需要你求出最多可以获得的晶蝶数。

题目描述

Paimon is catching crystalflies on a tree, which are a special kind of butterflies in Teyvat. A tree is a connected graph consisting of $n$ vertices and $(n - 1)$ undirected edges.

There are initially $a_i$ crystalflies on the $i$ -th vertex. When Paimon reaches a vertex, she can catch all the remaining crystalflies on the vertex immediately. However, the crystalflies are timid. When Paimon reaches a vertex, all the crystalflies on the adjacent vertices will be disturbed. For the $i$ -th vertex, if the crystalflies on the vertex are disturbed for the first time at the beginning of the $t^{'}$ -th second, they will disappear at the end of the $t' + t_{i})$ -th second.

At the beginning of the $0$ -th second, Paimon reaches vertex $1$ and stays there before the beginning of the $1$ -st second. Then at the beginning of each following second, she can choose one of the two operations:

Move to one of the adjacent vertices of her current vertex and stay there before the beginning of the next second (if the crystalflies in the destination will disappear at the end of that second she can still catch them).
Stay still in her current vertex before the beginning of the next second.

Calculate the maximum number of crystalflies Paimon can catch in $10^{10^{10^{10^{10}}}}$ seconds.

输入格式

There are multiple test cases. The first line of the input contains an integer $T$ indicating the number of test cases. For each test case:

The first line contains an integer $n$ ( $\le n \le 10^5$ ) indicating the number of vertices.

The second line contains $n$ integers $a_1, a_2, \cdots, a_n$ ( $\le a_i \le 10^9$ ) where $a_i$ is the number of crystalflies on the $i$ -th vertex.

The third line contains $n$ integers $t_1, t_2, \cdots, t_n$ ( $\le t_i \le 3$ ) where $t_i$ is the time before the crystalflies on the $i$ -th vertex disappear after disturbed.

For the next $(n - 1)$ lines, the $i$ -th line contains two integers $u_i$ and $v_i$ ( $\le u_i, v_i \le n$ ) indicating an edge connecting vertices $u_i$ and $v_i$ in the tree.

It’s guaranteed that the sum of $n$ of all the test cases will not exceed $10^6$ .

输出格式

For each test case output one line containing one integer indicating the maximum number of crystalflies Paimon can catch.

样例 #1

样例输入 #1

2
5
1 10 100 1000 10000
1 2 1 1 1
1 2
1 3
2 4
2 5
5
1 10 100 1000 10000
1 3 1 1 1
1 2
1 3
2 4
2 5

样例输出 #1

10101
10111

提示

For the first sample test case, follow the strategy below.

During the $0$ -th second
- Paimon arrives at vertex $1$ ;
- Paimon catches $1$ crystalfly;
- Crystalflies in vertices $2$ and $3$ are disturbed.
During the $1$ -st second
- Paimon arrives at vertex $3$ ;
- Paimon catches $100$ crystalflies.
During the $2$ -nd second
- Paimon arrives at vertex $1$ ;
- Crystalflies in vertex $2$ disappears.
During the $3$ -rd second
- Paimon arrives at vertex $2$ ;
- Crystalflies in vertices $4$ and $5$ are disturbed.
During the $4$ -th second
- Paimon arrives at vertex $5$ ;
- Paimon catches $10000$ crystalflies;
- Crystalflies in vertex $4$ disappears.

For the second sample test case, the optimal strategy is the same with the first sample test case. Crystalflies in vertex $2$ are scheduled to disappear at the end of the $3$ -rd (instead of the $2$ -nd) second, allowing Paimon to catch them.

$以上来自洛谷$

解题思路

好好看题，就知道是树形 $d p$ 。定义 $f_{u,0或1}$ 为遍历以 $u$ 为根的整棵子树且 $u$ 点的子节点的晶蝶消失（ $f_{u,0}$ ）或不消失（ $f_{u,1}$ ）的情况下所能获得的最大晶蝶数量。记与 $u$ 相邻的非父亲节点中 $t_i=3$ 的节点晶蝶数量的最大值和第二大值分别为 $ma x 1, ma x 2$ ，若不存在特判即可。
如果当前节点不存在 $t_i=3$ 的节点，则 $f_{u,0}=(\Sigma f_{v,1}(v\in son_u))+max(a_v)+f_{u,1}=\Sigma f_{v,1}(v\in son_u)$ 。
如果当前节点存在 $t_i=3$ 的节点，那么通过手动画图观察发现，记所有子节点的 $f_{v,1}$ 的和 $\Sigma f_{v,1}(v\in son_u)$ 为 $s u m$ ， $f_{u,0}$ 结果不变， $f_{u,1}=\max⁡(f_{v,0}+a_v+sum−f_{v,1}+max1,f_{v,0}+a_v+sum−f_{v,1}+max2)$
最后的答案为 $f_{1,1}+a_1$ 。

AC Code

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int Maxn = 1e5 + 5;
vector<int> g[Maxn];
int n, u, v;
int a[Maxn];
int f[Maxn], sum[Maxn], t[Maxn];
inline void dfs(int u, int fa) {int maxx = 0;multiset<int> st;for (int v : g[u]) {if (v == fa) {continue;}dfs(v, u);sum[u] += f[v];maxx = max(maxx, a[v]);if (t[v] == 3) {st.insert(a[v]);}}f[u] = sum[u] + maxx;st.insert(LONG_LONG_MIN);for (int v : g[u]) {if (v == fa) {continue;}if (t[v] == 3) {st.erase(st.find(a[v]));}f[u] = max(f[u], sum[u] - f[v] + a[v] + sum[v] + *st.rbegin());if (t[v] == 3) {st.insert(a[v]);}}
}
inline void solve() {cin >> n;for (int i = 1; i <= n; i++) {g[i].clear();f[i] = sum[i] = 0;}for (int i = 1; i <= n; i++) {cin >> a[i];}for (int i = 1; i <= n; i++) {cin >> t[i];}for (int i = 1; i <= n - 1; i++) {cin >> u >> v;g[u].push_back(v);g[v].push_back(u);}dfs(1, 0);cout << f[1] + a[1] << endl;
}
inline void work() {int T;cin >> T;while (T--) {solve();}
}
signed main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);work();return 0;
}