2020CCPC长春:F. Strange Memory(树上启发式合并 + 位运算预处理) 题意: 一颗树,每个点的权值为 a i a_i ai,计算 ∑ i = 1 n ∑ j = i + 1 n [ a i ⊕ a j = a l c a ( i , j ) ] ( i ⊕ j ) \sum_{i=1}^{n}\sum_{j=i+1}^{n}[a_i ⊕a_j=a_{lca(i,j)}](i⊕j) ∑i=1n∑j=i+1n[ai⊕aj=a