classical problem: add delta to all nodes on the path to u->v, it is basically adding delta to u and v, then val[lca(u,v)]-=delta, then just use dfs to find answer.

My question is to ask: is there a way to answer online?

Like let us say we have q<=1e5 queries and n<=1e5: is there a way to find value of a node during queries? (just curious)

i just wanna ask if anyone finished BOI 2015 bowling(super hard to me)and could share your solutions here? link to problem:https://oj.uz/problem/view/BOI15_bow the solution is probably dp, using the fact that the score is at most 300 but the transition states are just disgustingly complex or did anyone solve it using maths.

USACO US OPEN silver division(my solutions) on youtube I only had brute force solution for third question Here's the link: https://www.youtube.com/watch?v=NXiLit7vrKM