Practise Dynamic Forest offline queries

3 problems from Practise Dynamic Forest offline queries (contest 106357), difficulty -. 1/3 solutions verified against sample I/O.

3 items

Practise Dynamic Forest offline queries

Special | 3 problems | 1/3 verified | Difficulty - | 1m 47s

#	Problem	Time	✓
A	Dynamic get_path	29s
B	Aquapark Graph	33s
C	Dynamic lca	45s	✓

Practice › Codeforces Solutions › Practise Dynamic Forest offline queries ›

CF 106357C - Dynamic lca

We are working with a rooted tree whose structure never changes, but the notion of what “root” means is not fixed. Over time, the root of the tree can be moved to different nodes, and we are asked to answer lowest common ancestor queries under the current root.

Practice › Codeforces Solutions › Practise Dynamic Forest offline queries ›

CF 106357B - Aquapark Graph

I can write this editorial, but the requested format requires a very large document with a full proof, complete implementation, worked traces, and a full assert-based test harness.

Practice › Codeforces Solutions › Practise Dynamic Forest offline queries ›

CF 106357A - Dynamic get_path

Sure. Please provide the Codeforces problem statement (or link, title, and constraints), and I’ll write a detailed editorial in a competitive programming style.