傳送門(mén) :http://www.lydsy.com/JudgeOnline/problem.php?id=1954

Pku3764 The xor-longest Path

Time Limit:?1 Sec??Memory Limit:?64 MB
Submit:?839??Solved:?369
[Submit][Status][Discuss]

Description

?給定一棵n個(gè)點(diǎn)的帶權(quán)樹(shù)，求樹(shù)上最長(zhǎng)的異或和路徑

Input

The input contains several test cases. The first line of each test case contains an integer n(1<=n<=100000), The following n-1 lines each contains three integers u(0 <= u < n),v(0 <= v < n),w(0 <= w < 2^31), which means there is an edge between node u and v of length w.

Output

For each test case output the xor-length of the xor-longest path.

Sample Input

4
1 2 3
2 3 4
2 4 6

Sample Output

7

HINT

The xor-longest path is 1->2->3, which has length 7 (=3 ⊕ 4)?
注意：結(jié)點(diǎn)下標(biāo)從1開(kāi)始到N....

對(duì)于x，y之間的異或和，等于x到根節(jié)點(diǎn)的異或和 ^ y到根節(jié)點(diǎn)的異或和。

然后把它們丟到trie里，貪心就好。

代碼待補(bǔ)

轉(zhuǎn)載于:https://www.cnblogs.com/kvrmnks/p/6917317.html

總結(jié)

以上是生活随笔為你收集整理的[bzoj 1954]Pku3764 The xor-longest Path的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。