baseball strategy game

Topic: Given a tree, each point has a point right, several times to change the point of the right, multiple queries with the right center of gravity to all points of the sum of the right distanceNo regrets in this life into the east, the afterlife is willing to birth fantasy TownshipFirst we consider how to calculate the sum of the weighted distances of a point to all points and support the modificationIt would be nice to divide it with a dynamic tree.Each point records the sum of the weighted d

; PRE[U].PB (II (U,0)); for(intI=next[u];i;i=Edge[i].next) { if(Done[v=edge[i].to])Continue; Getdist (V,0, u,edge[i].dist); f[0]=size=S[v]; DFS (V,root=0); CH[U].PB (iii (ROOT,II (v,edge[i].dist))); Work (root); }}ll Cnt[maxn],sum[maxn];vectorSumdist[maxn];inlinevoidUpdateintx,ll y,ll z) { for(intI=0; I) { intu=pre[x][i].fi; Cnt[u]+=y;sum[u]+=z+y*pre[x][i].se; if(I!=pre[x].size ()-1) { intj=0; for(; J) if(ch[u][j].fi==pre[x][i+1].fi) sumdi

Standalone Li Biao's lineupWar support: Tang Sanzang, Sun Wukong, Fang Cun, prefectures, and Dragon PalaceArray: ground load arrayBabySimple strategy for standalone Li Biao 1Liu Hong does not need to worry about this issue. He will run in three rounds. He will first kill the Lions and camels next to him. The remaining four moles on the opposite side are all from the land and Putuo, it is better to kill 3 Prefectures and 1 Putuo. If you encounter 3