Open heartlessly opened 5 years ago
https://heartlessly.github.io/problems/loj-10056/
Description给定一棵 $n\ (1 \leq n \leq 10^5)$ 个点的带权树，求树上最长的异或和路径。$(0 \leq 边权 < 2^{31})$
https://heartlessly.github.io/problems/loj-10056/
Description给定一棵 $n\ (1 \leq n \leq 10^5)$ 个点的带权树，求树上最长的异或和路径。$(0 \leq 边权 < 2^{31})$