Hi everyone!
I'm not sure that I'll be posting here very often, but I'll be mainly outlining interesting solutions to hard problems or just noting something worthwhile to think about for competitive programming.
Short summary: I couldn't manage to solve 1926G - Vlad and Trouble at MIT in-contest.
Although I recently promoted to the Silver division in USACO, I managed to fail horribly in solving graph-related problems. Before I was promoted, I also saw this issue from past Codeforces contests, especially in problem C (see 1830A - Copil Copac Draws Trees).